./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix057_tso.opt.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_48cd8c89-e1bb-401b-b0ab-41ef80a41584/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48cd8c89-e1bb-401b-b0ab-41ef80a41584/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_48cd8c89-e1bb-401b-b0ab-41ef80a41584/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48cd8c89-e1bb-401b-b0ab-41ef80a41584/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix057_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48cd8c89-e1bb-401b-b0ab-41ef80a41584/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_48cd8c89-e1bb-401b-b0ab-41ef80a41584/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 d418f4c235d4e249cca49982294bc62a0d9b5e97
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
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:23:27,358 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-10-11 00:23:27,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-11 00:23:27,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-11 00:23:27,395 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-11 00:23:27,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-11 00:23:27,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-11 00:23:27,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-11 00:23:27,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-11 00:23:27,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-11 00:23:27,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-10-11 00:23:27,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-11 00:23:27,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-11 00:23:27,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-11 00:23:27,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-11 00:23:27,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-11 00:23:27,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-11 00:23:27,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-11 00:23:27,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-11 00:23:27,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-11 00:23:27,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-11 00:23:27,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-11 00:23:27,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-10-11 00:23:27,428 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-11 00:23:27,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-11 00:23:27,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-11 00:23:27,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-11 00:23:27,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-11 00:23:27,435 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-11 00:23:27,437 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-11 00:23:27,437 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-11 00:23:27,438 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-11 00:23:27,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-11 00:23:27,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-11 00:23:27,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-11 00:23:27,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-11 00:23:27,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-11 00:23:27,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-11 00:23:27,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-11 00:23:27,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-11 00:23:27,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-10-11 00:23:27,447 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48cd8c89-e1bb-401b-b0ab-41ef80a41584/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf
[2021-10-11 00:23:27,472 INFO L113 SettingsManager]: Loading preferences was successful
[2021-10-11 00:23:27,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-11 00:23:27,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-11 00:23:27,474 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-10-11 00:23:27,474 INFO L138 SettingsManager]: * Use SBE=true
[2021-10-11 00:23:27,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-11 00:23:27,474 INFO L138 SettingsManager]: * sizeof long=4
[2021-10-11 00:23:27,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-10-11 00:23:27,475 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-10-11 00:23:27,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-10-11 00:23:27,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-10-11 00:23:27,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-10-11 00:23:27,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-10-11 00:23:27,476 INFO L138 SettingsManager]: * sizeof long double=12
[2021-10-11 00:23:27,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-10-11 00:23:27,476 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-10-11 00:23:27,477 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-10-11 00:23:27,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-11 00:23:27,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-10-11 00:23:27,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-10-11 00:23:27,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-10-11 00:23:27,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-11 00:23:27,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-10-11 00:23:27,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-10-11 00:23:27,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-10-11 00:23:27,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-10-11 00:23:27,480 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-10-11 00:23:27,481 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2021-10-11 00:23:27,481 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_48cd8c89-e1bb-401b-b0ab-41ef80a41584/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_48cd8c89-e1bb-401b-b0ab-41ef80a41584/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 -> d418f4c235d4e249cca49982294bc62a0d9b5e97
[2021-10-11 00:23:27,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-11 00:23:27,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-11 00:23:27,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-11 00:23:27,792 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-10-11 00:23:27,793 INFO L275 PluginConnector]: CDTParser initialized
[2021-10-11 00:23:27,795 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48cd8c89-e1bb-401b-b0ab-41ef80a41584/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/pthread-wmm/mix057_tso.opt.i
[2021-10-11 00:23:27,877 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48cd8c89-e1bb-401b-b0ab-41ef80a41584/bin/uautomizer-Z5i5R5N3CC/data/a369506a9/2cea93c5fb394078ae330594ebe1ebcd/FLAG568265577
[2021-10-11 00:23:28,500 INFO L306 CDTParser]: Found 1 translation units.
[2021-10-11 00:23:28,500 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48cd8c89-e1bb-401b-b0ab-41ef80a41584/sv-benchmarks/c/pthread-wmm/mix057_tso.opt.i
[2021-10-11 00:23:28,528 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48cd8c89-e1bb-401b-b0ab-41ef80a41584/bin/uautomizer-Z5i5R5N3CC/data/a369506a9/2cea93c5fb394078ae330594ebe1ebcd/FLAG568265577
[2021-10-11 00:23:28,751 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48cd8c89-e1bb-401b-b0ab-41ef80a41584/bin/uautomizer-Z5i5R5N3CC/data/a369506a9/2cea93c5fb394078ae330594ebe1ebcd
[2021-10-11 00:23:28,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-11 00:23:28,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2021-10-11 00:23:28,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-11 00:23:28,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-11 00:23:28,766 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-11 00:23:28,767 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:23:28" (1/1) ...
[2021-10-11 00:23:28,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ee2fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:28, skipping insertion in model container
[2021-10-11 00:23:28,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:23:28" (1/1) ...
[2021-10-11 00:23:28,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-10-11 00:23:28,858 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-10-11 00:23:29,049 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_48cd8c89-e1bb-401b-b0ab-41ef80a41584/sv-benchmarks/c/pthread-wmm/mix057_tso.opt.i[948,961]
[2021-10-11 00:23:29,262 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:23:29,272 INFO L203 MainTranslator]: Completed pre-run
[2021-10-11 00:23:29,289 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_48cd8c89-e1bb-401b-b0ab-41ef80a41584/sv-benchmarks/c/pthread-wmm/mix057_tso.opt.i[948,961]
[2021-10-11 00:23:29,346 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-10-11 00:23:29,438 INFO L208 MainTranslator]: Completed translation
[2021-10-11 00:23:29,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:29 WrapperNode
[2021-10-11 00:23:29,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-11 00:23:29,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-11 00:23:29,440 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-11 00:23:29,443 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-11 00:23:29,451 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:23:29" (1/1) ...
[2021-10-11 00:23:29,491 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:23:29" (1/1) ...
[2021-10-11 00:23:29,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-11 00:23:29,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-11 00:23:29,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-11 00:23:29,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-10-11 00:23:29,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:29" (1/1) ...
[2021-10-11 00:23:29,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:29" (1/1) ...
[2021-10-11 00:23:29,565 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:29" (1/1) ...
[2021-10-11 00:23:29,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:29" (1/1) ...
[2021-10-11 00:23:29,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:29" (1/1) ...
[2021-10-11 00:23:29,605 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:29" (1/1) ...
[2021-10-11 00:23:29,609 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:29" (1/1) ...
[2021-10-11 00:23:29,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-11 00:23:29,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-11 00:23:29,615 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-10-11 00:23:29,615 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-10-11 00:23:29,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:29" (1/1) ...
No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48cd8c89-e1bb-401b-b0ab-41ef80a41584/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:23:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-10-11 00:23:29,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-10-11 00:23:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-11 00:23:29,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-11 00:23:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-10-11 00:23:29,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-10-11 00:23:29,727 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-10-11 00:23:29,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-10-11 00:23:29,728 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-10-11 00:23:29,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-10-11 00:23:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2021-10-11 00:23:29,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2021-10-11 00:23:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-11 00:23:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-10-11 00:23:29,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-11 00:23:29,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-11 00:23:29,731 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:23:32,025 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-11 00:23:32,026 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-10-11 00:23:32,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:23:32 BoogieIcfgContainer
[2021-10-11 00:23:32,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-11 00:23:32,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-10-11 00:23:32,032 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-10-11 00:23:32,035 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-10-11 00:23:32,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:23:28" (1/3) ...
[2021-10-11 00:23:32,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670e5d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:23:32, skipping insertion in model container
[2021-10-11 00:23:32,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:23:29" (2/3) ...
[2021-10-11 00:23:32,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670e5d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:23:32, skipping insertion in model container
[2021-10-11 00:23:32,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:23:32" (3/3) ...
[2021-10-11 00:23:32,039 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.opt.i
[2021-10-11 00:23:32,057 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-10-11 00:23:32,057 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-10-11 00:23:32,061 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations.
[2021-10-11 00:23:32,062 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-10-11 00:23:32,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,104 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,104 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,104 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,105 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,105 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,106 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,107 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,107 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,108 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,108 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,108 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,108 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,110 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,110 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,110 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,111 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,111 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,111 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,112 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,112 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,113 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,114 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,115 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,116 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,117 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,117 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,118 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,118 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,119 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,119 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,120 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,120 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,122 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,122 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,122 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,128 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,129 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,129 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,131 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,132 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,132 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,133 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,133 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,134 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,136 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,136 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,137 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,137 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,138 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,139 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,142 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-10-11 00:23:32,144 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-10-11 00:23:32,156 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2021-10-11 00:23:32,177 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2021-10-11 00:23:32,177 INFO L378 AbstractCegarLoop]: Hoare is true
[2021-10-11 00:23:32,177 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-10-11 00:23:32,177 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-10-11 00:23:32,178 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-10-11 00:23:32,178 INFO L382 AbstractCegarLoop]: Difference is false
[2021-10-11 00:23:32,178 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-10-11 00:23:32,178 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-10-11 00:23:32,191 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-10-11 00:23:32,193 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow
[2021-10-11 00:23:32,196 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 112 transitions, 244 flow
[2021-10-11 00:23:32,198 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow
[2021-10-11 00:23:32,248 INFO L129 PetriNetUnfolder]: 2/108 cut-off events.
[2021-10-11 00:23:32,248 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-10-11 00:23:32,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place.
[2021-10-11 00:23:32,258 INFO L116 LiptonReduction]: Number of co-enabled transitions 2406
[2021-10-11 00:23:32,380 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:32,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:32,382 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:32,383 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:32,487 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:32,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:32,491 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:32,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:32,620 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:32,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:32,624 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:32,625 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:32,627 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:32,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:32,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:32,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:23:32,634 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:32,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:23:32,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:32,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:23:32,647 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2021-10-11 00:23:32,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:32,651 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2021-10-11 00:23:32,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:32,655 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2021-10-11 00:23:32,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:32,765 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:32,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:32,766 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:32,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:32,771 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:32,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:23:32,776 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:32,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:32,850 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:32,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:32,858 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:32,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:32,912 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:32,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:32,913 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-10-11 00:23:32,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:33,228 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:33,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:33,230 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:33,230 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:33,283 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term
[2021-10-11 00:23:33,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:33,284 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term
[2021-10-11 00:23:33,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:33,285 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term
[2021-10-11 00:23:33,286 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:33,294 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:33,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:33,295 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:33,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:33,341 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:33,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:33,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:33,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:33,390 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:33,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:33,391 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:33,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:33,739 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58
[2021-10-11 00:23:33,874 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 57
[2021-10-11 00:23:34,458 WARN L197 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81
[2021-10-11 00:23:34,645 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 79
[2021-10-11 00:23:34,707 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:34,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:34,709 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:34,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:34,713 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:34,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:23:34,720 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:34,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:34,806 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:34,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:34,810 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:34,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:34,812 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:34,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:34,826 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:34,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:23:34,830 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:34,830 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:23:34,834 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:34,835 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:23:34,839 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2021-10-11 00:23:34,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:34,841 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2021-10-11 00:23:34,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:34,845 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2021-10-11 00:23:34,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:34,915 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:34,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:34,917 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2021-10-11 00:23:34,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:34,961 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:34,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:34,963 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:34,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,003 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:35,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:35,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term
[2021-10-11 00:23:35,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:35,037 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:35,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,038 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:35,038 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,076 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:35,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,078 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2021-10-11 00:23:35,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:35,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,104 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:35,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,169 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:35,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,170 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:35,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,200 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:35,201 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:35,202 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-10-11 00:23:35,202 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:35,265 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:35,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,266 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:35,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,269 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:35,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:23:35,273 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:35,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,327 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:35,327 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:35,334 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:35,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,338 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:35,339 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,341 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:35,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:23:35,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:35,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:23:35,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:35,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:23:35,349 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2021-10-11 00:23:35,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2021-10-11 00:23:35,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,353 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2021-10-11 00:23:35,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,562 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:35,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:35,563 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-10-11 00:23:35,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:35,590 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:35,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:35,606 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:35,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:36,831 WARN L197 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 228 DAG size of output: 188
[2021-10-11 00:23:37,713 WARN L197 SmtUtils]: Spent 879.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185
[2021-10-11 00:23:39,708 WARN L197 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 312 DAG size of output: 268
[2021-10-11 00:23:40,537 WARN L197 SmtUtils]: Spent 822.00 ms on a formula simplification that was a NOOP. DAG size: 265
[2021-10-11 00:23:40,588 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:40,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:40,590 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:40,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:40,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:40,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:40,616 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term
[2021-10-11 00:23:40,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:40,663 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:40,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:40,683 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:40,684 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:40,685 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:40,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:40,688 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:40,689 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:23:40,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:40,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:23:40,693 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:40,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-10-11 00:23:40,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2021-10-11 00:23:40,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:40,697 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2021-10-11 00:23:40,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:40,699 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term
[2021-10-11 00:23:40,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:40,760 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:40,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:40,761 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:40,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:40,764 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:40,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:23:40,768 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:40,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:41,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:41,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:41,208 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-10-11 00:23:41,209 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:41,264 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:41,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:41,265 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:41,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:41,633 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:41,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:41,635 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:41,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:41,636 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:41,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:41,638 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:23:41,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:41,658 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:41,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:41,659 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:41,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:41,663 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:41,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:41,665 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:23:41,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:41,690 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:41,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:41,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2021-10-11 00:23:41,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:41,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:41,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:41,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:41,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:41,757 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:41,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:41,758 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:41,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:41,780 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:41,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:41,781 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-10-11 00:23:41,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:41,979 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:41,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:41,980 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:41,981 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:41,982 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:41,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:41,984 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:23:41,984 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:42,003 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:42,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:42,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:42,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:42,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:42,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:42,008 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:23:42,009 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:42,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term
[2021-10-11 00:23:42,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:42,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:42,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:42,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:42,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:42,648 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:42,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:42,650 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:23:42,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-10-11 00:23:42,667 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:42,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:42,669 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:42,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:42,670 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:42,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:42,672 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:23:42,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:42,808 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:42,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:42,810 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term
[2021-10-11 00:23:42,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:42,838 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:42,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:42,840 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:42,840 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,111 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 59
[2021-10-11 00:23:43,280 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2021-10-11 00:23:43,452 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2021-10-11 00:23:43,507 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:43,514 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,516 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,518 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,520 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,523 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,525 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,581 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:43,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,582 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:43,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,585 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:43,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:23:43,588 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:43,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,745 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:43,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:43,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,775 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:43,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:43,776 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term
[2021-10-11 00:23:43,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:43,811 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:43,817 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,818 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,819 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,821 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,823 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,823 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,825 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,827 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,829 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:43,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,883 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:43,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,886 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:43,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:43,888 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:43,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:23:43,891 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:43,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,068 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2021-10-11 00:23:44,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:44,069 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-10-11 00:23:44,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:44,096 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:44,096 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,097 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:44,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:44,149 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,150 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:44,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,201 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:44,201 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,202 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:44,202 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,337 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:44,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,340 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:44,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:44,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:23:44,347 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:44,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:44,388 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,388 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,391 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,391 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,393 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,394 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,396 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,398 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,531 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:44,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:44,532 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term
[2021-10-11 00:23:44,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:44,560 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:44,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,560 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:44,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,670 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term
[2021-10-11 00:23:44,670 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,671 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term
[2021-10-11 00:23:44,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,673 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:44,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-10-11 00:23:44,676 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term
[2021-10-11 00:23:44,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,712 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-10-11 00:23:44,724 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,727 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,729 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,731 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,732 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:44,734 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term
[2021-10-11 00:23:44,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-10-11 00:23:45,293 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54
[2021-10-11 00:23:45,463 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54
[2021-10-11 00:23:46,664 WARN L197 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118
[2021-10-11 00:23:46,872 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 114
[2021-10-11 00:23:47,314 WARN L197 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118
[2021-10-11 00:23:47,502 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 114
[2021-10-11 00:23:47,514 INFO L131 LiptonReduction]: Checked pairs total: 6250
[2021-10-11 00:23:47,514 INFO L133 LiptonReduction]: Total number of compositions: 91
[2021-10-11 00:23:47,521 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow
[2021-10-11 00:23:47,712 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3082 states.
[2021-10-11 00:23:47,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states.
[2021-10-11 00:23:47,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2021-10-11 00:23:47,721 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:47,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:23:47,723 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:47,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:47,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1657207024, now seen corresponding path program 1 times
[2021-10-11 00:23:47,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:47,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437786905]
[2021-10-11 00:23:47,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:23:47,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437786905]
[2021-10-11 00:23:47,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:47,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-10-11 00:23:47,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568403030]
[2021-10-11 00:23:47,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-10-11 00:23:47,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:47,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-10-11 00:23:48,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-10-11 00:23:48,001 INFO L87 Difference]: Start difference. First operand 3082 states. Second operand 3 states.
[2021-10-11 00:23:48,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:48,158 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions.
[2021-10-11 00:23:48,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-10-11 00:23:48,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2021-10-11 00:23:48,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:48,214 INFO L225 Difference]: With dead ends: 2602
[2021-10-11 00:23:48,214 INFO L226 Difference]: Without dead ends: 2202
[2021-10-11 00:23:48,215 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:23:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states.
[2021-10-11 00:23:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 2202.
[2021-10-11 00:23:48,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2202 states.
[2021-10-11 00:23:48,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 8424 transitions.
[2021-10-11 00:23:48,394 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 8424 transitions. Word has length 9
[2021-10-11 00:23:48,395 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:48,395 INFO L481 AbstractCegarLoop]: Abstraction has 2202 states and 8424 transitions.
[2021-10-11 00:23:48,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-10-11 00:23:48,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 8424 transitions.
[2021-10-11 00:23:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2021-10-11 00:23:48,399 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:48,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:23:48,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-10-11 00:23:48,400 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:48,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:48,401 INFO L82 PathProgramCache]: Analyzing trace with hash 796408796, now seen corresponding path program 1 times
[2021-10-11 00:23:48,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:48,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668938581]
[2021-10-11 00:23:48,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:48,614 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:23:48,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668938581]
[2021-10-11 00:23:48,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:48,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:23:48,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25979814]
[2021-10-11 00:23:48,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:23:48,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:48,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:23:48,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:23:48,619 INFO L87 Difference]: Start difference. First operand 2202 states and 8424 transitions. Second operand 4 states.
[2021-10-11 00:23:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:48,681 INFO L93 Difference]: Finished difference Result 2502 states and 9254 transitions.
[2021-10-11 00:23:48,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:23:48,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2021-10-11 00:23:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:48,704 INFO L225 Difference]: With dead ends: 2502
[2021-10-11 00:23:48,705 INFO L226 Difference]: Without dead ends: 2102
[2021-10-11 00:23:48,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:23:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states.
[2021-10-11 00:23:48,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2102.
[2021-10-11 00:23:48,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states.
[2021-10-11 00:23:48,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 7964 transitions.
[2021-10-11 00:23:48,802 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 7964 transitions. Word has length 12
[2021-10-11 00:23:48,802 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:48,803 INFO L481 AbstractCegarLoop]: Abstraction has 2102 states and 7964 transitions.
[2021-10-11 00:23:48,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:23:48,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 7964 transitions.
[2021-10-11 00:23:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2021-10-11 00:23:48,806 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:48,806 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:23:48,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-10-11 00:23:48,807 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:48,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:48,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1081135003, now seen corresponding path program 1 times
[2021-10-11 00:23:48,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:48,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31706525]
[2021-10-11 00:23:48,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:48,888 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:23:48,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31706525]
[2021-10-11 00:23:48,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:48,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-11 00:23:48,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199618798]
[2021-10-11 00:23:48,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:23:48,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:48,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:23:48,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:23:48,891 INFO L87 Difference]: Start difference. First operand 2102 states and 7964 transitions. Second operand 4 states.
[2021-10-11 00:23:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:48,946 INFO L93 Difference]: Finished difference Result 2392 states and 8786 transitions.
[2021-10-11 00:23:48,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:23:48,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2021-10-11 00:23:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:48,971 INFO L225 Difference]: With dead ends: 2392
[2021-10-11 00:23:48,971 INFO L226 Difference]: Without dead ends: 2042
[2021-10-11 00:23:48,972 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:23:48,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states.
[2021-10-11 00:23:49,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 2042.
[2021-10-11 00:23:49,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2042 states.
[2021-10-11 00:23:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2042 states to 2042 states and 7696 transitions.
[2021-10-11 00:23:49,068 INFO L78 Accepts]: Start accepts. Automaton has 2042 states and 7696 transitions. Word has length 13
[2021-10-11 00:23:49,069 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:49,069 INFO L481 AbstractCegarLoop]: Abstraction has 2042 states and 7696 transitions.
[2021-10-11 00:23:49,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:23:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2042 states and 7696 transitions.
[2021-10-11 00:23:49,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2021-10-11 00:23:49,072 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:49,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:23:49,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-10-11 00:23:49,073 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:49,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:49,074 INFO L82 PathProgramCache]: Analyzing trace with hash 844817491, now seen corresponding path program 1 times
[2021-10-11 00:23:49,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:49,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124489681]
[2021-10-11 00:23:49,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:49,168 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:23:49,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124489681]
[2021-10-11 00:23:49,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:49,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:23:49,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016495756]
[2021-10-11 00:23:49,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:23:49,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:49,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:23:49,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:23:49,170 INFO L87 Difference]: Start difference. First operand 2042 states and 7696 transitions. Second operand 5 states.
[2021-10-11 00:23:49,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:49,275 INFO L93 Difference]: Finished difference Result 2318 states and 8482 transitions.
[2021-10-11 00:23:49,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:23:49,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2021-10-11 00:23:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:49,300 INFO L225 Difference]: With dead ends: 2318
[2021-10-11 00:23:49,300 INFO L226 Difference]: Without dead ends: 1998
[2021-10-11 00:23:49,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:23:49,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states.
[2021-10-11 00:23:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1998.
[2021-10-11 00:23:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states.
[2021-10-11 00:23:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 7504 transitions.
[2021-10-11 00:23:49,390 INFO L78 Accepts]: Start accepts. Automaton has 1998 states and 7504 transitions. Word has length 14
[2021-10-11 00:23:49,391 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:49,391 INFO L481 AbstractCegarLoop]: Abstraction has 1998 states and 7504 transitions.
[2021-10-11 00:23:49,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:23:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1998 states and 7504 transitions.
[2021-10-11 00:23:49,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2021-10-11 00:23:49,395 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:49,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:23:49,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-10-11 00:23:49,395 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:49,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:49,396 INFO L82 PathProgramCache]: Analyzing trace with hash -496330171, now seen corresponding path program 1 times
[2021-10-11 00:23:49,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:49,396 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514260165]
[2021-10-11 00:23:49,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:49,634 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:23:49,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514260165]
[2021-10-11 00:23:49,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:49,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:23:49,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042711213]
[2021-10-11 00:23:49,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-10-11 00:23:49,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:49,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-11 00:23:49,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:23:49,636 INFO L87 Difference]: Start difference. First operand 1998 states and 7504 transitions. Second operand 6 states.
[2021-10-11 00:23:49,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:49,816 INFO L93 Difference]: Finished difference Result 2414 states and 8952 transitions.
[2021-10-11 00:23:49,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-11 00:23:49,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2021-10-11 00:23:49,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:49,839 INFO L225 Difference]: With dead ends: 2414
[2021-10-11 00:23:49,839 INFO L226 Difference]: Without dead ends: 2158
[2021-10-11 00:23:49,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:23:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states.
[2021-10-11 00:23:49,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2158.
[2021-10-11 00:23:49,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2158 states.
[2021-10-11 00:23:49,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2158 states to 2158 states and 8128 transitions.
[2021-10-11 00:23:49,929 INFO L78 Accepts]: Start accepts. Automaton has 2158 states and 8128 transitions. Word has length 15
[2021-10-11 00:23:49,929 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:49,929 INFO L481 AbstractCegarLoop]: Abstraction has 2158 states and 8128 transitions.
[2021-10-11 00:23:49,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-10-11 00:23:49,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 8128 transitions.
[2021-10-11 00:23:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2021-10-11 00:23:49,933 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:49,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:23:49,933 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-10-11 00:23:49,933 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:49,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:49,934 INFO L82 PathProgramCache]: Analyzing trace with hash 417955619, now seen corresponding path program 2 times
[2021-10-11 00:23:49,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:49,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814811614]
[2021-10-11 00:23:49,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:50,026 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:23:50,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814811614]
[2021-10-11 00:23:50,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:50,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:23:50,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807072409]
[2021-10-11 00:23:50,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-10-11 00:23:50,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:50,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-11 00:23:50,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:23:50,028 INFO L87 Difference]: Start difference. First operand 2158 states and 8128 transitions. Second operand 6 states.
[2021-10-11 00:23:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:50,175 INFO L93 Difference]: Finished difference Result 2326 states and 8540 transitions.
[2021-10-11 00:23:50,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-11 00:23:50,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2021-10-11 00:23:50,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:50,198 INFO L225 Difference]: With dead ends: 2326
[2021-10-11 00:23:50,198 INFO L226 Difference]: Without dead ends: 2070
[2021-10-11 00:23:50,198 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2021-10-11 00:23:50,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states.
[2021-10-11 00:23:50,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 2070.
[2021-10-11 00:23:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states.
[2021-10-11 00:23:50,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 7744 transitions.
[2021-10-11 00:23:50,282 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 7744 transitions. Word has length 15
[2021-10-11 00:23:50,283 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:50,283 INFO L481 AbstractCegarLoop]: Abstraction has 2070 states and 7744 transitions.
[2021-10-11 00:23:50,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-10-11 00:23:50,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 7744 transitions.
[2021-10-11 00:23:50,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2021-10-11 00:23:50,287 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:50,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:23:50,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-10-11 00:23:50,287 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:50,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:50,287 INFO L82 PathProgramCache]: Analyzing trace with hash 418193947, now seen corresponding path program 1 times
[2021-10-11 00:23:50,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:50,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743203944]
[2021-10-11 00:23:50,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:50,354 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:23:50,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743203944]
[2021-10-11 00:23:50,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:50,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:23:50,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535336850]
[2021-10-11 00:23:50,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:23:50,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:50,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:23:50,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:23:50,356 INFO L87 Difference]: Start difference. First operand 2070 states and 7744 transitions. Second operand 5 states.
[2021-10-11 00:23:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:50,491 INFO L93 Difference]: Finished difference Result 2296 states and 8422 transitions.
[2021-10-11 00:23:50,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-11 00:23:50,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2021-10-11 00:23:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:50,516 INFO L225 Difference]: With dead ends: 2296
[2021-10-11 00:23:50,516 INFO L226 Difference]: Without dead ends: 2086
[2021-10-11 00:23:50,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:23:50,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states.
[2021-10-11 00:23:50,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2086.
[2021-10-11 00:23:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2086 states.
[2021-10-11 00:23:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 7800 transitions.
[2021-10-11 00:23:50,611 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 7800 transitions. Word has length 15
[2021-10-11 00:23:50,611 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:50,611 INFO L481 AbstractCegarLoop]: Abstraction has 2086 states and 7800 transitions.
[2021-10-11 00:23:50,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:23:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 7800 transitions.
[2021-10-11 00:23:50,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2021-10-11 00:23:50,617 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:50,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:23:50,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-10-11 00:23:50,618 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:50,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:50,618 INFO L82 PathProgramCache]: Analyzing trace with hash -516647633, now seen corresponding path program 2 times
[2021-10-11 00:23:50,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:50,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843269902]
[2021-10-11 00:23:50,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:23:50,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843269902]
[2021-10-11 00:23:50,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:50,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:23:50,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688133716]
[2021-10-11 00:23:50,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-10-11 00:23:50,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:50,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-11 00:23:50,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:23:50,785 INFO L87 Difference]: Start difference. First operand 2086 states and 7800 transitions. Second operand 6 states.
[2021-10-11 00:23:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:51,107 INFO L93 Difference]: Finished difference Result 2244 states and 8246 transitions.
[2021-10-11 00:23:51,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-10-11 00:23:51,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15
[2021-10-11 00:23:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:51,118 INFO L225 Difference]: With dead ends: 2244
[2021-10-11 00:23:51,118 INFO L226 Difference]: Without dead ends: 2034
[2021-10-11 00:23:51,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90
[2021-10-11 00:23:51,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states.
[2021-10-11 00:23:51,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1922.
[2021-10-11 00:23:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states.
[2021-10-11 00:23:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 7112 transitions.
[2021-10-11 00:23:51,193 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 7112 transitions. Word has length 15
[2021-10-11 00:23:51,193 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:51,193 INFO L481 AbstractCegarLoop]: Abstraction has 1922 states and 7112 transitions.
[2021-10-11 00:23:51,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-10-11 00:23:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 7112 transitions.
[2021-10-11 00:23:51,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-10-11 00:23:51,197 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:51,197 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:23:51,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-10-11 00:23:51,198 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:51,198 INFO L82 PathProgramCache]: Analyzing trace with hash 70377803, now seen corresponding path program 1 times
[2021-10-11 00:23:51,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:51,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904551063]
[2021-10-11 00:23:51,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:51,278 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:23:51,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904551063]
[2021-10-11 00:23:51,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:51,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:23:51,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543315320]
[2021-10-11 00:23:51,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-10-11 00:23:51,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:51,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-11 00:23:51,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:23:51,280 INFO L87 Difference]: Start difference. First operand 1922 states and 7112 transitions. Second operand 6 states.
[2021-10-11 00:23:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:51,438 INFO L93 Difference]: Finished difference Result 2234 states and 8110 transitions.
[2021-10-11 00:23:51,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-11 00:23:51,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2021-10-11 00:23:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:51,448 INFO L225 Difference]: With dead ends: 2234
[2021-10-11 00:23:51,448 INFO L226 Difference]: Without dead ends: 2066
[2021-10-11 00:23:51,449 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2021-10-11 00:23:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2066 states.
[2021-10-11 00:23:51,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2066 to 1802.
[2021-10-11 00:23:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states.
[2021-10-11 00:23:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6624 transitions.
[2021-10-11 00:23:51,520 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6624 transitions. Word has length 16
[2021-10-11 00:23:51,520 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:51,521 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6624 transitions.
[2021-10-11 00:23:51,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-10-11 00:23:51,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6624 transitions.
[2021-10-11 00:23:51,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2021-10-11 00:23:51,525 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:51,525 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:23:51,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-10-11 00:23:51,526 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:51,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:51,526 INFO L82 PathProgramCache]: Analyzing trace with hash -274918620, now seen corresponding path program 1 times
[2021-10-11 00:23:51,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:51,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743243919]
[2021-10-11 00:23:51,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:51,653 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:23:51,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743243919]
[2021-10-11 00:23:51,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:51,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-11 00:23:51,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586183574]
[2021-10-11 00:23:51,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-10-11 00:23:51,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:51,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-10-11 00:23:51,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:23:51,656 INFO L87 Difference]: Start difference. First operand 1802 states and 6624 transitions. Second operand 7 states.
[2021-10-11 00:23:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:51,899 INFO L93 Difference]: Finished difference Result 2390 states and 8490 transitions.
[2021-10-11 00:23:51,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-10-11 00:23:51,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17
[2021-10-11 00:23:51,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:51,910 INFO L225 Difference]: With dead ends: 2390
[2021-10-11 00:23:51,910 INFO L226 Difference]: Without dead ends: 1874
[2021-10-11 00:23:51,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132
[2021-10-11 00:23:51,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states.
[2021-10-11 00:23:51,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1658.
[2021-10-11 00:23:51,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states.
[2021-10-11 00:23:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 5992 transitions.
[2021-10-11 00:23:51,976 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 5992 transitions. Word has length 17
[2021-10-11 00:23:51,977 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:51,977 INFO L481 AbstractCegarLoop]: Abstraction has 1658 states and 5992 transitions.
[2021-10-11 00:23:51,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2021-10-11 00:23:51,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 5992 transitions.
[2021-10-11 00:23:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2021-10-11 00:23:51,981 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:51,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:23:51,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-10-11 00:23:51,982 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:51,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:51,982 INFO L82 PathProgramCache]: Analyzing trace with hash -267292124, now seen corresponding path program 1 times
[2021-10-11 00:23:51,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:51,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013300192]
[2021-10-11 00:23:51,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:52,125 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:23:52,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013300192]
[2021-10-11 00:23:52,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:52,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:23:52,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18715649]
[2021-10-11 00:23:52,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:23:52,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:52,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:23:52,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:23:52,132 INFO L87 Difference]: Start difference. First operand 1658 states and 5992 transitions. Second operand 4 states.
[2021-10-11 00:23:52,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:52,187 INFO L93 Difference]: Finished difference Result 1722 states and 5682 transitions.
[2021-10-11 00:23:52,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:23:52,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17
[2021-10-11 00:23:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:52,193 INFO L225 Difference]: With dead ends: 1722
[2021-10-11 00:23:52,193 INFO L226 Difference]: Without dead ends: 1322
[2021-10-11 00:23:52,193 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:23:52,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states.
[2021-10-11 00:23:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1322.
[2021-10-11 00:23:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1322 states.
[2021-10-11 00:23:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 4330 transitions.
[2021-10-11 00:23:52,270 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 4330 transitions. Word has length 17
[2021-10-11 00:23:52,270 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:52,270 INFO L481 AbstractCegarLoop]: Abstraction has 1322 states and 4330 transitions.
[2021-10-11 00:23:52,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:23:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 4330 transitions.
[2021-10-11 00:23:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2021-10-11 00:23:52,274 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:52,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-11 00:23:52,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-10-11 00:23:52,275 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:52,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:52,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1175676895, now seen corresponding path program 1 times
[2021-10-11 00:23:52,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:52,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70039590]
[2021-10-11 00:23:52,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:52,384 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:23:52,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70039590]
[2021-10-11 00:23:52,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:52,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:23:52,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879695083]
[2021-10-11 00:23:52,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:23:52,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:52,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:23:52,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:23:52,391 INFO L87 Difference]: Start difference. First operand 1322 states and 4330 transitions. Second operand 5 states.
[2021-10-11 00:23:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:52,449 INFO L93 Difference]: Finished difference Result 1136 states and 3401 transitions.
[2021-10-11 00:23:52,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-10-11 00:23:52,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18
[2021-10-11 00:23:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:52,453 INFO L225 Difference]: With dead ends: 1136
[2021-10-11 00:23:52,453 INFO L226 Difference]: Without dead ends: 880
[2021-10-11 00:23:52,454 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:23:52,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states.
[2021-10-11 00:23:52,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880.
[2021-10-11 00:23:52,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states.
[2021-10-11 00:23:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 2592 transitions.
[2021-10-11 00:23:52,481 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 2592 transitions. Word has length 18
[2021-10-11 00:23:52,481 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:52,481 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 2592 transitions.
[2021-10-11 00:23:52,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:23:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 2592 transitions.
[2021-10-11 00:23:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2021-10-11 00:23:52,483 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:52,484 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:23:52,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-10-11 00:23:52,484 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:52,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:52,484 INFO L82 PathProgramCache]: Analyzing trace with hash 908797382, now seen corresponding path program 1 times
[2021-10-11 00:23:52,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:52,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464298996]
[2021-10-11 00:23:52,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:52,562 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:23:52,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464298996]
[2021-10-11 00:23:52,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:52,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:23:52,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208021403]
[2021-10-11 00:23:52,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:23:52,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:52,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:23:52,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:23:52,564 INFO L87 Difference]: Start difference. First operand 880 states and 2592 transitions. Second operand 4 states.
[2021-10-11 00:23:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:52,598 INFO L93 Difference]: Finished difference Result 1295 states and 3672 transitions.
[2021-10-11 00:23:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:23:52,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19
[2021-10-11 00:23:52,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:52,601 INFO L225 Difference]: With dead ends: 1295
[2021-10-11 00:23:52,601 INFO L226 Difference]: Without dead ends: 900
[2021-10-11 00:23:52,602 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:23:52,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states.
[2021-10-11 00:23:52,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 868.
[2021-10-11 00:23:52,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states.
[2021-10-11 00:23:52,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 2424 transitions.
[2021-10-11 00:23:52,629 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 2424 transitions. Word has length 19
[2021-10-11 00:23:52,629 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:52,629 INFO L481 AbstractCegarLoop]: Abstraction has 868 states and 2424 transitions.
[2021-10-11 00:23:52,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:23:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 2424 transitions.
[2021-10-11 00:23:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2021-10-11 00:23:52,631 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:52,632 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]
[2021-10-11 00:23:52,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-10-11 00:23:52,632 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:52,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:52,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1820204981, now seen corresponding path program 1 times
[2021-10-11 00:23:52,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:52,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112437321]
[2021-10-11 00:23:52,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:52,683 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:23:52,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112437321]
[2021-10-11 00:23:52,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:52,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-10-11 00:23:52,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359227998]
[2021-10-11 00:23:52,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-10-11 00:23:52,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:52,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-10-11 00:23:52,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-10-11 00:23:52,684 INFO L87 Difference]: Start difference. First operand 868 states and 2424 transitions. Second operand 4 states.
[2021-10-11 00:23:52,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:52,718 INFO L93 Difference]: Finished difference Result 1263 states and 3373 transitions.
[2021-10-11 00:23:52,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:23:52,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20
[2021-10-11 00:23:52,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:52,722 INFO L225 Difference]: With dead ends: 1263
[2021-10-11 00:23:52,722 INFO L226 Difference]: Without dead ends: 880
[2021-10-11 00:23:52,722 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:23:52,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states.
[2021-10-11 00:23:52,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 852.
[2021-10-11 00:23:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states.
[2021-10-11 00:23:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 2243 transitions.
[2021-10-11 00:23:52,749 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 2243 transitions. Word has length 20
[2021-10-11 00:23:52,750 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:52,750 INFO L481 AbstractCegarLoop]: Abstraction has 852 states and 2243 transitions.
[2021-10-11 00:23:52,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-10-11 00:23:52,750 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 2243 transitions.
[2021-10-11 00:23:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2021-10-11 00:23:52,752 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:52,752 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]
[2021-10-11 00:23:52,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-10-11 00:23:52,753 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:52,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:52,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1693048300, now seen corresponding path program 1 times
[2021-10-11 00:23:52,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:52,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377015771]
[2021-10-11 00:23:52,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:52,829 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:23:52,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377015771]
[2021-10-11 00:23:52,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:52,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-11 00:23:52,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021279506]
[2021-10-11 00:23:52,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-10-11 00:23:52,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:52,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-10-11 00:23:52,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-10-11 00:23:52,830 INFO L87 Difference]: Start difference. First operand 852 states and 2243 transitions. Second operand 6 states.
[2021-10-11 00:23:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:52,899 INFO L93 Difference]: Finished difference Result 736 states and 1888 transitions.
[2021-10-11 00:23:52,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-10-11 00:23:52,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20
[2021-10-11 00:23:52,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:52,902 INFO L225 Difference]: With dead ends: 736
[2021-10-11 00:23:52,902 INFO L226 Difference]: Without dead ends: 564
[2021-10-11 00:23:52,902 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:23:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states.
[2021-10-11 00:23:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564.
[2021-10-11 00:23:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states.
[2021-10-11 00:23:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 1425 transitions.
[2021-10-11 00:23:52,919 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 1425 transitions. Word has length 20
[2021-10-11 00:23:52,919 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:52,919 INFO L481 AbstractCegarLoop]: Abstraction has 564 states and 1425 transitions.
[2021-10-11 00:23:52,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-10-11 00:23:52,920 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 1425 transitions.
[2021-10-11 00:23:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2021-10-11 00:23:52,924 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:52,924 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:23:52,924 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-10-11 00:23:52,925 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:52,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash 550601577, now seen corresponding path program 1 times
[2021-10-11 00:23:52,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:52,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680168530]
[2021-10-11 00:23:52,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:53,026 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:23:53,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680168530]
[2021-10-11 00:23:53,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:53,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-10-11 00:23:53,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102953173]
[2021-10-11 00:23:53,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-10-11 00:23:53,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:53,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-11 00:23:53,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-10-11 00:23:53,032 INFO L87 Difference]: Start difference. First operand 564 states and 1425 transitions. Second operand 5 states.
[2021-10-11 00:23:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:53,071 INFO L93 Difference]: Finished difference Result 745 states and 1814 transitions.
[2021-10-11 00:23:53,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-10-11 00:23:53,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23
[2021-10-11 00:23:53,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:53,074 INFO L225 Difference]: With dead ends: 745
[2021-10-11 00:23:53,074 INFO L226 Difference]: Without dead ends: 306
[2021-10-11 00:23:53,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:23:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states.
[2021-10-11 00:23:53,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306.
[2021-10-11 00:23:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states.
[2021-10-11 00:23:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 665 transitions.
[2021-10-11 00:23:53,084 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 665 transitions. Word has length 23
[2021-10-11 00:23:53,084 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:53,084 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 665 transitions.
[2021-10-11 00:23:53,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-10-11 00:23:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 665 transitions.
[2021-10-11 00:23:53,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2021-10-11 00:23:53,086 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:53,086 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:23:53,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-10-11 00:23:53,086 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:53,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:53,087 INFO L82 PathProgramCache]: Analyzing trace with hash -259093983, now seen corresponding path program 2 times
[2021-10-11 00:23:53,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:53,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123916464]
[2021-10-11 00:23:53,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-11 00:23:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-11 00:23:53,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123916464]
[2021-10-11 00:23:53,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-11 00:23:53,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-10-11 00:23:53,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869596534]
[2021-10-11 00:23:53,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-10-11 00:23:53,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-11 00:23:53,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-10-11 00:23:53,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2021-10-11 00:23:53,198 INFO L87 Difference]: Start difference. First operand 306 states and 665 transitions. Second operand 7 states.
[2021-10-11 00:23:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-11 00:23:53,278 INFO L93 Difference]: Finished difference Result 277 states and 608 transitions.
[2021-10-11 00:23:53,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2021-10-11 00:23:53,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23
[2021-10-11 00:23:53,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-10-11 00:23:53,280 INFO L225 Difference]: With dead ends: 277
[2021-10-11 00:23:53,280 INFO L226 Difference]: Without dead ends: 64
[2021-10-11 00:23:53,280 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:23:53,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states.
[2021-10-11 00:23:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64.
[2021-10-11 00:23:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states.
[2021-10-11 00:23:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions.
[2021-10-11 00:23:53,283 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 23
[2021-10-11 00:23:53,283 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-10-11 00:23:53,283 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions.
[2021-10-11 00:23:53,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2021-10-11 00:23:53,283 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions.
[2021-10-11 00:23:53,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2021-10-11 00:23:53,284 INFO L414 BasicCegarLoop]: Found error trace
[2021-10-11 00:23:53,284 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]
[2021-10-11 00:23:53,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-10-11 00:23:53,284 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-10-11 00:23:53,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-10-11 00:23:53,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1810376578, now seen corresponding path program 1 times
[2021-10-11 00:23:53,285 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-11 00:23:53,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283877193]
[2021-10-11 00:23:53,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-11 00:23:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:23:53,325 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:23:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-11 00:23:53,406 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-11 00:23:53,481 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-11 00:23:53,483 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2021-10-11 00:23:53,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2021-10-11 00:23:53,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:23:53 BasicIcfg
[2021-10-11 00:23:53,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-10-11 00:23:53,650 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-11 00:23:53,650 INFO L271 PluginConnector]: Initializing Witness Printer...
[2021-10-11 00:23:53,650 INFO L275 PluginConnector]: Witness Printer initialized
[2021-10-11 00:23:53,651 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:23:32" (3/4) ...
[2021-10-11 00:23:53,653 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2021-10-11 00:23:53,759 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48cd8c89-e1bb-401b-b0ab-41ef80a41584/bin/uautomizer-Z5i5R5N3CC/witness.graphml
[2021-10-11 00:23:53,760 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-11 00:23:53,761 INFO L168 Benchmark]: Toolchain (without parser) took 25003.85 ms. Allocated memory was 96.5 MB in the beginning and 490.7 MB in the end (delta: 394.3 MB). Free memory was 54.7 MB in the beginning and 433.9 MB in the end (delta: -379.1 MB). Peak memory consumption was 236.6 MB. Max. memory is 16.1 GB.
[2021-10-11 00:23:53,761 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 96.5 MB. Free memory is still 72.5 MB. There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-11 00:23:53,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.05 ms. Allocated memory is still 96.5 MB. Free memory was 54.5 MB in the beginning and 47.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.1 GB.
[2021-10-11 00:23:53,762 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.11 ms. Allocated memory is still 96.5 MB. Free memory was 47.9 MB in the beginning and 45.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:23:53,762 INFO L168 Benchmark]: Boogie Preprocessor took 66.29 ms. Allocated memory is still 96.5 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:23:53,762 INFO L168 Benchmark]: RCFGBuilder took 2415.00 ms. Allocated memory was 96.5 MB in the beginning and 167.8 MB in the end (delta: 71.3 MB). Free memory was 42.9 MB in the beginning and 117.7 MB in the end (delta: -74.8 MB). Peak memory consumption was 43.9 MB. Max. memory is 16.1 GB.
[2021-10-11 00:23:53,763 INFO L168 Benchmark]: TraceAbstraction took 21617.78 ms. Allocated memory was 167.8 MB in the beginning and 398.5 MB in the end (delta: 230.7 MB). Free memory was 117.7 MB in the beginning and 121.4 MB in the end (delta: -3.7 MB). Peak memory consumption was 226.9 MB. Max. memory is 16.1 GB.
[2021-10-11 00:23:53,763 INFO L168 Benchmark]: Witness Printer took 110.00 ms. Allocated memory was 398.5 MB in the beginning and 490.7 MB in the end (delta: 92.3 MB). Free memory was 121.4 MB in the beginning and 433.9 MB in the end (delta: -312.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-11 00:23:53,766 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.55 ms. Allocated memory is still 96.5 MB. Free memory is still 72.5 MB. There was no memory consumed. Max. memory is 16.1 GB.
* CACSL2BoogieTranslator took 678.05 ms. Allocated memory is still 96.5 MB. Free memory was 54.5 MB in the beginning and 47.9 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.1 GB.
* Boogie Procedure Inliner took 107.11 ms. Allocated memory is still 96.5 MB. Free memory was 47.9 MB in the beginning and 45.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
* Boogie Preprocessor took 66.29 ms. Allocated memory is still 96.5 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.
* RCFGBuilder took 2415.00 ms. Allocated memory was 96.5 MB in the beginning and 167.8 MB in the end (delta: 71.3 MB). Free memory was 42.9 MB in the beginning and 117.7 MB in the end (delta: -74.8 MB). Peak memory consumption was 43.9 MB. Max. memory is 16.1 GB.
* TraceAbstraction took 21617.78 ms. Allocated memory was 167.8 MB in the beginning and 398.5 MB in the end (delta: 230.7 MB). Free memory was 117.7 MB in the beginning and 121.4 MB in the end (delta: -3.7 MB). Peak memory consumption was 226.9 MB. Max. memory is 16.1 GB.
* Witness Printer took 110.00 ms. Allocated memory was 398.5 MB in the beginning and 490.7 MB in the end (delta: 92.3 MB). Free memory was 121.4 MB in the beginning and 433.9 MB in the end (delta: -312.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
1543 VarBasedMoverChecksPositive, 63 VarBasedMoverChecksNegative, 8 SemBasedMoverChecksPositive, 55 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.4s, 158 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 15.3s, 123 PlacesBefore, 45 PlacesAfterwards, 112 TransitionsBefore, 33 TransitionsAfterwards, 2406 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 91 TotalNumberOfCompositions, 6250 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_p3_EAX = 0;
[L714] 0 int a = 0;
[L715] 0 _Bool main$tmp_guard0;
[L716] 0 _Bool main$tmp_guard1;
[L718] 0 int x = 0;
[L720] 0 int y = 0;
[L722] 0 int z = 0;
[L723] 0 _Bool z$flush_delayed;
[L724] 0 int z$mem_tmp;
[L725] 0 _Bool z$r_buff0_thd0;
[L726] 0 _Bool z$r_buff0_thd1;
[L727] 0 _Bool z$r_buff0_thd2;
[L728] 0 _Bool z$r_buff0_thd3;
[L729] 0 _Bool z$r_buff0_thd4;
[L730] 0 _Bool z$r_buff1_thd0;
[L731] 0 _Bool z$r_buff1_thd1;
[L732] 0 _Bool z$r_buff1_thd2;
[L733] 0 _Bool z$r_buff1_thd3;
[L734] 0 _Bool z$r_buff1_thd4;
[L735] 0 _Bool z$read_delayed;
[L736] 0 int *z$read_delayed_var;
[L737] 0 int z$w_buff0;
[L738] 0 _Bool z$w_buff0_used;
[L739] 0 int z$w_buff1;
[L740] 0 _Bool z$w_buff1_used;
[L741] 0 _Bool weak$$choice0;
[L742] 0 _Bool weak$$choice2;
[L834] 0 pthread_t t1541;
[L835] FCALL, FORK 0 pthread_create(&t1541, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L836] 0 pthread_t t1542;
[L837] FCALL, FORK 0 pthread_create(&t1542, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L838] 0 pthread_t t1543;
[L839] FCALL, FORK 0 pthread_create(&t1543, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L840] 0 pthread_t t1544;
[L841] FCALL, FORK 0 pthread_create(&t1544, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L796] 4 z$w_buff1 = z$w_buff0
[L797] 4 z$w_buff0 = 2
[L798] 4 z$w_buff1_used = z$w_buff0_used
[L799] 4 z$w_buff0_used = (_Bool)1
[L18] COND FALSE 4 !(!expression)
[L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0
[L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1
[L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2
[L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3
[L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4
[L806] 4 z$r_buff0_thd4 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L809] 4 __unbuffered_p3_EAX = a
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L746] 1 a = 1
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L749] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, 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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L756] 1 return 0;
[L761] 2 x = 2
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, 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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L764] 2 y = 1
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, 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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L776] 3 y = 2
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, 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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L779] 3 z = 1
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=0, a=1, 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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z
[L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L791] 3 return 0;
[L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L771] 2 return 0;
[L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1
[L821] 4 return 0;
[L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4
[L3] COND FALSE 0 !(!cond)
[L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L854] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L855] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L856] 0 z$flush_delayed = weak$$choice2
[L857] 0 z$mem_tmp = z
[L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)
[L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)
[L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)
[L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)
[L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0)
[L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z
[L866] 0 z = z$flush_delayed ? z$mem_tmp : z
[L867] 0 z$flush_delayed = (_Bool)0
[L18] COND TRUE 0 !expression
[L18] 0 reach_error()
VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, 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=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.3s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.5s, HoareTripleCheckerStatistics: 661 SDtfs, 867 SDslu, 1286 SDs, 0 SdLazy, 448 SolverSat, 131 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3082occurred 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: 1.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 652 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 21475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...