/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/mix047_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:47:16,943 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:47:16,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:47:16,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:47:16,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:47:16,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:47:16,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:47:16,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:47:16,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:47:16,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:47:16,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:47:16,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:47:16,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:47:16,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:47:16,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:47:17,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:47:17,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:47:17,001 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:47:17,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:47:17,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:47:17,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:47:17,006 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:47:17,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:47:17,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:47:17,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:47:17,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:47:17,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:47:17,012 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:47:17,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:47:17,013 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:47:17,013 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:47:17,014 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:47:17,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:47:17,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:47:17,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:47:17,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:47:17,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:47:17,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:47:17,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:47:17,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:47:17,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:47:17,022 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:47:17,045 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:47:17,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:47:17,048 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:47:17,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:47:17,048 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:47:17,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:47:17,048 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:47:17,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:47:17,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:47:17,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:47:17,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:47:17,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:47:17,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:47:17,049 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:47:17,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:47:17,049 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:47:17,050 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:47:17,050 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:47:17,050 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:47:17,050 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:47:17,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:47:17,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:47:17,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:47:17,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:47:17,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:47:17,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:47:17,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:47:17,051 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:47:17,051 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:47:17,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:47:17,051 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:47:17,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:47:17,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:47:17,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:47:17,373 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:47:17,375 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:47:17,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2021-03-25 04:47:17,437 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7374302/9ee9d14b2d1d41ef8cf2bd0fb92cb642/FLAG00766c52c [2021-03-25 04:47:17,849 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:47:17,850 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2021-03-25 04:47:17,859 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7374302/9ee9d14b2d1d41ef8cf2bd0fb92cb642/FLAG00766c52c [2021-03-25 04:47:17,868 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7374302/9ee9d14b2d1d41ef8cf2bd0fb92cb642 [2021-03-25 04:47:17,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:47:17,871 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:47:17,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:47:17,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:47:17,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:47:17,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:47:17" (1/1) ... [2021-03-25 04:47:17,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6572bea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:17, skipping insertion in model container [2021-03-25 04:47:17,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:47:17" (1/1) ... [2021-03-25 04:47:17,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:47:17,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:47:18,013 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/mix047_rmo.opt.i[948,961] [2021-03-25 04:47:18,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:47:18,225 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:47:18,232 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/mix047_rmo.opt.i[948,961] [2021-03-25 04:47:18,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:47:18,334 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:47:18,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:18 WrapperNode [2021-03-25 04:47:18,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:47:18,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:47:18,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:47:18,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:47:18,345 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:47:18" (1/1) ... [2021-03-25 04:47:18,375 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:47:18" (1/1) ... [2021-03-25 04:47:18,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:47:18,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:47:18,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:47:18,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:47:18,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:18" (1/1) ... [2021-03-25 04:47:18,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:18" (1/1) ... [2021-03-25 04:47:18,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:18" (1/1) ... [2021-03-25 04:47:18,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:18" (1/1) ... [2021-03-25 04:47:18,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:18" (1/1) ... [2021-03-25 04:47:18,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:18" (1/1) ... [2021-03-25 04:47:18,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:18" (1/1) ... [2021-03-25 04:47:18,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:47:18,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:47:18,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:47:18,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:47:18,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:18" (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:47:18,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:47:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:47:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:47:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:47:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:47:18,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:47:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:47:18,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:47:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:47:18,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:47:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 04:47:18,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 04:47:18,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:47:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:47:18,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:47:18,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:47:18,489 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:47:19,836 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:47:19,836 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:47:19,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:47:19 BoogieIcfgContainer [2021-03-25 04:47:19,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:47:19,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:47:19,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:47:19,840 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:47:19,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:47:17" (1/3) ... [2021-03-25 04:47:19,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ae8743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:47:19, skipping insertion in model container [2021-03-25 04:47:19,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:47:18" (2/3) ... [2021-03-25 04:47:19,841 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70ae8743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:47:19, skipping insertion in model container [2021-03-25 04:47:19,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:47:19" (3/3) ... [2021-03-25 04:47:19,842 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_rmo.opt.i [2021-03-25 04:47:19,846 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:47:19,849 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:47:19,849 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:47:19,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,869 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,870 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,870 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,870 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,870 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,870 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,871 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,871 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,871 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,871 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,871 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,871 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,872 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,872 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,872 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,872 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,872 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,872 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,873 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,874 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,875 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,875 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,875 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,875 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,875 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,875 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,875 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,875 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,875 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,875 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,875 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,875 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,875 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,876 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,876 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,877 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,877 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,877 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,877 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,877 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,877 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,877 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,877 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,877 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,878 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,878 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,879 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,879 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,879 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,880 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,880 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,880 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,881 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,881 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,882 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,883 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,883 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,883 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,883 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,883 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,883 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,883 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,883 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,883 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,884 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,884 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,884 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:47:19,884 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:47:19,896 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 04:47:19,908 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:47:19,908 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:47:19,908 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:47:19,908 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:47:19,908 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:47:19,908 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:47:19,908 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:47:19,909 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:47:19,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2021-03-25 04:47:19,941 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-25 04:47:19,941 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:47:19,944 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 85 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 04:47:19,944 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 116 transitions, 252 flow [2021-03-25 04:47:19,947 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 112 transitions, 236 flow [2021-03-25 04:47:19,948 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:19,953 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-25 04:47:19,955 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 236 flow [2021-03-25 04:47:19,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 236 flow [2021-03-25 04:47:19,969 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-03-25 04:47:19,969 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:47:19,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 04:47:19,972 INFO L142 LiptonReduction]: Number of co-enabled transitions 2598 [2021-03-25 04:47:21,189 WARN L205 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-25 04:47:21,709 WARN L205 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-25 04:47:22,913 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 314 DAG size of output: 269 [2021-03-25 04:47:23,423 WARN L205 SmtUtils]: Spent 507.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 04:47:23,657 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:47:23,990 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:47:24,094 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 04:47:24,942 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 04:47:25,198 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 04:47:25,778 WARN L205 SmtUtils]: Spent 578.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 04:47:26,342 WARN L205 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 04:47:26,820 INFO L154 LiptonReduction]: Checked pairs total: 4306 [2021-03-25 04:47:26,821 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-25 04:47:26,822 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6875 [2021-03-25 04:47:26,830 INFO L129 PetriNetUnfolder]: 0/27 cut-off events. [2021-03-25 04:47:26,830 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:47:26,830 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:26,831 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:47:26,831 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:26,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:26,837 INFO L82 PathProgramCache]: Analyzing trace with hash 316096465, now seen corresponding path program 1 times [2021-03-25 04:47:26,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:26,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407143272] [2021-03-25 04:47:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:27,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:27,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:47:27,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:27,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:27,082 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:47:27,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407143272] [2021-03-25 04:47:27,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:27,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:47:27,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27093607] [2021-03-25 04:47:27,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:47:27,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:27,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:47:27,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:47:27,125 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 191 [2021-03-25 04:47:27,127 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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:47:27,127 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:27,127 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 191 [2021-03-25 04:47:27,128 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:27,176 INFO L129 PetriNetUnfolder]: 23/109 cut-off events. [2021-03-25 04:47:27,176 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:47:27,177 INFO L84 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 109 events. 23/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 410 event pairs, 3 based on Foata normal form. 6/108 useless extension candidates. Maximal degree in co-relation 150. Up to 37 conditions per place. [2021-03-25 04:47:27,179 INFO L132 encePairwiseOnDemand]: 187/191 looper letters, 7 selfloop transitions, 2 changer transitions 6/46 dead transitions. [2021-03-25 04:47:27,179 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 126 flow [2021-03-25 04:47:27,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:47:27,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:47:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2021-03-25 04:47:27,192 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9092495636998255 [2021-03-25 04:47:27,192 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2021-03-25 04:47:27,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2021-03-25 04:47:27,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:27,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2021-03-25 04:47:27,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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:47:27,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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:47:27,205 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 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:47:27,206 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 521 transitions. [2021-03-25 04:47:27,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 126 flow [2021-03-25 04:47:27,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 46 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 04:47:27,209 INFO L241 Difference]: Finished difference. Result has 53 places, 37 transitions, 86 flow [2021-03-25 04:47:27,210 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2021-03-25 04:47:27,211 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -4 predicate places. [2021-03-25 04:47:27,211 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:27,211 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 37 transitions, 86 flow [2021-03-25 04:47:27,212 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 37 transitions, 86 flow [2021-03-25 04:47:27,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 37 transitions, 86 flow [2021-03-25 04:47:27,218 INFO L129 PetriNetUnfolder]: 0/37 cut-off events. [2021-03-25 04:47:27,218 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:47:27,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 37 events. 0/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:47:27,219 INFO L142 LiptonReduction]: Number of co-enabled transitions 392 [2021-03-25 04:47:27,570 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 04:47:27,852 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 04:47:28,401 WARN L205 SmtUtils]: Spent 547.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 04:47:28,949 WARN L205 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 04:47:30,017 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 04:47:30,157 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 04:47:30,457 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 04:47:30,620 WARN L205 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 04:47:30,624 INFO L154 LiptonReduction]: Checked pairs total: 2232 [2021-03-25 04:47:30,624 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-25 04:47:30,625 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3414 [2021-03-25 04:47:30,625 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2021-03-25 04:47:30,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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:47:30,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:30,626 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:30,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:47:30,626 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:30,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:30,626 INFO L82 PathProgramCache]: Analyzing trace with hash -2031321782, now seen corresponding path program 1 times [2021-03-25 04:47:30,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:30,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591626660] [2021-03-25 04:47:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:30,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:30,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:30,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:30,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:30,716 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:47:30,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591626660] [2021-03-25 04:47:30,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:30,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:47:30,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264245939] [2021-03-25 04:47:30,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:47:30,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:30,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:47:30,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:47:30,718 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 201 [2021-03-25 04:47:30,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 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:47:30,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:30,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 201 [2021-03-25 04:47:30,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:30,732 INFO L129 PetriNetUnfolder]: 3/39 cut-off events. [2021-03-25 04:47:30,732 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:47:30,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 39 events. 3/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 82 event pairs, 1 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2021-03-25 04:47:30,732 INFO L132 encePairwiseOnDemand]: 197/201 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-25 04:47:30,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 82 flow [2021-03-25 04:47:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:47:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:47:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2021-03-25 04:47:30,734 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8772802653399668 [2021-03-25 04:47:30,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 529 transitions. [2021-03-25 04:47:30,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 529 transitions. [2021-03-25 04:47:30,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:30,734 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 529 transitions. [2021-03-25 04:47:30,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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:47:30,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 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:47:30,736 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 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:47:30,736 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 529 transitions. [2021-03-25 04:47:30,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 82 flow [2021-03-25 04:47:30,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:47:30,737 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2021-03-25 04:47:30,737 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-25 04:47:30,737 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -18 predicate places. [2021-03-25 04:47:30,738 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:30,738 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-25 04:47:30,738 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-25 04:47:30,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 81 flow [2021-03-25 04:47:30,741 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-25 04:47:30,741 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:47:30,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-25 04:47:30,742 INFO L142 LiptonReduction]: Number of co-enabled transitions 408 [2021-03-25 04:47:30,743 INFO L154 LiptonReduction]: Checked pairs total: 397 [2021-03-25 04:47:30,743 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:30,743 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5 [2021-03-25 04:47:30,744 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 81 flow [2021-03-25 04:47:30,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 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:47:30,744 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:30,744 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:30,744 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:47:30,744 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:30,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:30,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1632435728, now seen corresponding path program 1 times [2021-03-25 04:47:30,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:30,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53215517] [2021-03-25 04:47:30,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:30,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:30,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:30,819 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:47:30,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53215517] [2021-03-25 04:47:30,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:30,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:47:30,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085007543] [2021-03-25 04:47:30,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:47:30,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:30,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:47:30,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:47:30,821 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 201 [2021-03-25 04:47:30,821 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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:47:30,821 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:30,821 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 201 [2021-03-25 04:47:30,821 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:30,831 INFO L129 PetriNetUnfolder]: 3/39 cut-off events. [2021-03-25 04:47:30,831 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-25 04:47:30,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 39 events. 3/39 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 78 event pairs, 1 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 58. Up to 10 conditions per place. [2021-03-25 04:47:30,832 INFO L132 encePairwiseOnDemand]: 198/201 looper letters, 1 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2021-03-25 04:47:30,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 87 flow [2021-03-25 04:47:30,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:47:30,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:47:30,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 541 transitions. [2021-03-25 04:47:30,833 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8971807628524047 [2021-03-25 04:47:30,833 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 541 transitions. [2021-03-25 04:47:30,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 541 transitions. [2021-03-25 04:47:30,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:30,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 541 transitions. [2021-03-25 04:47:30,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 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:47:30,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 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:47:30,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 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:47:30,836 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 81 flow. Second operand 3 states and 541 transitions. [2021-03-25 04:47:30,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 87 flow [2021-03-25 04:47:30,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 84 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:47:30,837 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 86 flow [2021-03-25 04:47:30,837 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2021-03-25 04:47:30,838 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -16 predicate places. [2021-03-25 04:47:30,838 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:30,838 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 86 flow [2021-03-25 04:47:30,838 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 86 flow [2021-03-25 04:47:30,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 86 flow [2021-03-25 04:47:30,845 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-25 04:47:30,845 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 04:47:30,846 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 35 events. 3/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 77 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2021-03-25 04:47:30,846 INFO L142 LiptonReduction]: Number of co-enabled transitions 404 [2021-03-25 04:47:30,962 INFO L154 LiptonReduction]: Checked pairs total: 698 [2021-03-25 04:47:30,962 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:47:30,962 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 124 [2021-03-25 04:47:30,963 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 84 flow [2021-03-25 04:47:30,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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:47:30,963 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:30,963 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:30,963 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:47:30,963 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:30,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:30,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1932846463, now seen corresponding path program 1 times [2021-03-25 04:47:30,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:30,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462478809] [2021-03-25 04:47:30,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:31,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:31,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:31,013 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:47:31,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462478809] [2021-03-25 04:47:31,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:31,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 04:47:31,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219784906] [2021-03-25 04:47:31,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:47:31,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:31,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:47:31,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:47:31,015 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 202 [2021-03-25 04:47:31,015 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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:47:31,016 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:31,016 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 202 [2021-03-25 04:47:31,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:31,026 INFO L129 PetriNetUnfolder]: 10/59 cut-off events. [2021-03-25 04:47:31,026 INFO L130 PetriNetUnfolder]: For 24/33 co-relation queries the response was YES. [2021-03-25 04:47:31,026 INFO L84 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 59 events. 10/59 cut-off events. For 24/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 174 event pairs, 3 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 104. Up to 19 conditions per place. [2021-03-25 04:47:31,026 INFO L132 encePairwiseOnDemand]: 198/202 looper letters, 3 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-03-25 04:47:31,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 100 flow [2021-03-25 04:47:31,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:47:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:47:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2021-03-25 04:47:31,028 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8976897689768977 [2021-03-25 04:47:31,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 544 transitions. [2021-03-25 04:47:31,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 544 transitions. [2021-03-25 04:47:31,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:31,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 544 transitions. [2021-03-25 04:47:31,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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:47:31,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 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:47:31,030 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 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:47:31,030 INFO L185 Difference]: Start difference. First operand has 40 places, 28 transitions, 84 flow. Second operand 3 states and 544 transitions. [2021-03-25 04:47:31,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 100 flow [2021-03-25 04:47:31,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:47:31,031 INFO L241 Difference]: Finished difference. Result has 41 places, 30 transitions, 99 flow [2021-03-25 04:47:31,031 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2021-03-25 04:47:31,031 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -16 predicate places. [2021-03-25 04:47:31,031 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:31,032 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 30 transitions, 99 flow [2021-03-25 04:47:31,032 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 30 transitions, 99 flow [2021-03-25 04:47:31,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 30 transitions, 99 flow [2021-03-25 04:47:31,036 INFO L129 PetriNetUnfolder]: 7/46 cut-off events. [2021-03-25 04:47:31,036 INFO L130 PetriNetUnfolder]: For 21/23 co-relation queries the response was YES. [2021-03-25 04:47:31,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 46 events. 7/46 cut-off events. For 21/23 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 135 event pairs, 3 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 87. Up to 15 conditions per place. [2021-03-25 04:47:31,037 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-25 04:47:31,038 INFO L154 LiptonReduction]: Checked pairs total: 257 [2021-03-25 04:47:31,038 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:31,038 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-25 04:47:31,039 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 99 flow [2021-03-25 04:47:31,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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:47:31,039 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:31,039 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:31,039 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:47:31,039 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:31,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1669921867, now seen corresponding path program 1 times [2021-03-25 04:47:31,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:31,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375515367] [2021-03-25 04:47:31,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:31,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:31,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:31,130 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-03-25 04:47:31,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-25 04:47:31,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:31,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 04:47:31,152 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:47:31,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375515367] [2021-03-25 04:47:31,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:31,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:47:31,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688011653] [2021-03-25 04:47:31,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:47:31,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:31,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:47:31,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:47:31,153 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 202 [2021-03-25 04:47:31,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:47:31,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:31,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 202 [2021-03-25 04:47:31,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:31,234 INFO L129 PetriNetUnfolder]: 121/259 cut-off events. [2021-03-25 04:47:31,235 INFO L130 PetriNetUnfolder]: For 209/236 co-relation queries the response was YES. [2021-03-25 04:47:31,236 INFO L84 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 259 events. 121/259 cut-off events. For 209/236 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1256 event pairs, 60 based on Foata normal form. 7/233 useless extension candidates. Maximal degree in co-relation 592. Up to 156 conditions per place. [2021-03-25 04:47:31,237 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 8 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2021-03-25 04:47:31,238 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 142 flow [2021-03-25 04:47:31,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:47:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:47:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 667 transitions. [2021-03-25 04:47:31,240 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8254950495049505 [2021-03-25 04:47:31,240 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 667 transitions. [2021-03-25 04:47:31,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 667 transitions. [2021-03-25 04:47:31,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:31,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 667 transitions. [2021-03-25 04:47:31,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 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:47:31,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 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:47:31,244 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 202.0) internal successors, (1010), 5 states have internal predecessors, (1010), 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:47:31,244 INFO L185 Difference]: Start difference. First operand has 41 places, 30 transitions, 99 flow. Second operand 4 states and 667 transitions. [2021-03-25 04:47:31,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 142 flow [2021-03-25 04:47:31,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 139 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:47:31,246 INFO L241 Difference]: Finished difference. Result has 45 places, 35 transitions, 138 flow [2021-03-25 04:47:31,247 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2021-03-25 04:47:31,247 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -12 predicate places. [2021-03-25 04:47:31,247 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:31,247 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 138 flow [2021-03-25 04:47:31,247 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 138 flow [2021-03-25 04:47:31,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 138 flow [2021-03-25 04:47:31,276 INFO L129 PetriNetUnfolder]: 69/172 cut-off events. [2021-03-25 04:47:31,276 INFO L130 PetriNetUnfolder]: For 327/340 co-relation queries the response was YES. [2021-03-25 04:47:31,277 INFO L84 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 172 events. 69/172 cut-off events. For 327/340 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 833 event pairs, 34 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 481. Up to 87 conditions per place. [2021-03-25 04:47:31,283 INFO L142 LiptonReduction]: Number of co-enabled transitions 538 [2021-03-25 04:47:31,287 INFO L154 LiptonReduction]: Checked pairs total: 106 [2021-03-25 04:47:31,288 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:31,288 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41 [2021-03-25 04:47:31,296 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 138 flow [2021-03-25 04:47:31,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 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:47:31,297 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:31,297 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:31,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:47:31,297 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:31,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1656169957, now seen corresponding path program 2 times [2021-03-25 04:47:31,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:31,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458520074] [2021-03-25 04:47:31,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:31,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:31,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:47:31,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:31,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:31,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 04:47:31,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458520074] [2021-03-25 04:47:31,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:31,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:47:31,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548452120] [2021-03-25 04:47:31,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:47:31,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:31,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:47:31,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:47:31,335 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 202 [2021-03-25 04:47:31,336 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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:47:31,336 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:31,336 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 202 [2021-03-25 04:47:31,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:31,370 INFO L129 PetriNetUnfolder]: 77/235 cut-off events. [2021-03-25 04:47:31,370 INFO L130 PetriNetUnfolder]: For 605/841 co-relation queries the response was YES. [2021-03-25 04:47:31,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 235 events. 77/235 cut-off events. For 605/841 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1305 event pairs, 38 based on Foata normal form. 9/204 useless extension candidates. Maximal degree in co-relation 610. Up to 103 conditions per place. [2021-03-25 04:47:31,372 INFO L132 encePairwiseOnDemand]: 199/202 looper letters, 3 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2021-03-25 04:47:31,372 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 35 transitions, 150 flow [2021-03-25 04:47:31,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:47:31,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:47:31,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2021-03-25 04:47:31,373 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8960396039603961 [2021-03-25 04:47:31,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 543 transitions. [2021-03-25 04:47:31,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 543 transitions. [2021-03-25 04:47:31,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:31,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 543 transitions. [2021-03-25 04:47:31,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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:47:31,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 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:47:31,376 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 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:47:31,376 INFO L185 Difference]: Start difference. First operand has 45 places, 35 transitions, 138 flow. Second operand 3 states and 543 transitions. [2021-03-25 04:47:31,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 35 transitions, 150 flow [2021-03-25 04:47:31,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 35 transitions, 145 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:47:31,380 INFO L241 Difference]: Finished difference. Result has 47 places, 35 transitions, 144 flow [2021-03-25 04:47:31,380 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2021-03-25 04:47:31,380 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -10 predicate places. [2021-03-25 04:47:31,380 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:31,380 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 35 transitions, 144 flow [2021-03-25 04:47:31,380 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 35 transitions, 144 flow [2021-03-25 04:47:31,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 35 transitions, 144 flow [2021-03-25 04:47:31,407 INFO L129 PetriNetUnfolder]: 67/198 cut-off events. [2021-03-25 04:47:31,407 INFO L130 PetriNetUnfolder]: For 590/659 co-relation queries the response was YES. [2021-03-25 04:47:31,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 198 events. 67/198 cut-off events. For 590/659 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1024 event pairs, 19 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 561. Up to 90 conditions per place. [2021-03-25 04:47:31,409 INFO L142 LiptonReduction]: Number of co-enabled transitions 538 [2021-03-25 04:47:31,413 INFO L154 LiptonReduction]: Checked pairs total: 154 [2021-03-25 04:47:31,413 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:31,413 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-25 04:47:31,416 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 144 flow [2021-03-25 04:47:31,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 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:47:31,416 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:31,416 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:47:31,416 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:47:31,416 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:31,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:31,417 INFO L82 PathProgramCache]: Analyzing trace with hash -445257342, now seen corresponding path program 1 times [2021-03-25 04:47:31,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:31,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281471526] [2021-03-25 04:47:31,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:31,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:31,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:31,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:31,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:47:31,508 INFO L142 QuantifierPusher]: treesize reduction 5, result has 76.2 percent of original size [2021-03-25 04:47:31,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:47:31,520 INFO L142 QuantifierPusher]: treesize reduction 6, result has 80.6 percent of original size [2021-03-25 04:47:31,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:47:31,540 INFO L142 QuantifierPusher]: treesize reduction 6, result has 80.6 percent of original size [2021-03-25 04:47:31,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 04:47:31,562 INFO L142 QuantifierPusher]: treesize reduction 8, result has 80.0 percent of original size [2021-03-25 04:47:31,563 INFO L147 QuantifierPusher]: treesize reduction 9, result has 71.9 percent of original size 23 [2021-03-25 04:47:31,573 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:47:31,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281471526] [2021-03-25 04:47:31,573 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:31,573 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:47:31,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594458634] [2021-03-25 04:47:31,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 04:47:31,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:31,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 04:47:31,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-03-25 04:47:31,576 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 202 [2021-03-25 04:47:31,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 144 flow. Second operand has 8 states, 8 states have (on average 157.875) internal successors, (1263), 8 states have internal predecessors, (1263), 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:47:31,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:31,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 202 [2021-03-25 04:47:31,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:31,880 INFO L129 PetriNetUnfolder]: 411/994 cut-off events. [2021-03-25 04:47:31,880 INFO L130 PetriNetUnfolder]: For 2139/2285 co-relation queries the response was YES. [2021-03-25 04:47:31,883 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2726 conditions, 994 events. 411/994 cut-off events. For 2139/2285 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 7601 event pairs, 66 based on Foata normal form. 30/982 useless extension candidates. Maximal degree in co-relation 2709. Up to 345 conditions per place. [2021-03-25 04:47:31,887 INFO L132 encePairwiseOnDemand]: 195/202 looper letters, 25 selfloop transitions, 12 changer transitions 0/60 dead transitions. [2021-03-25 04:47:31,887 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 334 flow [2021-03-25 04:47:31,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:47:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:47:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1125 transitions. [2021-03-25 04:47:31,914 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7956152758132956 [2021-03-25 04:47:31,914 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1125 transitions. [2021-03-25 04:47:31,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1125 transitions. [2021-03-25 04:47:31,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:31,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1125 transitions. [2021-03-25 04:47:31,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.71428571428572) internal successors, (1125), 7 states have internal predecessors, (1125), 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:47:31,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 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:47:31,918 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 202.0) internal successors, (1616), 8 states have internal predecessors, (1616), 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:47:31,918 INFO L185 Difference]: Start difference. First operand has 47 places, 35 transitions, 144 flow. Second operand 7 states and 1125 transitions. [2021-03-25 04:47:31,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 334 flow [2021-03-25 04:47:31,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 329 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 04:47:31,921 INFO L241 Difference]: Finished difference. Result has 56 places, 45 transitions, 246 flow [2021-03-25 04:47:31,921 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2021-03-25 04:47:31,921 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2021-03-25 04:47:31,921 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:31,921 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 246 flow [2021-03-25 04:47:31,921 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 246 flow [2021-03-25 04:47:31,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 246 flow [2021-03-25 04:47:31,985 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L862-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~z$w_buff1_used~0_304 256) 0)) (.cse17 (= (mod v_~z$r_buff1_thd0~0_209 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd0~0_264 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse10 (not .cse9)) (.cse15 (and .cse9 .cse17)) (.cse19 (= (mod v_~z$w_buff0_used~0_414 256) 0)) (.cse16 (and .cse9 .cse18))) (let ((.cse1 (or .cse15 .cse19 .cse16)) (.cse4 (not .cse19)) (.cse3 (or (not .cse18) .cse10)) (.cse5 (or (not .cse17) .cse10)) (.cse6 (not .cse0))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~ite34_76| |v_ULTIMATE.start_main_#t~ite34_75|))) (or (and .cse0 (= v_~z$w_buff1~0_126 |v_ULTIMATE.start_main_#t~ite35_72|) (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite35_72|) .cse1 .cse2) (and (= |v_ULTIMATE.start_main_#t~ite34_76| |v_ULTIMATE.start_main_#t~ite35_72|) (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite34_76|) .cse3 .cse4 .cse5))) (and (= |v_ULTIMATE.start_main_#t~ite35_72| |v_ULTIMATE.start_main_#t~ite35_71|) (= v_~z$w_buff1~0_126 v_~z$w_buff1~0_127) .cse6 .cse2))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_32 (ite (= (ite (not (and (= v_~y~0_35 2) (= v_~x~0_35 2) (= v_~__unbuffered_p3_EAX~0_34 1) (= 0 v_~__unbuffered_p3_EBX~0_32) (= v_~z~0_151 2))) 1 0) 0) 0 1)) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~ite31_64| |v_ULTIMATE.start_main_#t~ite31_63|))) (or (and (= |v_ULTIMATE.start_main_#t~ite32_59| |v_ULTIMATE.start_main_#t~ite32_60|) .cse6 (= v_~z$w_buff0~0_134 v_~z$w_buff0~0_133) .cse7) (and (or (and (= |v_ULTIMATE.start_main_#t~ite31_64| |v_ULTIMATE.start_main_#t~ite32_60|) .cse3 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite31_64|) .cse4 .cse5) (and .cse1 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite32_60|) .cse7)) .cse0 (= v_~z$w_buff0~0_133 |v_ULTIMATE.start_main_#t~ite32_60|)))) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite37_90| |v_ULTIMATE.start_main_#t~ite37_89|))) (or (and (= v_~z$w_buff0_used~0_413 v_~z$w_buff0_used~0_414) .cse8 .cse6 (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite38_83|)) (and .cse0 (or (and (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite38_84|) .cse1 .cse8) (and (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite37_90|) .cse3 .cse4 .cse5 (or (and .cse9 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite37_90|)) (and (= |v_ULTIMATE.start_main_#t~ite37_90| 0) .cse10)))) (= v_~z$w_buff0_used~0_413 |v_ULTIMATE.start_main_#t~ite38_84|)))) (= |v_ULTIMATE.start_main_#t~nondet27_39| v_~weak$$choice0~0_19) (or (and (= v_~z~0_151 v_~z~0_150) (= |v_ULTIMATE.start_main_#t~ite29_59| |v_ULTIMATE.start_main_#t~ite29_60|) .cse1) (and .cse3 .cse4 (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite29_60|) .cse9) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite29_60|) .cse10)) (= v_~z~0_151 |v_ULTIMATE.start_main_#t~ite29_60|) .cse5)) (= v_~z$mem_tmp~0_36 v_~z~0_150) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite43_72| |v_ULTIMATE.start_main_#t~ite43_71|))) (or (and (= v_~z$r_buff0_thd0~0_264 v_~z$r_buff0_thd0~0_263) (= |v_ULTIMATE.start_main_#t~ite44_68| |v_ULTIMATE.start_main_#t~ite44_67|) .cse11 .cse6) (and (= v_~z$r_buff0_thd0~0_264 |v_ULTIMATE.start_main_#t~ite44_68|) .cse0 (= v_~z$r_buff0_thd0~0_263 |v_ULTIMATE.start_main_#t~ite44_68|) .cse11))) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (or (and .cse0 (= v_~z~0_149 v_~z~0_151)) (and (= v_~z$mem_tmp~0_36 v_~z~0_149) .cse6)) (= v_~z$flush_delayed~0_62 0) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_82| |v_ULTIMATE.start_main_#t~ite46_81|))) (or (and (= v_~z$r_buff1_thd0~0_209 |v_ULTIMATE.start_main_#t~ite47_74|) .cse12 .cse0 (= v_~z$r_buff1_thd0~0_208 |v_ULTIMATE.start_main_#t~ite47_74|)) (and (= |v_ULTIMATE.start_main_#t~ite47_74| |v_ULTIMATE.start_main_#t~ite47_73|) .cse12 (= v_~z$r_buff1_thd0~0_209 v_~z$r_buff1_thd0~0_208) .cse6))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite40_59| |v_ULTIMATE.start_main_#t~ite40_60|))) (or (and .cse0 (= v_~z$w_buff1_used~0_303 |v_ULTIMATE.start_main_#t~ite41_54|) (let ((.cse13 (= (mod v_~z$w_buff0_used~0_413 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite40_60| |v_ULTIMATE.start_main_#t~ite41_54|) (= |v_ULTIMATE.start_main_#t~ite40_60| 0) .cse3 .cse5 (not .cse13)) (and .cse14 (= v_~z$w_buff1_used~0_304 |v_ULTIMATE.start_main_#t~ite41_54|) (or .cse15 .cse16 .cse13))))) (and (= |v_ULTIMATE.start_main_#t~ite41_54| |v_ULTIMATE.start_main_#t~ite41_53|) (= v_~z$w_buff1_used~0_304 v_~z$w_buff1_used~0_303) .cse14 .cse6))) (= |v_ULTIMATE.start_main_#t~nondet28_45| v_~weak$$choice2~0_84))))) InVars {ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_59|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_81|, ~z$w_buff1~0=v_~z$w_buff1~0_127, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_71|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_67|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_264, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_209, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_39|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_45|, ~y~0=v_~y~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_414, ~z$w_buff0~0=v_~z$w_buff0~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_304, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_83|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_89|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_63|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_75|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_59|, ~z~0=v_~z~0_150, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_58|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_80|, ~z$w_buff1~0=v_~z$w_buff1~0_126, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_50|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_48|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_66|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_263, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_38|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_208, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_38|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_44|, ~y~0=v_~y~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_413, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|, ~z$w_buff0~0=v_~z$w_buff0~0_133, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_303, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_70|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_48|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~z$flush_delayed~0=v_~z$flush_delayed~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_88|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_62|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_58|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_44|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_74|, ~weak$$choice0~0=v_~weak$$choice0~0_19, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_52|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_58|, ~z~0=v_~z~0_149, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~x~0=v_~x~0_35} AuxVars[|v_ULTIMATE.start_main_#t~ite43_72|, |v_ULTIMATE.start_main_#t~ite44_68|, |v_ULTIMATE.start_main_#t~ite41_54|, |v_ULTIMATE.start_main_#t~ite29_60|, |v_ULTIMATE.start_main_#t~ite40_60|, |v_ULTIMATE.start_main_#t~ite46_82|, |v_ULTIMATE.start_main_#t~ite47_74|, |v_ULTIMATE.start_main_#t~ite32_60|, |v_ULTIMATE.start_main_#t~ite34_76|, |v_ULTIMATE.start_main_#t~ite38_84|, |v_ULTIMATE.start_main_#t~ite31_64|, v_~z~0_151, |v_ULTIMATE.start_main_#t~ite37_90|, |v_ULTIMATE.start_main_#t~ite35_72|] AssignedVars[ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet27, ULTIMATE.start_main_#t~nondet28, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][32], [P1Thread1of1ForFork1InUse, 32#L754true, P3Thread1of1ForFork3InUse, Black: 160#(= ~y~0 1), 166#(and (= ~b~0 1) (= ~z$r_buff0_thd0~0 0)), 104#L791true, Black: 137#(= ~y~0 0), 48#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 167#(and (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~b~0 ~z$r_buff0_thd4~0) (<= 1 ~z$w_buff0_used~0)), Black: 143#(= ~__unbuffered_p3_EAX~0 0), Black: 172#(and (= ~b~0 1) (= ~z$r_buff0_thd0~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(and (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~b~0 ~z$r_buff0_thd4~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd4~0 ~__unbuffered_p3_EBX~0)), 54#L817true, Black: 148#(= ~x~0 0), 118#P1ENTRYtrue, P2Thread1of1ForFork2InUse, Black: 153#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 154#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), P0Thread1of1ForFork0InUse]) [2021-03-25 04:47:31,985 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 04:47:31,985 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 04:47:31,985 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 04:47:31,985 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 04:47:32,005 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L862-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~z$w_buff1_used~0_304 256) 0)) (.cse17 (= (mod v_~z$r_buff1_thd0~0_209 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd0~0_264 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse10 (not .cse9)) (.cse15 (and .cse9 .cse17)) (.cse19 (= (mod v_~z$w_buff0_used~0_414 256) 0)) (.cse16 (and .cse9 .cse18))) (let ((.cse1 (or .cse15 .cse19 .cse16)) (.cse4 (not .cse19)) (.cse3 (or (not .cse18) .cse10)) (.cse5 (or (not .cse17) .cse10)) (.cse6 (not .cse0))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~ite34_76| |v_ULTIMATE.start_main_#t~ite34_75|))) (or (and .cse0 (= v_~z$w_buff1~0_126 |v_ULTIMATE.start_main_#t~ite35_72|) (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite35_72|) .cse1 .cse2) (and (= |v_ULTIMATE.start_main_#t~ite34_76| |v_ULTIMATE.start_main_#t~ite35_72|) (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite34_76|) .cse3 .cse4 .cse5))) (and (= |v_ULTIMATE.start_main_#t~ite35_72| |v_ULTIMATE.start_main_#t~ite35_71|) (= v_~z$w_buff1~0_126 v_~z$w_buff1~0_127) .cse6 .cse2))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_32 (ite (= (ite (not (and (= v_~y~0_35 2) (= v_~x~0_35 2) (= v_~__unbuffered_p3_EAX~0_34 1) (= 0 v_~__unbuffered_p3_EBX~0_32) (= v_~z~0_151 2))) 1 0) 0) 0 1)) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~ite31_64| |v_ULTIMATE.start_main_#t~ite31_63|))) (or (and (= |v_ULTIMATE.start_main_#t~ite32_59| |v_ULTIMATE.start_main_#t~ite32_60|) .cse6 (= v_~z$w_buff0~0_134 v_~z$w_buff0~0_133) .cse7) (and (or (and (= |v_ULTIMATE.start_main_#t~ite31_64| |v_ULTIMATE.start_main_#t~ite32_60|) .cse3 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite31_64|) .cse4 .cse5) (and .cse1 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite32_60|) .cse7)) .cse0 (= v_~z$w_buff0~0_133 |v_ULTIMATE.start_main_#t~ite32_60|)))) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite37_90| |v_ULTIMATE.start_main_#t~ite37_89|))) (or (and (= v_~z$w_buff0_used~0_413 v_~z$w_buff0_used~0_414) .cse8 .cse6 (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite38_83|)) (and .cse0 (or (and (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite38_84|) .cse1 .cse8) (and (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite37_90|) .cse3 .cse4 .cse5 (or (and .cse9 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite37_90|)) (and (= |v_ULTIMATE.start_main_#t~ite37_90| 0) .cse10)))) (= v_~z$w_buff0_used~0_413 |v_ULTIMATE.start_main_#t~ite38_84|)))) (= |v_ULTIMATE.start_main_#t~nondet27_39| v_~weak$$choice0~0_19) (or (and (= v_~z~0_151 v_~z~0_150) (= |v_ULTIMATE.start_main_#t~ite29_59| |v_ULTIMATE.start_main_#t~ite29_60|) .cse1) (and .cse3 .cse4 (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite29_60|) .cse9) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite29_60|) .cse10)) (= v_~z~0_151 |v_ULTIMATE.start_main_#t~ite29_60|) .cse5)) (= v_~z$mem_tmp~0_36 v_~z~0_150) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite43_72| |v_ULTIMATE.start_main_#t~ite43_71|))) (or (and (= v_~z$r_buff0_thd0~0_264 v_~z$r_buff0_thd0~0_263) (= |v_ULTIMATE.start_main_#t~ite44_68| |v_ULTIMATE.start_main_#t~ite44_67|) .cse11 .cse6) (and (= v_~z$r_buff0_thd0~0_264 |v_ULTIMATE.start_main_#t~ite44_68|) .cse0 (= v_~z$r_buff0_thd0~0_263 |v_ULTIMATE.start_main_#t~ite44_68|) .cse11))) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (or (and .cse0 (= v_~z~0_149 v_~z~0_151)) (and (= v_~z$mem_tmp~0_36 v_~z~0_149) .cse6)) (= v_~z$flush_delayed~0_62 0) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_82| |v_ULTIMATE.start_main_#t~ite46_81|))) (or (and (= v_~z$r_buff1_thd0~0_209 |v_ULTIMATE.start_main_#t~ite47_74|) .cse12 .cse0 (= v_~z$r_buff1_thd0~0_208 |v_ULTIMATE.start_main_#t~ite47_74|)) (and (= |v_ULTIMATE.start_main_#t~ite47_74| |v_ULTIMATE.start_main_#t~ite47_73|) .cse12 (= v_~z$r_buff1_thd0~0_209 v_~z$r_buff1_thd0~0_208) .cse6))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite40_59| |v_ULTIMATE.start_main_#t~ite40_60|))) (or (and .cse0 (= v_~z$w_buff1_used~0_303 |v_ULTIMATE.start_main_#t~ite41_54|) (let ((.cse13 (= (mod v_~z$w_buff0_used~0_413 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite40_60| |v_ULTIMATE.start_main_#t~ite41_54|) (= |v_ULTIMATE.start_main_#t~ite40_60| 0) .cse3 .cse5 (not .cse13)) (and .cse14 (= v_~z$w_buff1_used~0_304 |v_ULTIMATE.start_main_#t~ite41_54|) (or .cse15 .cse16 .cse13))))) (and (= |v_ULTIMATE.start_main_#t~ite41_54| |v_ULTIMATE.start_main_#t~ite41_53|) (= v_~z$w_buff1_used~0_304 v_~z$w_buff1_used~0_303) .cse14 .cse6))) (= |v_ULTIMATE.start_main_#t~nondet28_45| v_~weak$$choice2~0_84))))) InVars {ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_59|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_81|, ~z$w_buff1~0=v_~z$w_buff1~0_127, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_71|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_67|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_264, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_209, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_39|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_45|, ~y~0=v_~y~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_414, ~z$w_buff0~0=v_~z$w_buff0~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_304, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_83|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_89|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_63|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_75|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_59|, ~z~0=v_~z~0_150, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_58|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_80|, ~z$w_buff1~0=v_~z$w_buff1~0_126, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_50|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_48|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_66|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_263, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_38|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_208, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_38|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_44|, ~y~0=v_~y~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_413, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|, ~z$w_buff0~0=v_~z$w_buff0~0_133, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_303, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_70|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_48|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~z$flush_delayed~0=v_~z$flush_delayed~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_88|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_62|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_58|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_44|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_74|, ~weak$$choice0~0=v_~weak$$choice0~0_19, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_52|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_58|, ~z~0=v_~z~0_149, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~x~0=v_~x~0_35} AuxVars[|v_ULTIMATE.start_main_#t~ite43_72|, |v_ULTIMATE.start_main_#t~ite44_68|, |v_ULTIMATE.start_main_#t~ite41_54|, |v_ULTIMATE.start_main_#t~ite29_60|, |v_ULTIMATE.start_main_#t~ite40_60|, |v_ULTIMATE.start_main_#t~ite46_82|, |v_ULTIMATE.start_main_#t~ite47_74|, |v_ULTIMATE.start_main_#t~ite32_60|, |v_ULTIMATE.start_main_#t~ite34_76|, |v_ULTIMATE.start_main_#t~ite38_84|, |v_ULTIMATE.start_main_#t~ite31_64|, v_~z~0_151, |v_ULTIMATE.start_main_#t~ite37_90|, |v_ULTIMATE.start_main_#t~ite35_72|] AssignedVars[ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet27, ULTIMATE.start_main_#t~nondet28, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][32], [32#L754true, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork3InUse, Black: 160#(= ~y~0 1), 166#(and (= ~b~0 1) (= ~z$r_buff0_thd0~0 0)), 104#L791true, Black: 137#(= ~y~0 0), 48#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 167#(and (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~b~0 ~z$r_buff0_thd4~0) (<= 1 ~z$w_buff0_used~0)), Black: 143#(= ~__unbuffered_p3_EAX~0 0), Black: 172#(and (= ~b~0 1) (= ~z$r_buff0_thd0~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(and (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~b~0 ~z$r_buff0_thd4~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd4~0 ~__unbuffered_p3_EBX~0)), Black: 148#(= ~x~0 0), 54#L817true, 90#L766true, P2Thread1of1ForFork2InUse, Black: 153#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 154#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), P0Thread1of1ForFork0InUse]) [2021-03-25 04:47:32,006 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is not cut-off event [2021-03-25 04:47:32,006 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 04:47:32,006 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 04:47:32,006 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 04:47:32,032 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L862-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~z$w_buff1_used~0_304 256) 0)) (.cse17 (= (mod v_~z$r_buff1_thd0~0_209 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd0~0_264 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse10 (not .cse9)) (.cse15 (and .cse9 .cse17)) (.cse19 (= (mod v_~z$w_buff0_used~0_414 256) 0)) (.cse16 (and .cse9 .cse18))) (let ((.cse1 (or .cse15 .cse19 .cse16)) (.cse4 (not .cse19)) (.cse3 (or (not .cse18) .cse10)) (.cse5 (or (not .cse17) .cse10)) (.cse6 (not .cse0))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~ite34_76| |v_ULTIMATE.start_main_#t~ite34_75|))) (or (and .cse0 (= v_~z$w_buff1~0_126 |v_ULTIMATE.start_main_#t~ite35_72|) (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite35_72|) .cse1 .cse2) (and (= |v_ULTIMATE.start_main_#t~ite34_76| |v_ULTIMATE.start_main_#t~ite35_72|) (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite34_76|) .cse3 .cse4 .cse5))) (and (= |v_ULTIMATE.start_main_#t~ite35_72| |v_ULTIMATE.start_main_#t~ite35_71|) (= v_~z$w_buff1~0_126 v_~z$w_buff1~0_127) .cse6 .cse2))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_32 (ite (= (ite (not (and (= v_~y~0_35 2) (= v_~x~0_35 2) (= v_~__unbuffered_p3_EAX~0_34 1) (= 0 v_~__unbuffered_p3_EBX~0_32) (= v_~z~0_151 2))) 1 0) 0) 0 1)) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~ite31_64| |v_ULTIMATE.start_main_#t~ite31_63|))) (or (and (= |v_ULTIMATE.start_main_#t~ite32_59| |v_ULTIMATE.start_main_#t~ite32_60|) .cse6 (= v_~z$w_buff0~0_134 v_~z$w_buff0~0_133) .cse7) (and (or (and (= |v_ULTIMATE.start_main_#t~ite31_64| |v_ULTIMATE.start_main_#t~ite32_60|) .cse3 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite31_64|) .cse4 .cse5) (and .cse1 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite32_60|) .cse7)) .cse0 (= v_~z$w_buff0~0_133 |v_ULTIMATE.start_main_#t~ite32_60|)))) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite37_90| |v_ULTIMATE.start_main_#t~ite37_89|))) (or (and (= v_~z$w_buff0_used~0_413 v_~z$w_buff0_used~0_414) .cse8 .cse6 (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite38_83|)) (and .cse0 (or (and (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite38_84|) .cse1 .cse8) (and (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite37_90|) .cse3 .cse4 .cse5 (or (and .cse9 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite37_90|)) (and (= |v_ULTIMATE.start_main_#t~ite37_90| 0) .cse10)))) (= v_~z$w_buff0_used~0_413 |v_ULTIMATE.start_main_#t~ite38_84|)))) (= |v_ULTIMATE.start_main_#t~nondet27_39| v_~weak$$choice0~0_19) (or (and (= v_~z~0_151 v_~z~0_150) (= |v_ULTIMATE.start_main_#t~ite29_59| |v_ULTIMATE.start_main_#t~ite29_60|) .cse1) (and .cse3 .cse4 (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite29_60|) .cse9) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite29_60|) .cse10)) (= v_~z~0_151 |v_ULTIMATE.start_main_#t~ite29_60|) .cse5)) (= v_~z$mem_tmp~0_36 v_~z~0_150) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite43_72| |v_ULTIMATE.start_main_#t~ite43_71|))) (or (and (= v_~z$r_buff0_thd0~0_264 v_~z$r_buff0_thd0~0_263) (= |v_ULTIMATE.start_main_#t~ite44_68| |v_ULTIMATE.start_main_#t~ite44_67|) .cse11 .cse6) (and (= v_~z$r_buff0_thd0~0_264 |v_ULTIMATE.start_main_#t~ite44_68|) .cse0 (= v_~z$r_buff0_thd0~0_263 |v_ULTIMATE.start_main_#t~ite44_68|) .cse11))) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (or (and .cse0 (= v_~z~0_149 v_~z~0_151)) (and (= v_~z$mem_tmp~0_36 v_~z~0_149) .cse6)) (= v_~z$flush_delayed~0_62 0) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_82| |v_ULTIMATE.start_main_#t~ite46_81|))) (or (and (= v_~z$r_buff1_thd0~0_209 |v_ULTIMATE.start_main_#t~ite47_74|) .cse12 .cse0 (= v_~z$r_buff1_thd0~0_208 |v_ULTIMATE.start_main_#t~ite47_74|)) (and (= |v_ULTIMATE.start_main_#t~ite47_74| |v_ULTIMATE.start_main_#t~ite47_73|) .cse12 (= v_~z$r_buff1_thd0~0_209 v_~z$r_buff1_thd0~0_208) .cse6))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite40_59| |v_ULTIMATE.start_main_#t~ite40_60|))) (or (and .cse0 (= v_~z$w_buff1_used~0_303 |v_ULTIMATE.start_main_#t~ite41_54|) (let ((.cse13 (= (mod v_~z$w_buff0_used~0_413 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite40_60| |v_ULTIMATE.start_main_#t~ite41_54|) (= |v_ULTIMATE.start_main_#t~ite40_60| 0) .cse3 .cse5 (not .cse13)) (and .cse14 (= v_~z$w_buff1_used~0_304 |v_ULTIMATE.start_main_#t~ite41_54|) (or .cse15 .cse16 .cse13))))) (and (= |v_ULTIMATE.start_main_#t~ite41_54| |v_ULTIMATE.start_main_#t~ite41_53|) (= v_~z$w_buff1_used~0_304 v_~z$w_buff1_used~0_303) .cse14 .cse6))) (= |v_ULTIMATE.start_main_#t~nondet28_45| v_~weak$$choice2~0_84))))) InVars {ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_59|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_81|, ~z$w_buff1~0=v_~z$w_buff1~0_127, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_71|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_67|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_264, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_209, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_39|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_45|, ~y~0=v_~y~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_414, ~z$w_buff0~0=v_~z$w_buff0~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_304, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_83|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_89|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_63|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_75|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_59|, ~z~0=v_~z~0_150, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_58|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_80|, ~z$w_buff1~0=v_~z$w_buff1~0_126, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_50|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_48|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_66|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_263, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_38|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_208, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_38|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_44|, ~y~0=v_~y~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_413, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|, ~z$w_buff0~0=v_~z$w_buff0~0_133, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_303, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_70|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_48|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~z$flush_delayed~0=v_~z$flush_delayed~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_88|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_62|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_58|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_44|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_74|, ~weak$$choice0~0=v_~weak$$choice0~0_19, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_52|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_58|, ~z~0=v_~z~0_149, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~x~0=v_~x~0_35} AuxVars[|v_ULTIMATE.start_main_#t~ite43_72|, |v_ULTIMATE.start_main_#t~ite44_68|, |v_ULTIMATE.start_main_#t~ite41_54|, |v_ULTIMATE.start_main_#t~ite29_60|, |v_ULTIMATE.start_main_#t~ite40_60|, |v_ULTIMATE.start_main_#t~ite46_82|, |v_ULTIMATE.start_main_#t~ite47_74|, |v_ULTIMATE.start_main_#t~ite32_60|, |v_ULTIMATE.start_main_#t~ite34_76|, |v_ULTIMATE.start_main_#t~ite38_84|, |v_ULTIMATE.start_main_#t~ite31_64|, v_~z~0_151, |v_ULTIMATE.start_main_#t~ite37_90|, |v_ULTIMATE.start_main_#t~ite35_72|] AssignedVars[ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet27, ULTIMATE.start_main_#t~nondet28, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][32], [P1Thread1of1ForFork1InUse, 32#L754true, 98#L769true, P3Thread1of1ForFork3InUse, Black: 160#(= ~y~0 1), 166#(and (= ~b~0 1) (= ~z$r_buff0_thd0~0 0)), 104#L791true, Black: 137#(= ~y~0 0), 48#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 167#(and (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~b~0 ~z$r_buff0_thd4~0) (<= 1 ~z$w_buff0_used~0)), Black: 143#(= ~__unbuffered_p3_EAX~0 0), Black: 172#(and (= ~b~0 1) (= ~z$r_buff0_thd0~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(and (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~b~0 ~z$r_buff0_thd4~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd4~0 ~__unbuffered_p3_EBX~0)), Black: 148#(= ~x~0 0), 54#L817true, P2Thread1of1ForFork2InUse, Black: 153#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 154#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), P0Thread1of1ForFork0InUse]) [2021-03-25 04:47:32,032 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2021-03-25 04:47:32,032 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-25 04:47:32,032 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-25 04:47:32,032 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is not cut-off event [2021-03-25 04:47:32,040 INFO L129 PetriNetUnfolder]: 176/528 cut-off events. [2021-03-25 04:47:32,040 INFO L130 PetriNetUnfolder]: For 2405/2667 co-relation queries the response was YES. [2021-03-25 04:47:32,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1800 conditions, 528 events. 176/528 cut-off events. For 2405/2667 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 3758 event pairs, 38 based on Foata normal form. 5/458 useless extension candidates. Maximal degree in co-relation 1780. Up to 219 conditions per place. [2021-03-25 04:47:32,047 INFO L142 LiptonReduction]: Number of co-enabled transitions 760 [2021-03-25 04:47:32,228 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:47:32,570 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 04:47:32,685 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 04:47:32,829 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:47:33,192 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 04:47:33,325 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:47:33,368 INFO L154 LiptonReduction]: Checked pairs total: 346 [2021-03-25 04:47:33,368 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:47:33,368 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1447 [2021-03-25 04:47:33,368 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 250 flow [2021-03-25 04:47:33,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 157.875) internal successors, (1263), 8 states have internal predecessors, (1263), 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:47:33,369 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:33,369 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:33,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:47:33,369 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:33,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:33,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1109641430, now seen corresponding path program 1 times [2021-03-25 04:47:33,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:33,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446022436] [2021-03-25 04:47:33,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:33,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:33,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:47:33,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:33,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:33,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:33,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:33,415 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:47:33,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446022436] [2021-03-25 04:47:33,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:33,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:47:33,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364737973] [2021-03-25 04:47:33,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:47:33,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:33,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:47:33,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:47:33,417 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 204 [2021-03-25 04:47:33,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 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:47:33,417 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:33,417 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 204 [2021-03-25 04:47:33,417 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:33,524 INFO L129 PetriNetUnfolder]: 229/628 cut-off events. [2021-03-25 04:47:33,524 INFO L130 PetriNetUnfolder]: For 2207/2335 co-relation queries the response was YES. [2021-03-25 04:47:33,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2192 conditions, 628 events. 229/628 cut-off events. For 2207/2335 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4544 event pairs, 75 based on Foata normal form. 35/622 useless extension candidates. Maximal degree in co-relation 2170. Up to 317 conditions per place. [2021-03-25 04:47:33,529 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 17 selfloop transitions, 12 changer transitions 0/54 dead transitions. [2021-03-25 04:47:33,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 54 transitions, 368 flow [2021-03-25 04:47:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:47:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:47:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 662 transitions. [2021-03-25 04:47:33,530 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8112745098039216 [2021-03-25 04:47:33,530 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 662 transitions. [2021-03-25 04:47:33,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 662 transitions. [2021-03-25 04:47:33,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:33,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 662 transitions. [2021-03-25 04:47:33,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 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:47:33,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 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:47:33,533 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 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:47:33,533 INFO L185 Difference]: Start difference. First operand has 56 places, 45 transitions, 250 flow. Second operand 4 states and 662 transitions. [2021-03-25 04:47:33,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 54 transitions, 368 flow [2021-03-25 04:47:33,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 367 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:47:33,538 INFO L241 Difference]: Finished difference. Result has 60 places, 53 transitions, 361 flow [2021-03-25 04:47:33,538 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=361, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2021-03-25 04:47:33,538 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2021-03-25 04:47:33,538 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:33,539 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 53 transitions, 361 flow [2021-03-25 04:47:33,539 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 53 transitions, 361 flow [2021-03-25 04:47:33,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 53 transitions, 361 flow [2021-03-25 04:47:33,613 INFO L129 PetriNetUnfolder]: 166/479 cut-off events. [2021-03-25 04:47:33,614 INFO L130 PetriNetUnfolder]: For 2319/2505 co-relation queries the response was YES. [2021-03-25 04:47:33,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1758 conditions, 479 events. 166/479 cut-off events. For 2319/2505 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3293 event pairs, 56 based on Foata normal form. 12/420 useless extension candidates. Maximal degree in co-relation 1735. Up to 197 conditions per place. [2021-03-25 04:47:33,619 INFO L142 LiptonReduction]: Number of co-enabled transitions 880 [2021-03-25 04:47:33,627 INFO L154 LiptonReduction]: Checked pairs total: 289 [2021-03-25 04:47:33,627 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:33,627 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 89 [2021-03-25 04:47:33,628 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 361 flow [2021-03-25 04:47:33,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 161.8) internal successors, (809), 5 states have internal predecessors, (809), 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:47:33,629 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:33,629 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:33,629 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:47:33,629 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:33,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:33,629 INFO L82 PathProgramCache]: Analyzing trace with hash -746936788, now seen corresponding path program 1 times [2021-03-25 04:47:33,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:33,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004352550] [2021-03-25 04:47:33,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:33,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:33,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:33,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:33,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:47:33,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:33,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 04:47:33,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:33,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 04:47:33,722 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:47:33,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004352550] [2021-03-25 04:47:33,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:33,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:47:33,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22426019] [2021-03-25 04:47:33,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:47:33,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:33,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:47:33,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:47:33,727 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 204 [2021-03-25 04:47:33,727 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 361 flow. Second operand has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 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:47:33,727 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:33,727 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 204 [2021-03-25 04:47:33,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:33,837 INFO L129 PetriNetUnfolder]: 240/643 cut-off events. [2021-03-25 04:47:33,838 INFO L130 PetriNetUnfolder]: For 3381/3573 co-relation queries the response was YES. [2021-03-25 04:47:33,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2542 conditions, 643 events. 240/643 cut-off events. For 3381/3573 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4573 event pairs, 28 based on Foata normal form. 51/652 useless extension candidates. Maximal degree in co-relation 2517. Up to 312 conditions per place. [2021-03-25 04:47:33,843 INFO L132 encePairwiseOnDemand]: 196/204 looper letters, 21 selfloop transitions, 18 changer transitions 0/64 dead transitions. [2021-03-25 04:47:33,843 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 523 flow [2021-03-25 04:47:33,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:47:33,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:47:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2021-03-25 04:47:33,845 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8176470588235294 [2021-03-25 04:47:33,845 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 834 transitions. [2021-03-25 04:47:33,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 834 transitions. [2021-03-25 04:47:33,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:33,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 834 transitions. [2021-03-25 04:47:33,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.8) internal successors, (834), 5 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:33,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:47:33,849 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:47:33,849 INFO L185 Difference]: Start difference. First operand has 60 places, 53 transitions, 361 flow. Second operand 5 states and 834 transitions. [2021-03-25 04:47:33,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 523 flow [2021-03-25 04:47:33,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 64 transitions, 523 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:47:33,853 INFO L241 Difference]: Finished difference. Result has 65 places, 62 transitions, 495 flow [2021-03-25 04:47:33,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=495, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2021-03-25 04:47:33,853 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2021-03-25 04:47:33,853 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:33,853 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 62 transitions, 495 flow [2021-03-25 04:47:33,853 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 62 transitions, 495 flow [2021-03-25 04:47:33,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 62 transitions, 495 flow [2021-03-25 04:47:33,898 INFO L129 PetriNetUnfolder]: 176/494 cut-off events. [2021-03-25 04:47:33,898 INFO L130 PetriNetUnfolder]: For 3361/3558 co-relation queries the response was YES. [2021-03-25 04:47:33,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 494 events. 176/494 cut-off events. For 3361/3558 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3306 event pairs, 42 based on Foata normal form. 28/477 useless extension candidates. Maximal degree in co-relation 1996. Up to 185 conditions per place. [2021-03-25 04:47:33,905 INFO L142 LiptonReduction]: Number of co-enabled transitions 1032 [2021-03-25 04:47:33,916 INFO L154 LiptonReduction]: Checked pairs total: 355 [2021-03-25 04:47:33,916 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:33,916 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 63 [2021-03-25 04:47:33,916 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 495 flow [2021-03-25 04:47:33,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 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:47:33,917 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:33,917 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:33,917 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:47:33,917 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:33,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:33,917 INFO L82 PathProgramCache]: Analyzing trace with hash -745697098, now seen corresponding path program 2 times [2021-03-25 04:47:33,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:33,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942630071] [2021-03-25 04:47:33,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:33,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:33,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:47:33,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:33,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:33,980 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 04:47:33,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 04:47:33,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:33,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:34,004 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:47:34,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942630071] [2021-03-25 04:47:34,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:34,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:47:34,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745210865] [2021-03-25 04:47:34,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:47:34,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:34,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:47:34,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:47:34,006 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 204 [2021-03-25 04:47:34,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 495 flow. Second operand has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 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:47:34,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:34,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 204 [2021-03-25 04:47:34,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:34,127 INFO L129 PetriNetUnfolder]: 268/687 cut-off events. [2021-03-25 04:47:34,128 INFO L130 PetriNetUnfolder]: For 4557/4797 co-relation queries the response was YES. [2021-03-25 04:47:34,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3147 conditions, 687 events. 268/687 cut-off events. For 4557/4797 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4806 event pairs, 32 based on Foata normal form. 61/697 useless extension candidates. Maximal degree in co-relation 3119. Up to 347 conditions per place. [2021-03-25 04:47:34,135 INFO L132 encePairwiseOnDemand]: 196/204 looper letters, 27 selfloop transitions, 25 changer transitions 0/77 dead transitions. [2021-03-25 04:47:34,135 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 77 transitions, 760 flow [2021-03-25 04:47:34,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:47:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:47:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 825 transitions. [2021-03-25 04:47:34,137 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8088235294117647 [2021-03-25 04:47:34,137 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 825 transitions. [2021-03-25 04:47:34,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 825 transitions. [2021-03-25 04:47:34,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:34,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 825 transitions. [2021-03-25 04:47:34,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 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:47:34,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:47:34,140 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:47:34,140 INFO L185 Difference]: Start difference. First operand has 65 places, 62 transitions, 495 flow. Second operand 5 states and 825 transitions. [2021-03-25 04:47:34,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 77 transitions, 760 flow [2021-03-25 04:47:34,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 77 transitions, 710 flow, removed 25 selfloop flow, removed 0 redundant places. [2021-03-25 04:47:34,146 INFO L241 Difference]: Finished difference. Result has 71 places, 76 transitions, 694 flow [2021-03-25 04:47:34,147 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=694, PETRI_PLACES=71, PETRI_TRANSITIONS=76} [2021-03-25 04:47:34,147 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2021-03-25 04:47:34,147 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:34,147 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 76 transitions, 694 flow [2021-03-25 04:47:34,147 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 76 transitions, 694 flow [2021-03-25 04:47:34,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 76 transitions, 694 flow [2021-03-25 04:47:34,178 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L862-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~z$w_buff1_used~0_304 256) 0)) (.cse17 (= (mod v_~z$r_buff1_thd0~0_209 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd0~0_264 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse10 (not .cse9)) (.cse15 (and .cse9 .cse17)) (.cse19 (= (mod v_~z$w_buff0_used~0_414 256) 0)) (.cse16 (and .cse9 .cse18))) (let ((.cse1 (or .cse15 .cse19 .cse16)) (.cse4 (not .cse19)) (.cse3 (or (not .cse18) .cse10)) (.cse5 (or (not .cse17) .cse10)) (.cse6 (not .cse0))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~ite34_76| |v_ULTIMATE.start_main_#t~ite34_75|))) (or (and .cse0 (= v_~z$w_buff1~0_126 |v_ULTIMATE.start_main_#t~ite35_72|) (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite35_72|) .cse1 .cse2) (and (= |v_ULTIMATE.start_main_#t~ite34_76| |v_ULTIMATE.start_main_#t~ite35_72|) (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite34_76|) .cse3 .cse4 .cse5))) (and (= |v_ULTIMATE.start_main_#t~ite35_72| |v_ULTIMATE.start_main_#t~ite35_71|) (= v_~z$w_buff1~0_126 v_~z$w_buff1~0_127) .cse6 .cse2))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_32 (ite (= (ite (not (and (= v_~y~0_35 2) (= v_~x~0_35 2) (= v_~__unbuffered_p3_EAX~0_34 1) (= 0 v_~__unbuffered_p3_EBX~0_32) (= v_~z~0_151 2))) 1 0) 0) 0 1)) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~ite31_64| |v_ULTIMATE.start_main_#t~ite31_63|))) (or (and (= |v_ULTIMATE.start_main_#t~ite32_59| |v_ULTIMATE.start_main_#t~ite32_60|) .cse6 (= v_~z$w_buff0~0_134 v_~z$w_buff0~0_133) .cse7) (and (or (and (= |v_ULTIMATE.start_main_#t~ite31_64| |v_ULTIMATE.start_main_#t~ite32_60|) .cse3 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite31_64|) .cse4 .cse5) (and .cse1 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite32_60|) .cse7)) .cse0 (= v_~z$w_buff0~0_133 |v_ULTIMATE.start_main_#t~ite32_60|)))) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite37_90| |v_ULTIMATE.start_main_#t~ite37_89|))) (or (and (= v_~z$w_buff0_used~0_413 v_~z$w_buff0_used~0_414) .cse8 .cse6 (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite38_83|)) (and .cse0 (or (and (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite38_84|) .cse1 .cse8) (and (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite37_90|) .cse3 .cse4 .cse5 (or (and .cse9 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite37_90|)) (and (= |v_ULTIMATE.start_main_#t~ite37_90| 0) .cse10)))) (= v_~z$w_buff0_used~0_413 |v_ULTIMATE.start_main_#t~ite38_84|)))) (= |v_ULTIMATE.start_main_#t~nondet27_39| v_~weak$$choice0~0_19) (or (and (= v_~z~0_151 v_~z~0_150) (= |v_ULTIMATE.start_main_#t~ite29_59| |v_ULTIMATE.start_main_#t~ite29_60|) .cse1) (and .cse3 .cse4 (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite29_60|) .cse9) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite29_60|) .cse10)) (= v_~z~0_151 |v_ULTIMATE.start_main_#t~ite29_60|) .cse5)) (= v_~z$mem_tmp~0_36 v_~z~0_150) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite43_72| |v_ULTIMATE.start_main_#t~ite43_71|))) (or (and (= v_~z$r_buff0_thd0~0_264 v_~z$r_buff0_thd0~0_263) (= |v_ULTIMATE.start_main_#t~ite44_68| |v_ULTIMATE.start_main_#t~ite44_67|) .cse11 .cse6) (and (= v_~z$r_buff0_thd0~0_264 |v_ULTIMATE.start_main_#t~ite44_68|) .cse0 (= v_~z$r_buff0_thd0~0_263 |v_ULTIMATE.start_main_#t~ite44_68|) .cse11))) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (or (and .cse0 (= v_~z~0_149 v_~z~0_151)) (and (= v_~z$mem_tmp~0_36 v_~z~0_149) .cse6)) (= v_~z$flush_delayed~0_62 0) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_82| |v_ULTIMATE.start_main_#t~ite46_81|))) (or (and (= v_~z$r_buff1_thd0~0_209 |v_ULTIMATE.start_main_#t~ite47_74|) .cse12 .cse0 (= v_~z$r_buff1_thd0~0_208 |v_ULTIMATE.start_main_#t~ite47_74|)) (and (= |v_ULTIMATE.start_main_#t~ite47_74| |v_ULTIMATE.start_main_#t~ite47_73|) .cse12 (= v_~z$r_buff1_thd0~0_209 v_~z$r_buff1_thd0~0_208) .cse6))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite40_59| |v_ULTIMATE.start_main_#t~ite40_60|))) (or (and .cse0 (= v_~z$w_buff1_used~0_303 |v_ULTIMATE.start_main_#t~ite41_54|) (let ((.cse13 (= (mod v_~z$w_buff0_used~0_413 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite40_60| |v_ULTIMATE.start_main_#t~ite41_54|) (= |v_ULTIMATE.start_main_#t~ite40_60| 0) .cse3 .cse5 (not .cse13)) (and .cse14 (= v_~z$w_buff1_used~0_304 |v_ULTIMATE.start_main_#t~ite41_54|) (or .cse15 .cse16 .cse13))))) (and (= |v_ULTIMATE.start_main_#t~ite41_54| |v_ULTIMATE.start_main_#t~ite41_53|) (= v_~z$w_buff1_used~0_304 v_~z$w_buff1_used~0_303) .cse14 .cse6))) (= |v_ULTIMATE.start_main_#t~nondet28_45| v_~weak$$choice2~0_84))))) InVars {ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_59|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_81|, ~z$w_buff1~0=v_~z$w_buff1~0_127, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_71|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_67|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_264, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_209, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_39|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_45|, ~y~0=v_~y~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_414, ~z$w_buff0~0=v_~z$w_buff0~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_304, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_83|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_89|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_63|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_75|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_59|, ~z~0=v_~z~0_150, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_58|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_80|, ~z$w_buff1~0=v_~z$w_buff1~0_126, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_50|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_48|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_66|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_263, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_38|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_208, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_38|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_44|, ~y~0=v_~y~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_413, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|, ~z$w_buff0~0=v_~z$w_buff0~0_133, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_303, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_70|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_48|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~z$flush_delayed~0=v_~z$flush_delayed~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_88|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_62|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_58|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_44|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_74|, ~weak$$choice0~0=v_~weak$$choice0~0_19, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_52|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_58|, ~z~0=v_~z~0_149, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~x~0=v_~x~0_35} AuxVars[|v_ULTIMATE.start_main_#t~ite43_72|, |v_ULTIMATE.start_main_#t~ite44_68|, |v_ULTIMATE.start_main_#t~ite41_54|, |v_ULTIMATE.start_main_#t~ite29_60|, |v_ULTIMATE.start_main_#t~ite40_60|, |v_ULTIMATE.start_main_#t~ite46_82|, |v_ULTIMATE.start_main_#t~ite47_74|, |v_ULTIMATE.start_main_#t~ite32_60|, |v_ULTIMATE.start_main_#t~ite34_76|, |v_ULTIMATE.start_main_#t~ite38_84|, |v_ULTIMATE.start_main_#t~ite31_64|, v_~z~0_151, |v_ULTIMATE.start_main_#t~ite37_90|, |v_ULTIMATE.start_main_#t~ite35_72|] AssignedVars[ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet27, ULTIMATE.start_main_#t~nondet28, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][48], [P1Thread1of1ForFork1InUse, P3Thread1of1ForFork3InUse, Black: 195#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), 198#true, Black: 137#(= ~y~0 0), Black: 201#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$w_buff0_used~0 0)), Black: 202#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 143#(= ~__unbuffered_p3_EAX~0 0), Black: 148#(= ~x~0 0), 90#L766true, Black: 153#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 154#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), 32#L754true, Black: 160#(= ~y~0 1), 166#(and (= ~b~0 1) (= ~z$r_buff0_thd0~0 0)), 104#L791true, 48#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 167#(and (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~b~0 ~z$r_buff0_thd4~0) (<= 1 ~z$w_buff0_used~0)), Black: 172#(and (= ~b~0 1) (= ~z$r_buff0_thd0~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(and (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~b~0 ~z$r_buff0_thd4~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd4~0 ~__unbuffered_p3_EBX~0)), 180#true, 54#L817true, Black: 184#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P2Thread1of1ForFork2InUse, Black: 186#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), P0Thread1of1ForFork0InUse, 190#true]) [2021-03-25 04:47:34,178 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 04:47:34,178 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 04:47:34,178 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 04:47:34,178 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 04:47:34,187 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L862-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~z$w_buff1_used~0_304 256) 0)) (.cse17 (= (mod v_~z$r_buff1_thd0~0_209 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd0~0_264 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse10 (not .cse9)) (.cse15 (and .cse9 .cse17)) (.cse19 (= (mod v_~z$w_buff0_used~0_414 256) 0)) (.cse16 (and .cse9 .cse18))) (let ((.cse1 (or .cse15 .cse19 .cse16)) (.cse4 (not .cse19)) (.cse3 (or (not .cse18) .cse10)) (.cse5 (or (not .cse17) .cse10)) (.cse6 (not .cse0))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~ite34_76| |v_ULTIMATE.start_main_#t~ite34_75|))) (or (and .cse0 (= v_~z$w_buff1~0_126 |v_ULTIMATE.start_main_#t~ite35_72|) (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite35_72|) .cse1 .cse2) (and (= |v_ULTIMATE.start_main_#t~ite34_76| |v_ULTIMATE.start_main_#t~ite35_72|) (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite34_76|) .cse3 .cse4 .cse5))) (and (= |v_ULTIMATE.start_main_#t~ite35_72| |v_ULTIMATE.start_main_#t~ite35_71|) (= v_~z$w_buff1~0_126 v_~z$w_buff1~0_127) .cse6 .cse2))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_32 (ite (= (ite (not (and (= v_~y~0_35 2) (= v_~x~0_35 2) (= v_~__unbuffered_p3_EAX~0_34 1) (= 0 v_~__unbuffered_p3_EBX~0_32) (= v_~z~0_151 2))) 1 0) 0) 0 1)) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~ite31_64| |v_ULTIMATE.start_main_#t~ite31_63|))) (or (and (= |v_ULTIMATE.start_main_#t~ite32_59| |v_ULTIMATE.start_main_#t~ite32_60|) .cse6 (= v_~z$w_buff0~0_134 v_~z$w_buff0~0_133) .cse7) (and (or (and (= |v_ULTIMATE.start_main_#t~ite31_64| |v_ULTIMATE.start_main_#t~ite32_60|) .cse3 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite31_64|) .cse4 .cse5) (and .cse1 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite32_60|) .cse7)) .cse0 (= v_~z$w_buff0~0_133 |v_ULTIMATE.start_main_#t~ite32_60|)))) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite37_90| |v_ULTIMATE.start_main_#t~ite37_89|))) (or (and (= v_~z$w_buff0_used~0_413 v_~z$w_buff0_used~0_414) .cse8 .cse6 (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite38_83|)) (and .cse0 (or (and (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite38_84|) .cse1 .cse8) (and (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite37_90|) .cse3 .cse4 .cse5 (or (and .cse9 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite37_90|)) (and (= |v_ULTIMATE.start_main_#t~ite37_90| 0) .cse10)))) (= v_~z$w_buff0_used~0_413 |v_ULTIMATE.start_main_#t~ite38_84|)))) (= |v_ULTIMATE.start_main_#t~nondet27_39| v_~weak$$choice0~0_19) (or (and (= v_~z~0_151 v_~z~0_150) (= |v_ULTIMATE.start_main_#t~ite29_59| |v_ULTIMATE.start_main_#t~ite29_60|) .cse1) (and .cse3 .cse4 (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite29_60|) .cse9) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite29_60|) .cse10)) (= v_~z~0_151 |v_ULTIMATE.start_main_#t~ite29_60|) .cse5)) (= v_~z$mem_tmp~0_36 v_~z~0_150) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite43_72| |v_ULTIMATE.start_main_#t~ite43_71|))) (or (and (= v_~z$r_buff0_thd0~0_264 v_~z$r_buff0_thd0~0_263) (= |v_ULTIMATE.start_main_#t~ite44_68| |v_ULTIMATE.start_main_#t~ite44_67|) .cse11 .cse6) (and (= v_~z$r_buff0_thd0~0_264 |v_ULTIMATE.start_main_#t~ite44_68|) .cse0 (= v_~z$r_buff0_thd0~0_263 |v_ULTIMATE.start_main_#t~ite44_68|) .cse11))) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (or (and .cse0 (= v_~z~0_149 v_~z~0_151)) (and (= v_~z$mem_tmp~0_36 v_~z~0_149) .cse6)) (= v_~z$flush_delayed~0_62 0) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_82| |v_ULTIMATE.start_main_#t~ite46_81|))) (or (and (= v_~z$r_buff1_thd0~0_209 |v_ULTIMATE.start_main_#t~ite47_74|) .cse12 .cse0 (= v_~z$r_buff1_thd0~0_208 |v_ULTIMATE.start_main_#t~ite47_74|)) (and (= |v_ULTIMATE.start_main_#t~ite47_74| |v_ULTIMATE.start_main_#t~ite47_73|) .cse12 (= v_~z$r_buff1_thd0~0_209 v_~z$r_buff1_thd0~0_208) .cse6))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite40_59| |v_ULTIMATE.start_main_#t~ite40_60|))) (or (and .cse0 (= v_~z$w_buff1_used~0_303 |v_ULTIMATE.start_main_#t~ite41_54|) (let ((.cse13 (= (mod v_~z$w_buff0_used~0_413 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite40_60| |v_ULTIMATE.start_main_#t~ite41_54|) (= |v_ULTIMATE.start_main_#t~ite40_60| 0) .cse3 .cse5 (not .cse13)) (and .cse14 (= v_~z$w_buff1_used~0_304 |v_ULTIMATE.start_main_#t~ite41_54|) (or .cse15 .cse16 .cse13))))) (and (= |v_ULTIMATE.start_main_#t~ite41_54| |v_ULTIMATE.start_main_#t~ite41_53|) (= v_~z$w_buff1_used~0_304 v_~z$w_buff1_used~0_303) .cse14 .cse6))) (= |v_ULTIMATE.start_main_#t~nondet28_45| v_~weak$$choice2~0_84))))) InVars {ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_59|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_81|, ~z$w_buff1~0=v_~z$w_buff1~0_127, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_71|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_67|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_264, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_209, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_39|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_45|, ~y~0=v_~y~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_414, ~z$w_buff0~0=v_~z$w_buff0~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_304, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_83|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_89|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_63|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_75|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_59|, ~z~0=v_~z~0_150, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_58|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_80|, ~z$w_buff1~0=v_~z$w_buff1~0_126, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_50|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_48|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_66|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_263, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_38|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_208, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_38|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_44|, ~y~0=v_~y~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_413, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|, ~z$w_buff0~0=v_~z$w_buff0~0_133, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_303, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_70|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_48|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~z$flush_delayed~0=v_~z$flush_delayed~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_88|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_62|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_58|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_44|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_74|, ~weak$$choice0~0=v_~weak$$choice0~0_19, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_52|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_58|, ~z~0=v_~z~0_149, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~x~0=v_~x~0_35} AuxVars[|v_ULTIMATE.start_main_#t~ite43_72|, |v_ULTIMATE.start_main_#t~ite44_68|, |v_ULTIMATE.start_main_#t~ite41_54|, |v_ULTIMATE.start_main_#t~ite29_60|, |v_ULTIMATE.start_main_#t~ite40_60|, |v_ULTIMATE.start_main_#t~ite46_82|, |v_ULTIMATE.start_main_#t~ite47_74|, |v_ULTIMATE.start_main_#t~ite32_60|, |v_ULTIMATE.start_main_#t~ite34_76|, |v_ULTIMATE.start_main_#t~ite38_84|, |v_ULTIMATE.start_main_#t~ite31_64|, v_~z~0_151, |v_ULTIMATE.start_main_#t~ite37_90|, |v_ULTIMATE.start_main_#t~ite35_72|] AssignedVars[ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet27, ULTIMATE.start_main_#t~nondet28, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][48], [P1Thread1of1ForFork1InUse, P3Thread1of1ForFork3InUse, Black: 195#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), 198#true, Black: 137#(= ~y~0 0), Black: 201#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$w_buff0_used~0 0)), Black: 202#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 143#(= ~__unbuffered_p3_EAX~0 0), Black: 148#(= ~x~0 0), Black: 153#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 154#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), 32#L754true, Black: 160#(= ~y~0 1), 166#(and (= ~b~0 1) (= ~z$r_buff0_thd0~0 0)), 104#L791true, 48#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 167#(and (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~b~0 ~z$r_buff0_thd4~0) (<= 1 ~z$w_buff0_used~0)), Black: 172#(and (= ~b~0 1) (= ~z$r_buff0_thd0~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(and (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~b~0 ~z$r_buff0_thd4~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd4~0 ~__unbuffered_p3_EBX~0)), 180#true, 54#L817true, 118#P1ENTRYtrue, Black: 184#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), P2Thread1of1ForFork2InUse, Black: 186#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), P0Thread1of1ForFork0InUse, 190#true]) [2021-03-25 04:47:34,187 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is not cut-off event [2021-03-25 04:47:34,187 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2021-03-25 04:47:34,187 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2021-03-25 04:47:34,187 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2021-03-25 04:47:34,188 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([990] L862-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~z$w_buff1_used~0_304 256) 0)) (.cse17 (= (mod v_~z$r_buff1_thd0~0_209 256) 0)) (.cse9 (= (mod v_~z$r_buff0_thd0~0_264 256) 0))) (let ((.cse0 (= (mod v_~weak$$choice2~0_84 256) 0)) (.cse10 (not .cse9)) (.cse15 (and .cse9 .cse17)) (.cse19 (= (mod v_~z$w_buff0_used~0_414 256) 0)) (.cse16 (and .cse9 .cse18))) (let ((.cse1 (or .cse15 .cse19 .cse16)) (.cse4 (not .cse19)) (.cse3 (or (not .cse18) .cse10)) (.cse5 (or (not .cse17) .cse10)) (.cse6 (not .cse0))) (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (let ((.cse2 (= |v_ULTIMATE.start_main_#t~ite34_76| |v_ULTIMATE.start_main_#t~ite34_75|))) (or (and .cse0 (= v_~z$w_buff1~0_126 |v_ULTIMATE.start_main_#t~ite35_72|) (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite35_72|) .cse1 .cse2) (and (= |v_ULTIMATE.start_main_#t~ite34_76| |v_ULTIMATE.start_main_#t~ite35_72|) (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite34_76|) .cse3 .cse4 .cse5))) (and (= |v_ULTIMATE.start_main_#t~ite35_72| |v_ULTIMATE.start_main_#t~ite35_71|) (= v_~z$w_buff1~0_126 v_~z$w_buff1~0_127) .cse6 .cse2))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_32 (ite (= (ite (not (and (= v_~y~0_35 2) (= v_~x~0_35 2) (= v_~__unbuffered_p3_EAX~0_34 1) (= 0 v_~__unbuffered_p3_EBX~0_32) (= v_~z~0_151 2))) 1 0) 0) 0 1)) (let ((.cse7 (= |v_ULTIMATE.start_main_#t~ite31_64| |v_ULTIMATE.start_main_#t~ite31_63|))) (or (and (= |v_ULTIMATE.start_main_#t~ite32_59| |v_ULTIMATE.start_main_#t~ite32_60|) .cse6 (= v_~z$w_buff0~0_134 v_~z$w_buff0~0_133) .cse7) (and (or (and (= |v_ULTIMATE.start_main_#t~ite31_64| |v_ULTIMATE.start_main_#t~ite32_60|) .cse3 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite31_64|) .cse4 .cse5) (and .cse1 (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite32_60|) .cse7)) .cse0 (= v_~z$w_buff0~0_133 |v_ULTIMATE.start_main_#t~ite32_60|)))) (let ((.cse8 (= |v_ULTIMATE.start_main_#t~ite37_90| |v_ULTIMATE.start_main_#t~ite37_89|))) (or (and (= v_~z$w_buff0_used~0_413 v_~z$w_buff0_used~0_414) .cse8 .cse6 (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite38_83|)) (and .cse0 (or (and (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite38_84|) .cse1 .cse8) (and (= |v_ULTIMATE.start_main_#t~ite38_84| |v_ULTIMATE.start_main_#t~ite37_90|) .cse3 .cse4 .cse5 (or (and .cse9 (= v_~z$w_buff0_used~0_414 |v_ULTIMATE.start_main_#t~ite37_90|)) (and (= |v_ULTIMATE.start_main_#t~ite37_90| 0) .cse10)))) (= v_~z$w_buff0_used~0_413 |v_ULTIMATE.start_main_#t~ite38_84|)))) (= |v_ULTIMATE.start_main_#t~nondet27_39| v_~weak$$choice0~0_19) (or (and (= v_~z~0_151 v_~z~0_150) (= |v_ULTIMATE.start_main_#t~ite29_59| |v_ULTIMATE.start_main_#t~ite29_60|) .cse1) (and .cse3 .cse4 (or (and (= v_~z$w_buff1~0_127 |v_ULTIMATE.start_main_#t~ite29_60|) .cse9) (and (= v_~z$w_buff0~0_134 |v_ULTIMATE.start_main_#t~ite29_60|) .cse10)) (= v_~z~0_151 |v_ULTIMATE.start_main_#t~ite29_60|) .cse5)) (= v_~z$mem_tmp~0_36 v_~z~0_150) (let ((.cse11 (= |v_ULTIMATE.start_main_#t~ite43_72| |v_ULTIMATE.start_main_#t~ite43_71|))) (or (and (= v_~z$r_buff0_thd0~0_264 v_~z$r_buff0_thd0~0_263) (= |v_ULTIMATE.start_main_#t~ite44_68| |v_ULTIMATE.start_main_#t~ite44_67|) .cse11 .cse6) (and (= v_~z$r_buff0_thd0~0_264 |v_ULTIMATE.start_main_#t~ite44_68|) .cse0 (= v_~z$r_buff0_thd0~0_263 |v_ULTIMATE.start_main_#t~ite44_68|) .cse11))) (= (mod v_~main$tmp_guard1~0_32 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (or (and .cse0 (= v_~z~0_149 v_~z~0_151)) (and (= v_~z$mem_tmp~0_36 v_~z~0_149) .cse6)) (= v_~z$flush_delayed~0_62 0) (let ((.cse12 (= |v_ULTIMATE.start_main_#t~ite46_82| |v_ULTIMATE.start_main_#t~ite46_81|))) (or (and (= v_~z$r_buff1_thd0~0_209 |v_ULTIMATE.start_main_#t~ite47_74|) .cse12 .cse0 (= v_~z$r_buff1_thd0~0_208 |v_ULTIMATE.start_main_#t~ite47_74|)) (and (= |v_ULTIMATE.start_main_#t~ite47_74| |v_ULTIMATE.start_main_#t~ite47_73|) .cse12 (= v_~z$r_buff1_thd0~0_209 v_~z$r_buff1_thd0~0_208) .cse6))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite40_59| |v_ULTIMATE.start_main_#t~ite40_60|))) (or (and .cse0 (= v_~z$w_buff1_used~0_303 |v_ULTIMATE.start_main_#t~ite41_54|) (let ((.cse13 (= (mod v_~z$w_buff0_used~0_413 256) 0))) (or (and (= |v_ULTIMATE.start_main_#t~ite40_60| |v_ULTIMATE.start_main_#t~ite41_54|) (= |v_ULTIMATE.start_main_#t~ite40_60| 0) .cse3 .cse5 (not .cse13)) (and .cse14 (= v_~z$w_buff1_used~0_304 |v_ULTIMATE.start_main_#t~ite41_54|) (or .cse15 .cse16 .cse13))))) (and (= |v_ULTIMATE.start_main_#t~ite41_54| |v_ULTIMATE.start_main_#t~ite41_53|) (= v_~z$w_buff1_used~0_304 v_~z$w_buff1_used~0_303) .cse14 .cse6))) (= |v_ULTIMATE.start_main_#t~nondet28_45| v_~weak$$choice2~0_84))))) InVars {ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_59|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_81|, ~z$w_buff1~0=v_~z$w_buff1~0_127, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_71|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_67|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_264, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_209, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_39|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_45|, ~y~0=v_~y~0_35, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_414, ~z$w_buff0~0=v_~z$w_buff0~0_134, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_304, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_71|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_83|, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_89|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_63|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_75|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_53|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_59|, ~z~0=v_~z~0_150, ~x~0=v_~x~0_35} OutVars{ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_58|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_80|, ~z$w_buff1~0=v_~z$w_buff1~0_126, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_40|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_50|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_48|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_66|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_263, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_38|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_208, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_34, ULTIMATE.start_main_#t~nondet27=|v_ULTIMATE.start_main_#t~nondet27_38|, ULTIMATE.start_main_#t~nondet28=|v_ULTIMATE.start_main_#t~nondet28_44|, ~y~0=v_~y~0_35, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|, ~z$mem_tmp~0=v_~z$mem_tmp~0_36, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_413, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|, ~z$w_buff0~0=v_~z$w_buff0~0_133, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_303, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_70|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_48|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_82|, ~z$flush_delayed~0=v_~z$flush_delayed~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_32, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_88|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_62|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_58|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_44|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_74|, ~weak$$choice0~0=v_~weak$$choice0~0_19, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_52|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_58|, ~z~0=v_~z~0_149, ~weak$$choice2~0=v_~weak$$choice2~0_84, ~x~0=v_~x~0_35} AuxVars[|v_ULTIMATE.start_main_#t~ite43_72|, |v_ULTIMATE.start_main_#t~ite44_68|, |v_ULTIMATE.start_main_#t~ite41_54|, |v_ULTIMATE.start_main_#t~ite29_60|, |v_ULTIMATE.start_main_#t~ite40_60|, |v_ULTIMATE.start_main_#t~ite46_82|, |v_ULTIMATE.start_main_#t~ite47_74|, |v_ULTIMATE.start_main_#t~ite32_60|, |v_ULTIMATE.start_main_#t~ite34_76|, |v_ULTIMATE.start_main_#t~ite38_84|, |v_ULTIMATE.start_main_#t~ite31_64|, v_~z~0_151, |v_ULTIMATE.start_main_#t~ite37_90|, |v_ULTIMATE.start_main_#t~ite35_72|] AssignedVars[ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet27, ULTIMATE.start_main_#t~nondet28, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][48], [P1Thread1of1ForFork1InUse, P3Thread1of1ForFork3InUse, Black: 195#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2)), 198#true, Black: 137#(= ~y~0 0), Black: 201#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$w_buff0_used~0 0)), Black: 202#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 143#(= ~__unbuffered_p3_EAX~0 0), Black: 148#(= ~x~0 0), Black: 153#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff0_used~0 0)), Black: 154#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$w_buff0~0 2)), 32#L754true, 98#L769true, Black: 160#(= ~y~0 1), 166#(and (= ~b~0 1) (= ~z$r_buff0_thd0~0 0)), 104#L791true, 48#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, Black: 167#(and (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~b~0 ~z$r_buff0_thd4~0) (<= 1 ~z$w_buff0_used~0)), Black: 172#(and (= ~b~0 1) (= ~z$r_buff0_thd0~0 0) (not (= ~__unbuffered_p3_EBX~0 0))), Black: 174#(and (= ~z$r_buff0_thd0~0 0) (<= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~b~0 ~z$r_buff0_thd4~0) (<= 1 ~z$w_buff0_used~0) (= ~z$r_buff0_thd4~0 ~__unbuffered_p3_EBX~0)), 180#true, 54#L817true, P2Thread1of1ForFork2InUse, Black: 184#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0)), Black: 186#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0~0 ~z~0) (= ~z$r_buff1_thd0~0 0)), 190#true, P0Thread1of1ForFork0InUse]) [2021-03-25 04:47:34,188 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 04:47:34,188 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 04:47:34,188 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 04:47:34,188 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 04:47:34,203 INFO L129 PetriNetUnfolder]: 214/560 cut-off events. [2021-03-25 04:47:34,203 INFO L130 PetriNetUnfolder]: For 5144/5474 co-relation queries the response was YES. [2021-03-25 04:47:34,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2644 conditions, 560 events. 214/560 cut-off events. For 5144/5474 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3840 event pairs, 27 based on Foata normal form. 27/519 useless extension candidates. Maximal degree in co-relation 2614. Up to 214 conditions per place. [2021-03-25 04:47:34,210 INFO L142 LiptonReduction]: Number of co-enabled transitions 1238 [2021-03-25 04:47:34,230 INFO L154 LiptonReduction]: Checked pairs total: 649 [2021-03-25 04:47:34,230 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:34,230 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 83 [2021-03-25 04:47:34,232 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 76 transitions, 694 flow [2021-03-25 04:47:34,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 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:47:34,232 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:34,233 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:47:34,233 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:47:34,233 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:34,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:34,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1159486244, now seen corresponding path program 1 times [2021-03-25 04:47:34,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:34,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966276272] [2021-03-25 04:47:34,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:34,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:34,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:47:34,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:34,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:34,283 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:47:34,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966276272] [2021-03-25 04:47:34,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:34,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:47:34,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408905218] [2021-03-25 04:47:34,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:47:34,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:34,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:47:34,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:47:34,284 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 204 [2021-03-25 04:47:34,285 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 76 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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:47:34,285 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:34,285 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 204 [2021-03-25 04:47:34,285 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:34,365 INFO L129 PetriNetUnfolder]: 210/681 cut-off events. [2021-03-25 04:47:34,366 INFO L130 PetriNetUnfolder]: For 7069/7562 co-relation queries the response was YES. [2021-03-25 04:47:34,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2957 conditions, 681 events. 210/681 cut-off events. For 7069/7562 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 5349 event pairs, 21 based on Foata normal form. 65/699 useless extension candidates. Maximal degree in co-relation 2925. Up to 212 conditions per place. [2021-03-25 04:47:34,371 INFO L132 encePairwiseOnDemand]: 201/204 looper letters, 3 selfloop transitions, 3 changer transitions 8/76 dead transitions. [2021-03-25 04:47:34,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 76 transitions, 706 flow [2021-03-25 04:47:34,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:47:34,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:47:34,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 549 transitions. [2021-03-25 04:47:34,373 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8970588235294118 [2021-03-25 04:47:34,373 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 549 transitions. [2021-03-25 04:47:34,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 549 transitions. [2021-03-25 04:47:34,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:34,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 549 transitions. [2021-03-25 04:47:34,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 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:47:34,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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:47:34,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 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:47:34,375 INFO L185 Difference]: Start difference. First operand has 71 places, 76 transitions, 694 flow. Second operand 3 states and 549 transitions. [2021-03-25 04:47:34,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 76 transitions, 706 flow [2021-03-25 04:47:34,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 76 transitions, 665 flow, removed 11 selfloop flow, removed 1 redundant places. [2021-03-25 04:47:34,383 INFO L241 Difference]: Finished difference. Result has 73 places, 68 transitions, 568 flow [2021-03-25 04:47:34,383 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2021-03-25 04:47:34,383 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2021-03-25 04:47:34,383 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:34,383 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 68 transitions, 568 flow [2021-03-25 04:47:34,383 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 68 transitions, 568 flow [2021-03-25 04:47:34,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 68 transitions, 568 flow [2021-03-25 04:47:34,473 INFO L129 PetriNetUnfolder]: 171/633 cut-off events. [2021-03-25 04:47:34,473 INFO L130 PetriNetUnfolder]: For 5296/5667 co-relation queries the response was YES. [2021-03-25 04:47:34,475 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2645 conditions, 633 events. 171/633 cut-off events. For 5296/5667 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5203 event pairs, 14 based on Foata normal form. 44/639 useless extension candidates. Maximal degree in co-relation 2614. Up to 186 conditions per place. [2021-03-25 04:47:34,480 INFO L142 LiptonReduction]: Number of co-enabled transitions 1100 [2021-03-25 04:47:34,506 INFO L154 LiptonReduction]: Checked pairs total: 600 [2021-03-25 04:47:34,507 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:34,507 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 124 [2021-03-25 04:47:34,507 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 568 flow [2021-03-25 04:47:34,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 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:47:34,507 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:34,507 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:47:34,507 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:47:34,507 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:34,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:34,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1612103149, now seen corresponding path program 1 times [2021-03-25 04:47:34,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:34,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427211345] [2021-03-25 04:47:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:34,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:34,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:34,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:34,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:34,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:34,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:47:34,548 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:47:34,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427211345] [2021-03-25 04:47:34,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:34,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:47:34,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698265746] [2021-03-25 04:47:34,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:47:34,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:34,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:47:34,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:47:34,550 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 204 [2021-03-25 04:47:34,550 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 568 flow. Second operand has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 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:47:34,550 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:34,550 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 204 [2021-03-25 04:47:34,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:34,908 INFO L129 PetriNetUnfolder]: 2301/4182 cut-off events. [2021-03-25 04:47:34,908 INFO L130 PetriNetUnfolder]: For 14807/16298 co-relation queries the response was YES. [2021-03-25 04:47:34,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12954 conditions, 4182 events. 2301/4182 cut-off events. For 14807/16298 co-relation queries the response was YES. Maximal size of possible extension queue 713. Compared 35171 event pairs, 1024 based on Foata normal form. 453/3773 useless extension candidates. Maximal degree in co-relation 12921. Up to 2694 conditions per place. [2021-03-25 04:47:34,939 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 15 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2021-03-25 04:47:34,939 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 82 transitions, 646 flow [2021-03-25 04:47:34,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:47:34,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:47:34,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 869 transitions. [2021-03-25 04:47:34,941 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8519607843137255 [2021-03-25 04:47:34,941 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 869 transitions. [2021-03-25 04:47:34,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 869 transitions. [2021-03-25 04:47:34,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:34,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 869 transitions. [2021-03-25 04:47:34,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.8) internal successors, (869), 5 states have internal predecessors, (869), 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:47:34,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:47:34,945 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:47:34,945 INFO L185 Difference]: Start difference. First operand has 73 places, 68 transitions, 568 flow. Second operand 5 states and 869 transitions. [2021-03-25 04:47:34,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 82 transitions, 646 flow [2021-03-25 04:47:34,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 82 transitions, 637 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 04:47:34,966 INFO L241 Difference]: Finished difference. Result has 79 places, 77 transitions, 646 flow [2021-03-25 04:47:34,966 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=646, PETRI_PLACES=79, PETRI_TRANSITIONS=77} [2021-03-25 04:47:34,966 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 22 predicate places. [2021-03-25 04:47:34,966 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:34,966 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 77 transitions, 646 flow [2021-03-25 04:47:34,966 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 77 transitions, 646 flow [2021-03-25 04:47:34,967 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 77 transitions, 646 flow [2021-03-25 04:47:35,227 INFO L129 PetriNetUnfolder]: 1841/3371 cut-off events. [2021-03-25 04:47:35,227 INFO L130 PetriNetUnfolder]: For 13163/14715 co-relation queries the response was YES. [2021-03-25 04:47:35,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12883 conditions, 3371 events. 1841/3371 cut-off events. For 13163/14715 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 27714 event pairs, 694 based on Foata normal form. 126/2917 useless extension candidates. Maximal degree in co-relation 12848. Up to 2316 conditions per place. [2021-03-25 04:47:35,268 INFO L142 LiptonReduction]: Number of co-enabled transitions 1362 [2021-03-25 04:47:35,355 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 04:47:35,355 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:35,356 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 390 [2021-03-25 04:47:35,357 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 77 transitions, 646 flow [2021-03-25 04:47:35,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 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:47:35,357 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:35,357 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:47:35,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:47:35,357 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:35,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:35,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1968037868, now seen corresponding path program 1 times [2021-03-25 04:47:35,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:35,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169220597] [2021-03-25 04:47:35,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:35,388 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:35,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:35,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:35,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:35,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:35,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:35,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:35,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:47:35,397 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:47:35,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169220597] [2021-03-25 04:47:35,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:35,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:47:35,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275876291] [2021-03-25 04:47:35,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:47:35,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:47:35,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:47:35,399 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 204 [2021-03-25 04:47:35,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 77 transitions, 646 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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:47:35,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:35,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 204 [2021-03-25 04:47:35,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:35,695 INFO L129 PetriNetUnfolder]: 1718/3228 cut-off events. [2021-03-25 04:47:35,696 INFO L130 PetriNetUnfolder]: For 14674/24081 co-relation queries the response was YES. [2021-03-25 04:47:35,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13627 conditions, 3228 events. 1718/3228 cut-off events. For 14674/24081 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 26334 event pairs, 243 based on Foata normal form. 811/3528 useless extension candidates. Maximal degree in co-relation 13590. Up to 2238 conditions per place. [2021-03-25 04:47:35,723 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 16 selfloop transitions, 19 changer transitions 1/87 dead transitions. [2021-03-25 04:47:35,723 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 87 transitions, 744 flow [2021-03-25 04:47:35,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:47:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:47:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1217 transitions. [2021-03-25 04:47:35,726 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8522408963585434 [2021-03-25 04:47:35,726 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1217 transitions. [2021-03-25 04:47:35,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1217 transitions. [2021-03-25 04:47:35,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:35,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1217 transitions. [2021-03-25 04:47:35,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 173.85714285714286) internal successors, (1217), 7 states have internal predecessors, (1217), 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:47:35,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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:47:35,730 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 204.0) internal successors, (1632), 8 states have internal predecessors, (1632), 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:47:35,730 INFO L185 Difference]: Start difference. First operand has 79 places, 77 transitions, 646 flow. Second operand 7 states and 1217 transitions. [2021-03-25 04:47:35,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 87 transitions, 744 flow [2021-03-25 04:47:35,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 87 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:47:35,740 INFO L241 Difference]: Finished difference. Result has 87 places, 80 transitions, 725 flow [2021-03-25 04:47:35,740 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=725, PETRI_PLACES=87, PETRI_TRANSITIONS=80} [2021-03-25 04:47:35,741 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2021-03-25 04:47:35,741 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:35,741 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 80 transitions, 725 flow [2021-03-25 04:47:35,741 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 80 transitions, 725 flow [2021-03-25 04:47:35,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 80 transitions, 725 flow [2021-03-25 04:47:35,987 INFO L129 PetriNetUnfolder]: 1328/2584 cut-off events. [2021-03-25 04:47:35,987 INFO L130 PetriNetUnfolder]: For 15323/19619 co-relation queries the response was YES. [2021-03-25 04:47:36,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13297 conditions, 2584 events. 1328/2584 cut-off events. For 15323/19619 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 21533 event pairs, 200 based on Foata normal form. 101/2310 useless extension candidates. Maximal degree in co-relation 13258. Up to 1861 conditions per place. [2021-03-25 04:47:36,025 INFO L142 LiptonReduction]: Number of co-enabled transitions 1494 [2021-03-25 04:47:36,072 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 04:47:36,072 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:36,073 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 332 [2021-03-25 04:47:36,073 INFO L480 AbstractCegarLoop]: Abstraction has has 87 places, 80 transitions, 725 flow [2021-03-25 04:47:36,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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:47:36,073 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:36,073 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:47:36,073 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:47:36,073 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:36,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:36,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1253651129, now seen corresponding path program 1 times [2021-03-25 04:47:36,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:36,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368409835] [2021-03-25 04:47:36,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:36,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:36,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:47:36,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:36,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:47:36,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:36,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:36,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:36,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 04:47:36,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:36,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:36,157 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:47:36,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368409835] [2021-03-25 04:47:36,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:36,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:47:36,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357607992] [2021-03-25 04:47:36,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:47:36,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:36,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:47:36,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:47:36,159 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 204 [2021-03-25 04:47:36,160 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 80 transitions, 725 flow. Second operand has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 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:47:36,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:36,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 204 [2021-03-25 04:47:36,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:36,432 INFO L129 PetriNetUnfolder]: 1526/2944 cut-off events. [2021-03-25 04:47:36,432 INFO L130 PetriNetUnfolder]: For 21703/28538 co-relation queries the response was YES. [2021-03-25 04:47:36,449 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15799 conditions, 2944 events. 1526/2944 cut-off events. For 21703/28538 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 24337 event pairs, 219 based on Foata normal form. 166/2715 useless extension candidates. Maximal degree in co-relation 15758. Up to 2108 conditions per place. [2021-03-25 04:47:36,462 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 21 selfloop transitions, 18 changer transitions 2/84 dead transitions. [2021-03-25 04:47:36,462 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 84 transitions, 867 flow [2021-03-25 04:47:36,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:47:36,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:47:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 829 transitions. [2021-03-25 04:47:36,464 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8127450980392157 [2021-03-25 04:47:36,464 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 829 transitions. [2021-03-25 04:47:36,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 829 transitions. [2021-03-25 04:47:36,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:36,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 829 transitions. [2021-03-25 04:47:36,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.8) internal successors, (829), 5 states have internal predecessors, (829), 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:47:36,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:47:36,467 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:47:36,467 INFO L185 Difference]: Start difference. First operand has 87 places, 80 transitions, 725 flow. Second operand 5 states and 829 transitions. [2021-03-25 04:47:36,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 84 transitions, 867 flow [2021-03-25 04:47:36,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 84 transitions, 817 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-03-25 04:47:36,508 INFO L241 Difference]: Finished difference. Result has 89 places, 80 transitions, 743 flow [2021-03-25 04:47:36,509 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=743, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2021-03-25 04:47:36,509 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2021-03-25 04:47:36,509 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:36,509 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 80 transitions, 743 flow [2021-03-25 04:47:36,509 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 80 transitions, 743 flow [2021-03-25 04:47:36,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 80 transitions, 743 flow [2021-03-25 04:47:36,759 INFO L129 PetriNetUnfolder]: 1530/2986 cut-off events. [2021-03-25 04:47:36,759 INFO L130 PetriNetUnfolder]: For 17749/19111 co-relation queries the response was YES. [2021-03-25 04:47:36,772 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13792 conditions, 2986 events. 1530/2986 cut-off events. For 17749/19111 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 25515 event pairs, 228 based on Foata normal form. 100/2655 useless extension candidates. Maximal degree in co-relation 13752. Up to 1885 conditions per place. [2021-03-25 04:47:36,792 INFO L142 LiptonReduction]: Number of co-enabled transitions 1544 [2021-03-25 04:47:36,820 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 04:47:36,820 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:47:36,820 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 311 [2021-03-25 04:47:36,820 INFO L480 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 743 flow [2021-03-25 04:47:36,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.0) internal successors, (978), 6 states have internal predecessors, (978), 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:47:36,821 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:36,821 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:47:36,821 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 04:47:36,821 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:36,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:36,821 INFO L82 PathProgramCache]: Analyzing trace with hash -112737381, now seen corresponding path program 2 times [2021-03-25 04:47:36,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:36,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687402540] [2021-03-25 04:47:36,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:36,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:36,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:36,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:36,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:47:36,891 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-25 04:47:36,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 04:47:36,912 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 04:47:36,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 04:47:36,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:36,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 04:47:36,944 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:47:36,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687402540] [2021-03-25 04:47:36,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:36,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:47:36,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569297006] [2021-03-25 04:47:36,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:47:36,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:36,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:47:36,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:47:36,946 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 204 [2021-03-25 04:47:36,947 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 743 flow. Second operand has 7 states, 7 states have (on average 159.85714285714286) internal successors, (1119), 7 states have internal predecessors, (1119), 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:47:36,947 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:36,947 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 204 [2021-03-25 04:47:36,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:37,251 INFO L129 PetriNetUnfolder]: 1733/3268 cut-off events. [2021-03-25 04:47:37,251 INFO L130 PetriNetUnfolder]: For 24767/26876 co-relation queries the response was YES. [2021-03-25 04:47:37,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16024 conditions, 3268 events. 1733/3268 cut-off events. For 24767/26876 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 27160 event pairs, 263 based on Foata normal form. 166/2922 useless extension candidates. Maximal degree in co-relation 15982. Up to 2084 conditions per place. [2021-03-25 04:47:37,280 INFO L132 encePairwiseOnDemand]: 197/204 looper letters, 23 selfloop transitions, 14 changer transitions 3/83 dead transitions. [2021-03-25 04:47:37,280 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 83 transitions, 869 flow [2021-03-25 04:47:37,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:47:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:47:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 813 transitions. [2021-03-25 04:47:37,282 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7970588235294118 [2021-03-25 04:47:37,282 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 813 transitions. [2021-03-25 04:47:37,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 813 transitions. [2021-03-25 04:47:37,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:37,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 813 transitions. [2021-03-25 04:47:37,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.6) internal successors, (813), 5 states have internal predecessors, (813), 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:47:37,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:47:37,296 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 204.0) internal successors, (1224), 6 states have internal predecessors, (1224), 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:47:37,296 INFO L185 Difference]: Start difference. First operand has 89 places, 80 transitions, 743 flow. Second operand 5 states and 813 transitions. [2021-03-25 04:47:37,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 83 transitions, 869 flow [2021-03-25 04:47:37,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 83 transitions, 834 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-03-25 04:47:37,341 INFO L241 Difference]: Finished difference. Result has 91 places, 78 transitions, 721 flow [2021-03-25 04:47:37,341 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=708, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=721, PETRI_PLACES=91, PETRI_TRANSITIONS=78} [2021-03-25 04:47:37,342 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 34 predicate places. [2021-03-25 04:47:37,342 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:37,342 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 91 places, 78 transitions, 721 flow [2021-03-25 04:47:37,342 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 78 transitions, 721 flow [2021-03-25 04:47:37,342 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 78 transitions, 721 flow [2021-03-25 04:47:37,558 INFO L129 PetriNetUnfolder]: 1719/3288 cut-off events. [2021-03-25 04:47:37,559 INFO L130 PetriNetUnfolder]: For 20076/21608 co-relation queries the response was YES. [2021-03-25 04:47:37,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15120 conditions, 3288 events. 1719/3288 cut-off events. For 20076/21608 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 28201 event pairs, 242 based on Foata normal form. 94/2871 useless extension candidates. Maximal degree in co-relation 15080. Up to 2099 conditions per place. [2021-03-25 04:47:37,638 INFO L142 LiptonReduction]: Number of co-enabled transitions 1590 [2021-03-25 04:47:37,793 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 04:47:38,146 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 04:47:38,253 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 04:47:38,275 INFO L154 LiptonReduction]: Checked pairs total: 20 [2021-03-25 04:47:38,275 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:47:38,275 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 933 [2021-03-25 04:47:38,276 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 78 transitions, 727 flow [2021-03-25 04:47:38,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 159.85714285714286) internal successors, (1119), 7 states have internal predecessors, (1119), 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:47:38,276 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:38,276 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:47:38,276 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 04:47:38,276 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:38,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:38,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1307367045, now seen corresponding path program 3 times [2021-03-25 04:47:38,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:38,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274784548] [2021-03-25 04:47:38,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:38,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:38,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:38,318 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 04:47:38,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 04:47:38,332 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-03-25 04:47:38,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 04:47:38,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:38,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:38,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:38,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:47:38,357 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:47:38,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274784548] [2021-03-25 04:47:38,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:38,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:47:38,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587453606] [2021-03-25 04:47:38,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:47:38,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:38,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:47:38,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:47:38,358 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 205 [2021-03-25 04:47:38,359 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 78 transitions, 727 flow. Second operand has 6 states, 6 states have (on average 160.0) internal successors, (960), 6 states have internal predecessors, (960), 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:47:38,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:38,359 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 205 [2021-03-25 04:47:38,359 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:38,738 INFO L129 PetriNetUnfolder]: 2220/4105 cut-off events. [2021-03-25 04:47:38,738 INFO L130 PetriNetUnfolder]: For 32138/35391 co-relation queries the response was YES. [2021-03-25 04:47:38,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20092 conditions, 4105 events. 2220/4105 cut-off events. For 32138/35391 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 35303 event pairs, 281 based on Foata normal form. 164/3602 useless extension candidates. Maximal degree in co-relation 20050. Up to 2795 conditions per place. [2021-03-25 04:47:38,763 INFO L132 encePairwiseOnDemand]: 197/205 looper letters, 12 selfloop transitions, 18 changer transitions 8/81 dead transitions. [2021-03-25 04:47:38,764 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 81 transitions, 847 flow [2021-03-25 04:47:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 04:47:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 04:47:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 972 transitions. [2021-03-25 04:47:38,766 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7902439024390244 [2021-03-25 04:47:38,766 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 972 transitions. [2021-03-25 04:47:38,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 972 transitions. [2021-03-25 04:47:38,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:38,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 972 transitions. [2021-03-25 04:47:38,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 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:47:38,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 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:47:38,769 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 205.0) internal successors, (1435), 7 states have internal predecessors, (1435), 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:47:38,769 INFO L185 Difference]: Start difference. First operand has 91 places, 78 transitions, 727 flow. Second operand 6 states and 972 transitions. [2021-03-25 04:47:38,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 81 transitions, 847 flow [2021-03-25 04:47:38,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 81 transitions, 807 flow, removed 9 selfloop flow, removed 3 redundant places. [2021-03-25 04:47:38,826 INFO L241 Difference]: Finished difference. Result has 94 places, 70 transitions, 631 flow [2021-03-25 04:47:38,826 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=631, PETRI_PLACES=94, PETRI_TRANSITIONS=70} [2021-03-25 04:47:38,826 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 37 predicate places. [2021-03-25 04:47:38,827 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:38,827 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 70 transitions, 631 flow [2021-03-25 04:47:38,827 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 70 transitions, 631 flow [2021-03-25 04:47:38,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 94 places, 70 transitions, 631 flow [2021-03-25 04:47:39,102 INFO L129 PetriNetUnfolder]: 2172/4068 cut-off events. [2021-03-25 04:47:39,103 INFO L130 PetriNetUnfolder]: For 23861/26206 co-relation queries the response was YES. [2021-03-25 04:47:39,120 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18945 conditions, 4068 events. 2172/4068 cut-off events. For 23861/26206 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 35804 event pairs, 400 based on Foata normal form. 78/3431 useless extension candidates. Maximal degree in co-relation 18904. Up to 2793 conditions per place. [2021-03-25 04:47:39,150 INFO L142 LiptonReduction]: Number of co-enabled transitions 1582 [2021-03-25 04:47:40,734 INFO L154 LiptonReduction]: Checked pairs total: 72 [2021-03-25 04:47:40,734 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 04:47:40,734 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1907 [2021-03-25 04:47:40,734 INFO L480 AbstractCegarLoop]: Abstraction has has 94 places, 68 transitions, 619 flow [2021-03-25 04:47:40,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 160.0) internal successors, (960), 6 states have internal predecessors, (960), 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:47:40,734 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:40,735 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:47:40,735 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 04:47:40,735 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:40,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:40,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2106652126, now seen corresponding path program 1 times [2021-03-25 04:47:40,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:40,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010976743] [2021-03-25 04:47:40,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:40,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:40,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:40,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:40,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:40,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:40,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:40,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:40,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:40,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:40,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:47:40,781 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:47:40,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010976743] [2021-03-25 04:47:40,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:40,781 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:47:40,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801806619] [2021-03-25 04:47:40,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:47:40,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:40,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:47:40,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:47:40,783 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 205 [2021-03-25 04:47:40,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 68 transitions, 619 flow. Second operand has 6 states, 6 states have (on average 170.83333333333334) internal successors, (1025), 6 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:40,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:40,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 205 [2021-03-25 04:47:40,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:41,037 INFO L129 PetriNetUnfolder]: 1590/2914 cut-off events. [2021-03-25 04:47:41,037 INFO L130 PetriNetUnfolder]: For 19902/27439 co-relation queries the response was YES. [2021-03-25 04:47:41,049 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13804 conditions, 2914 events. 1590/2914 cut-off events. For 19902/27439 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 22424 event pairs, 52 based on Foata normal form. 666/3087 useless extension candidates. Maximal degree in co-relation 13761. Up to 2083 conditions per place. [2021-03-25 04:47:41,055 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 10 selfloop transitions, 18 changer transitions 4/76 dead transitions. [2021-03-25 04:47:41,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 76 transitions, 759 flow [2021-03-25 04:47:41,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:47:41,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:47:41,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1224 transitions. [2021-03-25 04:47:41,058 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8529616724738676 [2021-03-25 04:47:41,058 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1224 transitions. [2021-03-25 04:47:41,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1224 transitions. [2021-03-25 04:47:41,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:41,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1224 transitions. [2021-03-25 04:47:41,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 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:47:41,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 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:47:41,062 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 205.0) internal successors, (1640), 8 states have internal predecessors, (1640), 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:47:41,062 INFO L185 Difference]: Start difference. First operand has 94 places, 68 transitions, 619 flow. Second operand 7 states and 1224 transitions. [2021-03-25 04:47:41,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 76 transitions, 759 flow [2021-03-25 04:47:41,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 76 transitions, 672 flow, removed 26 selfloop flow, removed 11 redundant places. [2021-03-25 04:47:41,076 INFO L241 Difference]: Finished difference. Result has 88 places, 69 transitions, 638 flow [2021-03-25 04:47:41,076 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=638, PETRI_PLACES=88, PETRI_TRANSITIONS=69} [2021-03-25 04:47:41,076 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2021-03-25 04:47:41,076 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:41,076 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 69 transitions, 638 flow [2021-03-25 04:47:41,076 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 69 transitions, 638 flow [2021-03-25 04:47:41,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 69 transitions, 638 flow [2021-03-25 04:47:41,183 INFO L129 PetriNetUnfolder]: 810/1792 cut-off events. [2021-03-25 04:47:41,183 INFO L130 PetriNetUnfolder]: For 8322/9521 co-relation queries the response was YES. [2021-03-25 04:47:41,191 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9086 conditions, 1792 events. 810/1792 cut-off events. For 8322/9521 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 14882 event pairs, 52 based on Foata normal form. 17/1589 useless extension candidates. Maximal degree in co-relation 9048. Up to 1350 conditions per place. [2021-03-25 04:47:41,204 INFO L142 LiptonReduction]: Number of co-enabled transitions 1204 [2021-03-25 04:47:41,571 INFO L154 LiptonReduction]: Checked pairs total: 34 [2021-03-25 04:47:41,571 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:47:41,571 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 495 [2021-03-25 04:47:41,572 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 68 transitions, 628 flow [2021-03-25 04:47:41,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 170.83333333333334) internal successors, (1025), 6 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:41,572 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:41,572 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:41,572 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 04:47:41,572 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:41,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash -866690328, now seen corresponding path program 1 times [2021-03-25 04:47:41,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:41,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474774191] [2021-03-25 04:47:41,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:47:41,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:41,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:41,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:41,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:41,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:41,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:41,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:41,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:41,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:41,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:47:41,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:47:41,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:47:41,626 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:47:41,626 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474774191] [2021-03-25 04:47:41,626 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:47:41,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 04:47:41,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721338955] [2021-03-25 04:47:41,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:47:41,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:47:41,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:47:41,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:47:41,627 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 205 [2021-03-25 04:47:41,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 68 transitions, 628 flow. Second operand has 7 states, 7 states have (on average 170.85714285714286) internal successors, (1196), 7 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:41,628 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:47:41,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 205 [2021-03-25 04:47:41,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:47:41,857 INFO L129 PetriNetUnfolder]: 1192/2109 cut-off events. [2021-03-25 04:47:41,857 INFO L130 PetriNetUnfolder]: For 8306/13503 co-relation queries the response was YES. [2021-03-25 04:47:41,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10305 conditions, 2109 events. 1192/2109 cut-off events. For 8306/13503 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 14672 event pairs, 0 based on Foata normal form. 378/2074 useless extension candidates. Maximal degree in co-relation 10265. Up to 1467 conditions per place. [2021-03-25 04:47:41,870 INFO L132 encePairwiseOnDemand]: 198/205 looper letters, 6 selfloop transitions, 18 changer transitions 25/73 dead transitions. [2021-03-25 04:47:41,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 73 transitions, 694 flow [2021-03-25 04:47:41,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 04:47:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 04:47:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1391 transitions. [2021-03-25 04:47:41,873 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.848170731707317 [2021-03-25 04:47:41,873 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1391 transitions. [2021-03-25 04:47:41,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1391 transitions. [2021-03-25 04:47:41,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:47:41,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1391 transitions. [2021-03-25 04:47:41,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 173.875) internal successors, (1391), 8 states have internal predecessors, (1391), 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:47:41,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 205.0) internal successors, (1845), 9 states have internal predecessors, (1845), 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:47:41,878 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 205.0) internal successors, (1845), 9 states have internal predecessors, (1845), 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:47:41,878 INFO L185 Difference]: Start difference. First operand has 88 places, 68 transitions, 628 flow. Second operand 8 states and 1391 transitions. [2021-03-25 04:47:41,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 73 transitions, 694 flow [2021-03-25 04:47:41,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 73 transitions, 623 flow, removed 24 selfloop flow, removed 6 redundant places. [2021-03-25 04:47:41,925 INFO L241 Difference]: Finished difference. Result has 90 places, 45 transitions, 354 flow [2021-03-25 04:47:41,925 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=205, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=354, PETRI_PLACES=90, PETRI_TRANSITIONS=45} [2021-03-25 04:47:41,925 INFO L343 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2021-03-25 04:47:41,925 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:47:41,925 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 45 transitions, 354 flow [2021-03-25 04:47:41,925 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 45 transitions, 354 flow [2021-03-25 04:47:41,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 81 places, 45 transitions, 354 flow [2021-03-25 04:47:41,941 INFO L129 PetriNetUnfolder]: 87/237 cut-off events. [2021-03-25 04:47:41,941 INFO L130 PetriNetUnfolder]: For 658/719 co-relation queries the response was YES. [2021-03-25 04:47:41,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1053 conditions, 237 events. 87/237 cut-off events. For 658/719 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1206 event pairs, 0 based on Foata normal form. 1/214 useless extension candidates. Maximal degree in co-relation 1021. Up to 107 conditions per place. [2021-03-25 04:47:41,943 INFO L142 LiptonReduction]: Number of co-enabled transitions 414 [2021-03-25 04:47:42,513 WARN L205 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-25 04:47:42,707 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-25 04:47:43,842 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 338 DAG size of output: 260 [2021-03-25 04:47:44,272 WARN L205 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-25 04:47:44,623 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 74 [2021-03-25 04:47:44,900 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 93 [2021-03-25 04:47:45,287 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 04:47:45,542 WARN L205 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 04:47:45,929 WARN L205 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 04:47:46,370 WARN L205 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 04:47:46,393 INFO L154 LiptonReduction]: Checked pairs total: 86 [2021-03-25 04:47:46,393 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-25 04:47:46,393 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4468 [2021-03-25 04:47:46,394 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 39 transitions, 342 flow [2021-03-25 04:47:46,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 170.85714285714286) internal successors, (1196), 7 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:47:46,394 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:47:46,394 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:47:46,394 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 04:47:46,394 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:47:46,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:47:46,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1412033872, now seen corresponding path program 1 times [2021-03-25 04:47:46,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:47:46,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56768690] [2021-03-25 04:47:46,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:47:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:47:46,445 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:47:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:47:46,477 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:47:46,540 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:47:46,540 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:47:46,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-03-25 04:47:46,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:47:46 BasicIcfg [2021-03-25 04:47:46,674 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:47:46,675 INFO L168 Benchmark]: Toolchain (without parser) took 28803.72 ms. Allocated memory was 325.1 MB in the beginning and 1.1 GB in the end (delta: 790.6 MB). Free memory was 288.3 MB in the beginning and 672.3 MB in the end (delta: -384.1 MB). Peak memory consumption was 408.4 MB. Max. memory is 16.0 GB. [2021-03-25 04:47:46,675 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 325.1 MB. Free memory was 306.5 MB in the beginning and 306.5 MB in the end (delta: 75.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:47:46,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.11 ms. Allocated memory is still 325.1 MB. Free memory was 288.0 MB in the beginning and 284.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 16.0 GB. [2021-03-25 04:47:46,675 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.03 ms. Allocated memory is still 325.1 MB. Free memory was 284.6 MB in the beginning and 282.5 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:47:46,675 INFO L168 Benchmark]: Boogie Preprocessor took 25.40 ms. Allocated memory is still 325.1 MB. Free memory was 282.5 MB in the beginning and 279.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:47:46,675 INFO L168 Benchmark]: RCFGBuilder took 1411.72 ms. Allocated memory is still 325.1 MB. Free memory was 279.4 MB in the beginning and 249.4 MB in the end (delta: 30.0 MB). Peak memory consumption was 153.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:47:46,676 INFO L168 Benchmark]: TraceAbstraction took 26835.57 ms. Allocated memory was 325.1 MB in the beginning and 1.1 GB in the end (delta: 790.6 MB). Free memory was 248.4 MB in the beginning and 672.3 MB in the end (delta: -423.9 MB). Peak memory consumption was 365.6 MB. Max. memory is 16.0 GB. [2021-03-25 04:47:46,680 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.13 ms. Allocated memory is still 325.1 MB. Free memory was 306.5 MB in the beginning and 306.5 MB in the end (delta: 75.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 463.11 ms. Allocated memory is still 325.1 MB. Free memory was 288.0 MB in the beginning and 284.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 64.03 ms. Allocated memory is still 325.1 MB. Free memory was 284.6 MB in the beginning and 282.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 25.40 ms. Allocated memory is still 325.1 MB. Free memory was 282.5 MB in the beginning and 279.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1411.72 ms. Allocated memory is still 325.1 MB. Free memory was 279.4 MB in the beginning and 249.4 MB in the end (delta: 30.0 MB). Peak memory consumption was 153.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 26835.57 ms. Allocated memory was 325.1 MB in the beginning and 1.1 GB in the end (delta: 790.6 MB). Free memory was 248.4 MB in the beginning and 672.3 MB in the end (delta: -423.9 MB). Peak memory consumption was 365.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6866.0ms, 123 PlacesBefore, 57 PlacesAfterwards, 112 TransitionsBefore, 45 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4306 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2405, positive: 2302, positive conditional: 0, positive unconditional: 2302, negative: 103, negative conditional: 0, negative unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1267, positive: 1239, positive conditional: 0, positive unconditional: 1239, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1267, positive: 1239, positive conditional: 0, positive unconditional: 1239, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2405, positive: 1063, positive conditional: 0, positive unconditional: 1063, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 1267, unknown conditional: 0, unknown unconditional: 1267] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 157, Positive conditional cache size: 0, Positive unconditional cache size: 157, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3412.8ms, 53 PlacesBefore, 38 PlacesAfterwards, 37 TransitionsBefore, 27 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 5 FixpointIterations, 9 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 2232 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 643, positive: 514, positive conditional: 0, positive unconditional: 514, negative: 129, negative conditional: 0, negative unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 33, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 643, positive: 491, positive conditional: 0, positive unconditional: 491, negative: 119, negative conditional: 0, negative unconditional: 119, unknown: 33, unknown conditional: 0, unknown unconditional: 33] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 165, Positive conditional cache size: 0, Positive unconditional cache size: 165, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3ms, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 408 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 397 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 117, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 117, positive: 95, positive conditional: 0, positive unconditional: 95, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 165, Positive conditional cache size: 0, Positive unconditional cache size: 165, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 123.8ms, 41 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 698 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 190, positive: 152, positive conditional: 0, positive unconditional: 152, negative: 38, negative conditional: 0, negative unconditional: 38, 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: 190, positive: 149, positive conditional: 0, positive unconditional: 149, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 142, Positive conditional cache size: 0, Positive unconditional cache size: 142, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7ms, 41 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 257 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 5, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 36, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 40.1ms, 45 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 5, negative conditional: 0, negative unconditional: 5, 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: 38, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 145, Positive conditional cache size: 0, Positive unconditional cache size: 145, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.3ms, 47 PlacesBefore, 47 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 154 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 7, negative conditional: 0, negative unconditional: 7, 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: 56, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 146, Positive conditional cache size: 0, Positive unconditional cache size: 146, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1446.6ms, 56 PlacesBefore, 56 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 760 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 346 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 107, positive: 95, positive conditional: 0, positive unconditional: 95, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 107, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 146, Positive conditional cache size: 0, Positive unconditional cache size: 146, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 88.5ms, 60 PlacesBefore, 60 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 880 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 289 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 65, positive: 53, positive conditional: 0, positive unconditional: 53, 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: 65, positive: 52, positive conditional: 0, positive unconditional: 52, 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): 165, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 62.4ms, 65 PlacesBefore, 65 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 1032 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 355 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 13, negative conditional: 0, negative unconditional: 13, 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: 59, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 83.0ms, 71 PlacesBefore, 71 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 1238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 649 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 82, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 123.3ms, 73 PlacesBefore, 73 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 1100 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 600 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 82, positive: 62, positive conditional: 0, positive unconditional: 62, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 82, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 389.1ms, 79 PlacesBefore, 79 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1362 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 331.6ms, 87 PlacesBefore, 87 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1494 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 310.9ms, 89 PlacesBefore, 89 PlacesAfterwards, 80 TransitionsBefore, 80 TransitionsAfterwards, 1544 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, 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: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 166, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 933.3ms, 91 PlacesBefore, 91 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 1590 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 20 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 0, negative conditional: 0, negative unconditional: 0, 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: 20, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1906.9ms, 94 PlacesBefore, 94 PlacesAfterwards, 70 TransitionsBefore, 68 TransitionsAfterwards, 1582 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 72, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 138, Positive conditional cache size: 0, Positive unconditional cache size: 138, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 494.9ms, 88 PlacesBefore, 88 PlacesAfterwards, 69 TransitionsBefore, 68 TransitionsAfterwards, 1204 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 34 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 34, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 13, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 34, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 138, Positive conditional cache size: 0, Positive unconditional cache size: 138, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4467.7ms, 90 PlacesBefore, 75 PlacesAfterwards, 45 TransitionsBefore, 39 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 86 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 86, positive conditional: 0, positive unconditional: 86, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 21, positive conditional: 0, positive unconditional: 21, 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: 21, positive: 21, positive conditional: 0, positive unconditional: 21, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 86, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 21, unknown conditional: 0, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L718] 0 int b = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool z$flush_delayed; [L728] 0 int z$mem_tmp; [L729] 0 _Bool z$r_buff0_thd0; [L730] 0 _Bool z$r_buff0_thd1; [L731] 0 _Bool z$r_buff0_thd2; [L732] 0 _Bool z$r_buff0_thd3; [L733] 0 _Bool z$r_buff0_thd4; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$r_buff1_thd4; [L739] 0 _Bool z$read_delayed; [L740] 0 int *z$read_delayed_var; [L741] 0 int z$w_buff0; [L742] 0 _Bool z$w_buff0_used; [L743] 0 int z$w_buff1; [L744] 0 _Bool z$w_buff1_used; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1269; [L845] FCALL, FORK 0 pthread_create(&t1269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1270; [L847] FCALL, FORK 0 pthread_create(&t1270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1271; [L849] FCALL, FORK 0 pthread_create(&t1271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1272; [L851] FCALL, FORK 0 pthread_create(&t1272, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 z$w_buff1 = z$w_buff0 [L801] 4 z$w_buff0 = 2 [L802] 4 z$w_buff1_used = z$w_buff0_used [L803] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L805] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L810] 4 z$r_buff0_thd4 = (_Bool)1 [L813] 4 a = 1 [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L786] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L787] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L789] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L790] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L793] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 3 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 z$flush_delayed = weak$$choice2 [L867] 0 z$mem_tmp = z [L868] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L868] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L869] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L869] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L870] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L870] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L871] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L871] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L872] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L873] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L873] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L876] 0 z = z$flush_delayed ? z$mem_tmp : z [L877] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.0ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 26635.1ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3688.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6918.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 81 SDtfs, 46 SDslu, 33 SDs, 0 SdLazy, 554 SolverSat, 109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 438.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 406.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=743occurred in iteration=14, InterpolantAutomatonStates: 86, 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: 41.0ms SsaConstructionTime, 442.1ms SatisfiabilityAnalysisTime, 971.2ms InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 1701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...