./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix050_power.oepc.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 7b2dab56
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix050_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/bin/uautomizer-Z5i5R5N3CC --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f802d00882a81ac03cf09a9859751a004fad5455
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
--- Real Ultimate output ---
This is Ultimate 0.2.0-7b2dab5
[2021-10-11 00:33:55,157 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-10-11 00:33:55,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-11 00:33:55,217 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-11 00:33:55,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-11 00:33:55,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-11 00:33:55,226 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-11 00:33:55,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-11 00:33:55,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-11 00:33:55,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-11 00:33:55,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-10-11 00:33:55,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-11 00:33:55,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-11 00:33:55,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-11 00:33:55,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-11 00:33:55,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-11 00:33:55,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-11 00:33:55,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-11 00:33:55,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-11 00:33:55,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-11 00:33:55,273 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-11 00:33:55,274 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-11 00:33:55,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-10-11 00:33:55,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-11 00:33:55,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-11 00:33:55,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-11 00:33:55,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-11 00:33:55,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-11 00:33:55,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-11 00:33:55,295 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-11 00:33:55,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-11 00:33:55,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-11 00:33:55,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-11 00:33:55,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-11 00:33:55,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-11 00:33:55,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-11 00:33:55,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-11 00:33:55,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-11 00:33:55,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-11 00:33:55,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-11 00:33:55,307 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-10-11 00:33:55,309 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-10-11 00:33:55,343 INFO L113 SettingsManager]: Loading preferences was successful
[2021-10-11 00:33:55,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-11 00:33:55,345 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-11 00:33:55,345 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-10-11 00:33:55,345 INFO L138 SettingsManager]: * Use SBE=true
[2021-10-11 00:33:55,345 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-11 00:33:55,346 INFO L138 SettingsManager]: * sizeof long=4
[2021-10-11 00:33:55,346 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-10-11 00:33:55,346 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-10-11 00:33:55,346 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-10-11 00:33:55,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-10-11 00:33:55,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-10-11 00:33:55,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-10-11 00:33:55,347 INFO L138 SettingsManager]: * sizeof long double=12
[2021-10-11 00:33:55,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-10-11 00:33:55,347 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-10-11 00:33:55,347 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-10-11 00:33:55,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-11 00:33:55,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-10-11 00:33:55,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-10-11 00:33:55,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-11 00:33:55,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-11 00:33:55,349 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-10-11 00:33:55,349 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-10-11 00:33:55,349 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-10-11 00:33:55,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-10-11 00:33:55,350 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-10-11 00:33:55,350 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2021-10-11 00:33:55,350 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/bin/uautomizer-Z5i5R5N3CC/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
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/bin/uautomizer-Z5i5R5N3CC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f802d00882a81ac03cf09a9859751a004fad5455
[2021-10-11 00:33:55,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-11 00:33:55,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-11 00:33:55,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-11 00:33:55,702 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-10-11 00:33:55,706 INFO L275 PluginConnector]: CDTParser initialized
[2021-10-11 00:33:55,707 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/pthread-wmm/mix050_power.oepc.i
[2021-10-11 00:33:55,780 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/bin/uautomizer-Z5i5R5N3CC/data/fa8005a47/6a3551c5c5a44a4aa65099c757ab536b/FLAG455a70abd
[2021-10-11 00:33:56,469 INFO L306 CDTParser]: Found 1 translation units.
[2021-10-11 00:33:56,470 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/sv-benchmarks/c/pthread-wmm/mix050_power.oepc.i
[2021-10-11 00:33:56,490 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/bin/uautomizer-Z5i5R5N3CC/data/fa8005a47/6a3551c5c5a44a4aa65099c757ab536b/FLAG455a70abd
[2021-10-11 00:33:56,744 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/bin/uautomizer-Z5i5R5N3CC/data/fa8005a47/6a3551c5c5a44a4aa65099c757ab536b
[2021-10-11 00:33:56,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-11 00:33:56,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2021-10-11 00:33:56,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-11 00:33:56,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-11 00:33:56,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-11 00:33:56,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:33:56" (1/1) ...
[2021-10-11 00:33:56,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe86c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:56, skipping insertion in model container
[2021-10-11 00:33:56,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:33:56" (1/1) ...
[2021-10-11 00:33:56,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-10-11 00:33:56,819 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-10-11 00:33:57,031 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/sv-benchmarks/c/pthread-wmm/mix050_power.oepc.i[951,964]
[2021-10-11 00:33:57,292 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:33:57,301 INFO L203 MainTranslator]: Completed pre-run
[2021-10-11 00:33:57,316 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/sv-benchmarks/c/pthread-wmm/mix050_power.oepc.i[951,964]
[2021-10-11 00:33:57,391 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:33:57,475 INFO L208 MainTranslator]: Completed translation
[2021-10-11 00:33:57,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:57 WrapperNode
[2021-10-11 00:33:57,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-11 00:33:57,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-11 00:33:57,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-11 00:33:57,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-11 00:33:57,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:57" (1/1) ...
[2021-10-11 00:33:57,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:57" (1/1) ...
[2021-10-11 00:33:57,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-11 00:33:57,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-11 00:33:57,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-11 00:33:57,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-10-11 00:33:57,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:57" (1/1) ...
[2021-10-11 00:33:57,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:57" (1/1) ...
[2021-10-11 00:33:57,569 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:57" (1/1) ...
[2021-10-11 00:33:57,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:57" (1/1) ...
[2021-10-11 00:33:57,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:57" (1/1) ...
[2021-10-11 00:33:57,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:57" (1/1) ...
[2021-10-11 00:33:57,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:57" (1/1) ...
[2021-10-11 00:33:57,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-11 00:33:57,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-11 00:33:57,617 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-10-11 00:33:57,617 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-10-11 00:33:57,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:57" (1/1) ...
No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/bin/uautomizer-Z5i5R5N3CC/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-10-11 00:33:57,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-10-11 00:33:57,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-10-11 00:33:57,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-11 00:33:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-11 00:33:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-10-11 00:33:57,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-10-11 00:33:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-10-11 00:33:57,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-10-11 00:33:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-10-11 00:33:57,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-10-11 00:33:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2021-10-11 00:33:57,759 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2021-10-11 00:33:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-11 00:33:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-10-11 00:33:57,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-11 00:33:57,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-11 00:33:57,763 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-10-11 00:34:00,356 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-11 00:34:00,357 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-10-11 00:34:00,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:34:00 BoogieIcfgContainer
[2021-10-11 00:34:00,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-11 00:34:00,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-10-11 00:34:00,361 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-10-11 00:34:00,364 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-10-11 00:34:00,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:33:56" (1/3) ...
[2021-10-11 00:34:00,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@691613de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:34:00, skipping insertion in model container
[2021-10-11 00:34:00,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:57" (2/3) ...
[2021-10-11 00:34:00,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@691613de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:34:00, skipping insertion in model container
[2021-10-11 00:34:00,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:34:00" (3/3) ...
[2021-10-11 00:34:00,368 INFO L111 eAbstractionObserver]: Analyzing ICFG mix050_power.oepc.i
[2021-10-11 00:34:00,382 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-10-11 00:34:00,382 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-10-11 00:34:00,386 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-10-11 00:34:00,387 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-10-11 00:34:00,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,431 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,431 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,432 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,432 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,432 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,433 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,433 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,433 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,439 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,439 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,439 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,440 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,443 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,445 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,445 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,445 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,446 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,450 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,450 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,451 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,451 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,451 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,451 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,452 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,453 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,457 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,462 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,463 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,465 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,466 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,467 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,469 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,470 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,471 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,472 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,473 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,476 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,477 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,477 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,479 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,483 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,483 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,483 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,484 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,509 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,509 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,510 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,510 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,511 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,512 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,513 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,514 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,514 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,514 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,514 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,514 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,515 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,515 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,515 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,515 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:34:00,517 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-10-11 00:34:00,528 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2021-10-11 00:34:00,547 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2021-10-11 00:34:00,548 INFO L378 AbstractCegarLoop]: Hoare is true
[2021-10-11 00:34:00,548 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-10-11 00:34:00,548 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-10-11 00:34:00,548 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-10-11 00:34:00,548 INFO L382 AbstractCegarLoop]: Difference is false
[2021-10-11 00:34:00,548 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-10-11 00:34:00,548 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-10-11 00:34:00,560 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-10-11 00:34:00,562 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 117 transitions, 254 flow
[2021-10-11 00:34:00,565 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 117 transitions, 254 flow
[2021-10-11 00:34:00,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow
[2021-10-11 00:34:00,617 INFO L129 PetriNetUnfolder]: 2/113 cut-off events.
[2021-10-11 00:34:00,619 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-11 00:34:00,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 89 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place.
[2021-10-11 00:34:00,633 INFO L116 LiptonReduction]: Number of co-enabled transitions 2672
[2021-10-11 00:34:00,951 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,956 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:00,963 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:00,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:00,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:01,037 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:01,038 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:01,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:01,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:01,046 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:01,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:01,055 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:01,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:01,893 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:01,894 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:01,899 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:01,899 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:01,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:01,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:01,909 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:01,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:01,914 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:01,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:01,919 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:01,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:01,922 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:01,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:02,016 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:02,016 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:34:02,021 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:02,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:02,064 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,065 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,068 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:02,071 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,072 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:02,099 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:02,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:02,106 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:02,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:02,785 WARN L197 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2021-10-11 00:34:03,437 WARN L197 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81
[2021-10-11 00:34:03,617 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 79
[2021-10-11 00:34:03,774 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,775 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:03,781 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:03,806 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,808 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:03,811 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:03,814 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:03,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,031 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,032 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,071 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,101 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,101 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,105 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,331 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,334 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,337 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,341 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,369 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,370 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,370 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,374 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,376 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,377 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,616 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,619 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,622 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,649 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,651 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,797 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,798 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,800 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,803 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,805 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,828 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,830 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,830 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:04,832 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:04,835 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:04,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:05,075 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term
[2021-10-11 00:34:05,076 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:05,143 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:05,146 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:05,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:05,148 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:05,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:05,150 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:05,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:05,153 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:05,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:05,156 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:05,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:05,158 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:05,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:05,218 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:05,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:34:05,222 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:05,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:05,264 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:05,266 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:05,268 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,269 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:05,271 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:05,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:05,297 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:05,300 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:05,303 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:05,389 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:05,390 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,391 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:05,393 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:05,396 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:05,421 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:05,422 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:05,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:05,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:05,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:05,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:05,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:05,752 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:05,778 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:05,779 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:05,782 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:05,784 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:05,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:05,969 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:05,970 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:34:05,972 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:05,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,021 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,023 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:06,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:06,025 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:06,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:06,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:06,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:06,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:06,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,030 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:06,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,031 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:06,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,182 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,184 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,184 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:06,186 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:06,203 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,204 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,204 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,206 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,208 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,251 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,254 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,256 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,258 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,307 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,308 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,310 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,310 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:06,312 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:06,339 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,340 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,340 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:06,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:06,361 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,363 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,363 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,364 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,367 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,436 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,437 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,438 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,440 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,459 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,460 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:06,463 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:06,498 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,501 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:06,503 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:06,523 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,524 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,524 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,526 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,528 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,673 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,680 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:06,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:06,682 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:06,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:06,683 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:06,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:06,686 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:06,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,688 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:06,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,689 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:06,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,735 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:06,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:34:06,738 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:06,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,768 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,769 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,771 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,773 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:06,791 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,792 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:06,794 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:06,796 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:06,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:06,961 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48
[2021-10-11 00:34:07,147 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48
[2021-10-11 00:34:07,197 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,198 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:07,198 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:07,200 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,201 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:07,203 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,203 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:07,219 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:07,221 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:07,222 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:07,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:07,403 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:07,404 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:07,406 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:07,408 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:07,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:07,429 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:07,430 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:07,433 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:34:07,519 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:07,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-10-11 00:34:07,521 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:07,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:07,563 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:34:07,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:34:07,569 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:07,570 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:07,571 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:07,571 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:07,572 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-10-11 00:34:07,573 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:34:07,574 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:07,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:07,576 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:07,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:07,577 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-10-11 00:34:07,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:34:08,660 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 71
[2021-10-11 00:34:08,760 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 71
[2021-10-11 00:34:09,811 WARN L197 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124
[2021-10-11 00:34:10,021 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 120
[2021-10-11 00:34:10,541 WARN L197 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124
[2021-10-11 00:34:10,727 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 120
[2021-10-11 00:34:10,812 INFO L131 LiptonReduction]: Checked pairs total: 7950
[2021-10-11 00:34:10,813 INFO L133 LiptonReduction]: Total number of compositions: 95
[2021-10-11 00:34:10,818 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow
[2021-10-11 00:34:11,171 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4124 states.
[2021-10-11 00:34:11,173 INFO L276 IsEmpty]: Start isEmpty. Operand 4124 states.
[2021-10-11 00:34:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4
[2021-10-11 00:34:11,178 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:11,179 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1]
[2021-10-11 00:34:11,180 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:11,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:11,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1210264, now seen corresponding path program 1 times
[2021-10-11 00:34:11,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:11,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049745571]
[2021-10-11 00:34:11,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:11,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049745571]
[2021-10-11 00:34:11,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:11,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-10-11 00:34:11,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655015134]
[2021-10-11 00:34:11,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:34:11,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:11,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:34:11,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:34:11,556 INFO L87 Difference]: Start difference. First operand 4124 states. Second operand 3 states.
[2021-10-11 00:34:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:11,741 INFO L93 Difference]: Finished difference Result 3437 states and 13500 transitions.
[2021-10-11 00:34:11,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:34:11,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3
[2021-10-11 00:34:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:11,809 INFO L225 Difference]: With dead ends: 3437
[2021-10-11 00:34:11,809 INFO L226 Difference]: Without dead ends: 2812
[2021-10-11 00:34:11,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:34:11,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2812 states.
[2021-10-11 00:34:12,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2812 to 2812.
[2021-10-11 00:34:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2812 states.
[2021-10-11 00:34:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 10875 transitions.
[2021-10-11 00:34:12,111 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 10875 transitions. Word has length 3
[2021-10-11 00:34:12,111 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:12,111 INFO L481 AbstractCegarLoop]: Abstraction has 2812 states and 10875 transitions.
[2021-10-11 00:34:12,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:34:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 10875 transitions.
[2021-10-11 00:34:12,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2021-10-11 00:34:12,118 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:12,118 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:12,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-10-11 00:34:12,118 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:12,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:12,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1866713910, now seen corresponding path program 1 times
[2021-10-11 00:34:12,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:12,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524718962]
[2021-10-11 00:34:12,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:12,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524718962]
[2021-10-11 00:34:12,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:12,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:34:12,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745878267]
[2021-10-11 00:34:12,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:34:12,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:12,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:34:12,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:34:12,291 INFO L87 Difference]: Start difference. First operand 2812 states and 10875 transitions. Second operand 4 states.
[2021-10-11 00:34:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:12,365 INFO L93 Difference]: Finished difference Result 2669 states and 9291 transitions.
[2021-10-11 00:34:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:34:12,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2021-10-11 00:34:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:12,388 INFO L225 Difference]: With dead ends: 2669
[2021-10-11 00:34:12,388 INFO L226 Difference]: Without dead ends: 2044
[2021-10-11 00:34:12,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:34:12,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states.
[2021-10-11 00:34:12,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044.
[2021-10-11 00:34:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states.
[2021-10-11 00:34:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 7035 transitions.
[2021-10-11 00:34:12,487 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 7035 transitions. Word has length 11
[2021-10-11 00:34:12,488 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:12,488 INFO L481 AbstractCegarLoop]: Abstraction has 2044 states and 7035 transitions.
[2021-10-11 00:34:12,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:34:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 7035 transitions.
[2021-10-11 00:34:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2021-10-11 00:34:12,492 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:12,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:12,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-10-11 00:34:12,493 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:12,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:12,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2032679900, now seen corresponding path program 1 times
[2021-10-11 00:34:12,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:12,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88724317]
[2021-10-11 00:34:12,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:12,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:12,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88724317]
[2021-10-11 00:34:12,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:12,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:34:12,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956837438]
[2021-10-11 00:34:12,602 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:34:12,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:12,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:34:12,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:34:12,605 INFO L87 Difference]: Start difference. First operand 2044 states and 7035 transitions. Second operand 5 states.
[2021-10-11 00:34:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:12,690 INFO L93 Difference]: Finished difference Result 1645 states and 5195 transitions.
[2021-10-11 00:34:12,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-11 00:34:12,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2021-10-11 00:34:12,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:12,705 INFO L225 Difference]: With dead ends: 1645
[2021-10-11 00:34:12,705 INFO L226 Difference]: Without dead ends: 1276
[2021-10-11 00:34:12,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:34:12,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states.
[2021-10-11 00:34:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276.
[2021-10-11 00:34:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states.
[2021-10-11 00:34:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 3963 transitions.
[2021-10-11 00:34:12,761 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 3963 transitions. Word has length 15
[2021-10-11 00:34:12,762 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:12,762 INFO L481 AbstractCegarLoop]: Abstraction has 1276 states and 3963 transitions.
[2021-10-11 00:34:12,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:34:12,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 3963 transitions.
[2021-10-11 00:34:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2021-10-11 00:34:12,766 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:12,766 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:12,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-10-11 00:34:12,766 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:12,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:12,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1739054106, now seen corresponding path program 1 times
[2021-10-11 00:34:12,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:12,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942350904]
[2021-10-11 00:34:12,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:12,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942350904]
[2021-10-11 00:34:12,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:12,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:34:12,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853783419]
[2021-10-11 00:34:12,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:34:12,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:12,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:34:12,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:34:12,970 INFO L87 Difference]: Start difference. First operand 1276 states and 3963 transitions. Second operand 4 states.
[2021-10-11 00:34:13,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:13,084 INFO L93 Difference]: Finished difference Result 1908 states and 5795 transitions.
[2021-10-11 00:34:13,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-10-11 00:34:13,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19
[2021-10-11 00:34:13,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:13,100 INFO L225 Difference]: With dead ends: 1908
[2021-10-11 00:34:13,101 INFO L226 Difference]: Without dead ends: 1761
[2021-10-11 00:34:13,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:34:13,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states.
[2021-10-11 00:34:13,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1695.
[2021-10-11 00:34:13,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1695 states.
[2021-10-11 00:34:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1695 states to 1695 states and 5199 transitions.
[2021-10-11 00:34:13,179 INFO L78 Accepts]: Start accepts. Automaton has 1695 states and 5199 transitions. Word has length 19
[2021-10-11 00:34:13,180 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:13,180 INFO L481 AbstractCegarLoop]: Abstraction has 1695 states and 5199 transitions.
[2021-10-11 00:34:13,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:34:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1695 states and 5199 transitions.
[2021-10-11 00:34:13,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2021-10-11 00:34:13,185 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:13,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:13,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-10-11 00:34:13,185 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:13,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:13,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2121883844, now seen corresponding path program 2 times
[2021-10-11 00:34:13,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:13,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580278071]
[2021-10-11 00:34:13,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:13,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580278071]
[2021-10-11 00:34:13,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:13,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:34:13,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756197772]
[2021-10-11 00:34:13,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:34:13,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:13,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:34:13,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:34:13,290 INFO L87 Difference]: Start difference. First operand 1695 states and 5199 transitions. Second operand 5 states.
[2021-10-11 00:34:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:13,351 INFO L93 Difference]: Finished difference Result 2327 states and 7031 transitions.
[2021-10-11 00:34:13,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-10-11 00:34:13,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19
[2021-10-11 00:34:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:13,363 INFO L225 Difference]: With dead ends: 2327
[2021-10-11 00:34:13,364 INFO L226 Difference]: Without dead ends: 1312
[2021-10-11 00:34:13,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:34:13,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states.
[2021-10-11 00:34:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1276.
[2021-10-11 00:34:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states.
[2021-10-11 00:34:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 3791 transitions.
[2021-10-11 00:34:13,417 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 3791 transitions. Word has length 19
[2021-10-11 00:34:13,418 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:13,418 INFO L481 AbstractCegarLoop]: Abstraction has 1276 states and 3791 transitions.
[2021-10-11 00:34:13,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:34:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 3791 transitions.
[2021-10-11 00:34:13,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2021-10-11 00:34:13,421 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:13,421 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:13,421 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-10-11 00:34:13,422 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:13,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:13,422 INFO L82 PathProgramCache]: Analyzing trace with hash 904885618, now seen corresponding path program 3 times
[2021-10-11 00:34:13,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:13,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897362376]
[2021-10-11 00:34:13,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:13,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897362376]
[2021-10-11 00:34:13,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:13,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-11 00:34:13,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258060999]
[2021-10-11 00:34:13,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-10-11 00:34:13,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:13,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-11 00:34:13,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:34:13,510 INFO L87 Difference]: Start difference. First operand 1276 states and 3791 transitions. Second operand 6 states.
[2021-10-11 00:34:13,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:13,591 INFO L93 Difference]: Finished difference Result 1101 states and 3241 transitions.
[2021-10-11 00:34:13,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-11 00:34:13,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19
[2021-10-11 00:34:13,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:13,601 INFO L225 Difference]: With dead ends: 1101
[2021-10-11 00:34:13,601 INFO L226 Difference]: Without dead ends: 988
[2021-10-11 00:34:13,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:34:13,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states.
[2021-10-11 00:34:13,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988.
[2021-10-11 00:34:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states.
[2021-10-11 00:34:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 2949 transitions.
[2021-10-11 00:34:13,642 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 2949 transitions. Word has length 19
[2021-10-11 00:34:13,642 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:13,643 INFO L481 AbstractCegarLoop]: Abstraction has 988 states and 2949 transitions.
[2021-10-11 00:34:13,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-10-11 00:34:13,643 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 2949 transitions.
[2021-10-11 00:34:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2021-10-11 00:34:13,646 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:13,646 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:13,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-10-11 00:34:13,647 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:13,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:13,647 INFO L82 PathProgramCache]: Analyzing trace with hash 145865782, now seen corresponding path program 1 times
[2021-10-11 00:34:13,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:13,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702520592]
[2021-10-11 00:34:13,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:13,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702520592]
[2021-10-11 00:34:13,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:13,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-10-11 00:34:13,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854400068]
[2021-10-11 00:34:13,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-10-11 00:34:13,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:13,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-10-11 00:34:13,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:34:13,766 INFO L87 Difference]: Start difference. First operand 988 states and 2949 transitions. Second operand 7 states.
[2021-10-11 00:34:13,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:13,857 INFO L93 Difference]: Finished difference Result 957 states and 2886 transitions.
[2021-10-11 00:34:13,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2021-10-11 00:34:13,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23
[2021-10-11 00:34:13,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:13,864 INFO L225 Difference]: With dead ends: 957
[2021-10-11 00:34:13,864 INFO L226 Difference]: Without dead ends: 644
[2021-10-11 00:34:13,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2021-10-11 00:34:13,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states.
[2021-10-11 00:34:13,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644.
[2021-10-11 00:34:13,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states.
[2021-10-11 00:34:13,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1931 transitions.
[2021-10-11 00:34:13,891 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1931 transitions. Word has length 23
[2021-10-11 00:34:13,891 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:13,891 INFO L481 AbstractCegarLoop]: Abstraction has 644 states and 1931 transitions.
[2021-10-11 00:34:13,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2021-10-11 00:34:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1931 transitions.
[2021-10-11 00:34:13,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2021-10-11 00:34:13,894 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:13,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:13,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-10-11 00:34:13,895 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:13,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:13,895 INFO L82 PathProgramCache]: Analyzing trace with hash -264347987, now seen corresponding path program 1 times
[2021-10-11 00:34:13,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:13,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224394681]
[2021-10-11 00:34:13,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:34:14,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:34:14,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224394681]
[2021-10-11 00:34:14,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:34:14,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-10-11 00:34:14,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190181010]
[2021-10-11 00:34:14,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-10-11 00:34:14,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:34:14,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-10-11 00:34:14,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2021-10-11 00:34:14,280 INFO L87 Difference]: Start difference. First operand 644 states and 1931 transitions. Second operand 8 states.
[2021-10-11 00:34:14,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:34:14,607 INFO L93 Difference]: Finished difference Result 1006 states and 2888 transitions.
[2021-10-11 00:34:14,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-11 00:34:14,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27
[2021-10-11 00:34:14,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:34:14,614 INFO L225 Difference]: With dead ends: 1006
[2021-10-11 00:34:14,615 INFO L226 Difference]: Without dead ends: 705
[2021-10-11 00:34:14,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2021-10-11 00:34:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states.
[2021-10-11 00:34:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 644.
[2021-10-11 00:34:14,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states.
[2021-10-11 00:34:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1857 transitions.
[2021-10-11 00:34:14,644 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1857 transitions. Word has length 27
[2021-10-11 00:34:14,645 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:34:14,645 INFO L481 AbstractCegarLoop]: Abstraction has 644 states and 1857 transitions.
[2021-10-11 00:34:14,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2021-10-11 00:34:14,645 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1857 transitions.
[2021-10-11 00:34:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2021-10-11 00:34:14,648 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:34:14,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:34:14,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-10-11 00:34:14,649 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:34:14,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:34:14,650 INFO L82 PathProgramCache]: Analyzing trace with hash -998085801, now seen corresponding path program 2 times
[2021-10-11 00:34:14,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:34:14,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262689720]
[2021-10-11 00:34:14,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:34:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:34:14,753 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:34:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:34:15,030 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:34:15,073 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-11 00:34:15,073 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2021-10-11 00:34:15,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-10-11 00:34:15,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:34:15 BasicIcfg
[2021-10-11 00:34:15,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-10-11 00:34:15,227 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-11 00:34:15,228 INFO L271 PluginConnector]: Initializing Witness Printer...
[2021-10-11 00:34:15,228 INFO L275 PluginConnector]: Witness Printer initialized
[2021-10-11 00:34:15,228 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:34:00" (3/4) ...
[2021-10-11 00:34:15,230 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2021-10-11 00:34:15,395 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_beb78090-c97b-4406-a136-44417ad022d6/bin/uautomizer-Z5i5R5N3CC/witness.graphml
[2021-10-11 00:34:15,395 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-11 00:34:15,396 INFO L168 Benchmark]: Toolchain (without parser) took 18647.00 ms. Allocated memory was 94.4 MB in the beginning and 417.3 MB in the end (delta: 323.0 MB). Free memory was 62.5 MB in the beginning and 216.3 MB in the end (delta: -153.8 MB). Peak memory consumption was 168.3 MB. Max. memory is 16.1 GB.
[2021-10-11 00:34:15,397 INFO L168 Benchmark]: CDTParser took 0.65 ms. Allocated memory is still 94.4 MB. Free memory was 51.2 MB in the beginning and 51.2 MB in the end (delta: 47.2 kB). There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-11 00:34:15,397 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.44 ms. Allocated memory is still 94.4 MB. Free memory was 62.2 MB in the beginning and 45.4 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB.
[2021-10-11 00:34:15,398 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.84 ms. Allocated memory is still 94.4 MB. Free memory was 45.0 MB in the beginning and 42.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:34:15,398 INFO L168 Benchmark]: Boogie Preprocessor took 63.36 ms. Allocated memory is still 94.4 MB. Free memory was 42.5 MB in the beginning and 40.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:34:15,400 INFO L168 Benchmark]: RCFGBuilder took 2742.83 ms. Allocated memory was 94.4 MB in the beginning and 146.8 MB in the end (delta: 52.4 MB). Free memory was 40.4 MB in the beginning and 76.4 MB in the end (delta: -36.0 MB). Peak memory consumption was 31.3 MB. Max. memory is 16.1 GB.
[2021-10-11 00:34:15,400 INFO L168 Benchmark]: TraceAbstraction took 14866.47 ms. Allocated memory was 146.8 MB in the beginning and 417.3 MB in the end (delta: 270.5 MB). Free memory was 76.4 MB in the beginning and 240.4 MB in the end (delta: -164.0 MB). Peak memory consumption was 106.5 MB. Max. memory is 16.1 GB.
[2021-10-11 00:34:15,400 INFO L168 Benchmark]: Witness Printer took 167.67 ms. Allocated memory is still 417.3 MB. Free memory was 240.4 MB in the beginning and 216.3 MB in the end (delta: 24.1 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB.
[2021-10-11 00:34:15,403 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.65 ms. Allocated memory is still 94.4 MB. Free memory was 51.2 MB in the beginning and 51.2 MB in the end (delta: 47.2 kB). There was no memory consumed. Max. memory is 16.1 GB.
* CACSL2BoogieTranslator took 725.44 ms. Allocated memory is still 94.4 MB. Free memory was 62.2 MB in the beginning and 45.4 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB.
* Boogie Procedure Inliner took 74.84 ms. Allocated memory is still 94.4 MB. Free memory was 45.0 MB in the beginning and 42.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
* Boogie Preprocessor took 63.36 ms. Allocated memory is still 94.4 MB. Free memory was 42.5 MB in the beginning and 40.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
* RCFGBuilder took 2742.83 ms. Allocated memory was 94.4 MB in the beginning and 146.8 MB in the end (delta: 52.4 MB). Free memory was 40.4 MB in the beginning and 76.4 MB in the end (delta: -36.0 MB). Peak memory consumption was 31.3 MB. Max. memory is 16.1 GB.
* TraceAbstraction took 14866.47 ms. Allocated memory was 146.8 MB in the beginning and 417.3 MB in the end (delta: 270.5 MB). Free memory was 76.4 MB in the beginning and 240.4 MB in the end (delta: -164.0 MB). Peak memory consumption was 106.5 MB. Max. memory is 16.1 GB.
* Witness Printer took 167.67 ms. Allocated memory is still 417.3 MB. Free memory was 240.4 MB in the beginning and 216.3 MB in the end (delta: 24.1 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
1890 VarBasedMoverChecksPositive, 113 VarBasedMoverChecksNegative, 38 SemBasedMoverChecksPositive, 75 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.9s, 271 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.2s, 128 PlacesBefore, 46 PlacesAfterwards, 117 TransitionsBefore, 34 TransitionsAfterwards, 2672 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 95 TotalNumberOfCompositions, 7950 MoverChecksTotal
- 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_p0_EAX = 0;
[L714] 0 int __unbuffered_p1_EAX = 0;
[L716] 0 int __unbuffered_p2_EAX = 0;
[L718] 0 int __unbuffered_p3_EAX = 0;
[L720] 0 int a = 0;
[L721] 0 _Bool a$flush_delayed;
[L722] 0 int a$mem_tmp;
[L723] 0 _Bool a$r_buff0_thd0;
[L724] 0 _Bool a$r_buff0_thd1;
[L725] 0 _Bool a$r_buff0_thd2;
[L726] 0 _Bool a$r_buff0_thd3;
[L727] 0 _Bool a$r_buff0_thd4;
[L728] 0 _Bool a$r_buff1_thd0;
[L729] 0 _Bool a$r_buff1_thd1;
[L730] 0 _Bool a$r_buff1_thd2;
[L731] 0 _Bool a$r_buff1_thd3;
[L732] 0 _Bool a$r_buff1_thd4;
[L733] 0 _Bool a$read_delayed;
[L734] 0 int *a$read_delayed_var;
[L735] 0 int a$w_buff0;
[L736] 0 _Bool a$w_buff0_used;
[L737] 0 int a$w_buff1;
[L738] 0 _Bool a$w_buff1_used;
[L739] 0 _Bool main$tmp_guard0;
[L740] 0 _Bool main$tmp_guard1;
[L742] 0 int x = 0;
[L744] 0 int y = 0;
[L746] 0 int z = 0;
[L747] 0 _Bool weak$$choice0;
[L748] 0 _Bool weak$$choice2;
[L863] 0 pthread_t t1321;
[L864] FCALL, FORK 0 pthread_create(&t1321, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L752] 1 a$w_buff1 = a$w_buff0
[L753] 1 a$w_buff0 = 1
[L754] 1 a$w_buff1_used = a$w_buff0_used
[L755] 1 a$w_buff0_used = (_Bool)1
[L18] COND FALSE 1 !(!expression)
[L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0
[L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1
[L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2
[L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3
[L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4
[L762] 1 a$r_buff0_thd1 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L865] 0 pthread_t t1322;
[L866] FCALL, FORK 0 pthread_create(&t1322, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L765] 1 __unbuffered_p0_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L782] 2 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L785] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L788] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a
[L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used
[L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used
[L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2
[L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2
[L867] 0 pthread_t t1323;
[L868] FCALL, FORK 0 pthread_create(&t1323, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0]
[L802] 3 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L805] 3 __unbuffered_p2_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a)
[L808] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a
[L808] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a)
[L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a)
[L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used
[L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used
[L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used
[L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used
[L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3
[L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3
[L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3
[L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3
[L869] 0 pthread_t t1324;
[L870] FCALL, FORK 0 pthread_create(&t1324, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0]
[L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L817] 3 return 0;
[L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L797] 2 return 0;
[L822] 4 z = 1
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1]
[L825] 4 weak$$choice0 = __VERIFIER_nondet_bool()
[L826] 4 weak$$choice2 = __VERIFIER_nondet_bool()
[L827] 4 a$flush_delayed = weak$$choice2
[L828] 4 a$mem_tmp = a
[L829] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1)
[L829] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1)
[L830] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0))
[L830] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0))
[L831] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1))
[L831] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1))
[L832] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used))
[L832] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used))
[L833] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L833] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L834] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4))
[L834] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4))
[L835] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L835] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0))
[L836] 4 __unbuffered_p3_EAX = a
[L837] EXPR 4 a$flush_delayed ? a$mem_tmp : a
[L837] 4 a = a$flush_delayed ? a$mem_tmp : a
[L838] 4 a$flush_delayed = (_Bool)0
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1]
[L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a)
[L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a)
[L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used
[L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used
[L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1
[L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1
[L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L777] 1 return 0;
[L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a)
[L841] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a
[L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a)
[L841] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a)
[L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used
[L842] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used
[L843] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used
[L843] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used
[L844] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4
[L844] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4
[L845] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4
[L845] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4
[L848] 4 __unbuffered_cnt = __unbuffered_cnt + 1
[L850] 4 return 0;
[L872] 0 main$tmp_guard0 = __unbuffered_cnt == 4
[L3] COND FALSE 0 !(!cond)
[L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L876] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a
[L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L876] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L877] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L878] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used
[L878] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used
[L879] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L879] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L880] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0
[L880] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0
[L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0)
[L18] COND TRUE 0 !expression
[L18] 0 reach_error()
VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=1]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.5s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.6s, HoareTripleCheckerStatistics: 323 SDtfs, 431 SDslu, 712 SDs, 0 SdLazy, 274 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4124occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 8 MinimizatonAttempts, 163 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 19406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...