./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y --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 4ed4cbcf73a390a7811d007883e420d1e9d8d4b9f5e59201847b4262dc4b0025 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 18:30:05,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 18:30:05,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 18:30:05,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 18:30:05,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 18:30:05,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 18:30:05,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 18:30:05,659 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 18:30:05,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 18:30:05,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 18:30:05,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 18:30:05,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 18:30:05,668 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 18:30:05,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 18:30:05,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 18:30:05,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 18:30:05,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 18:30:05,695 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 18:30:05,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 18:30:05,705 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 18:30:05,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 18:30:05,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 18:30:05,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 18:30:05,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 18:30:05,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 18:30:05,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 18:30:05,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 18:30:05,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 18:30:05,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 18:30:05,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 18:30:05,736 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 18:30:05,737 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 18:30:05,739 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 18:30:05,740 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 18:30:05,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 18:30:05,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 18:30:05,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 18:30:05,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 18:30:05,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 18:30:05,745 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 18:30:05,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 18:30:05,747 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-13 18:30:05,794 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 18:30:05,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 18:30:05,798 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-13 18:30:05,798 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-13 18:30:05,806 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 18:30:05,807 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 18:30:05,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-13 18:30:05,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-13 18:30:05,808 INFO L138 SettingsManager]: * Use SBE=true [2021-11-13 18:30:05,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 18:30:05,809 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 18:30:05,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 18:30:05,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 18:30:05,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 18:30:05,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 18:30:05,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 18:30:05,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 18:30:05,811 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 18:30:05,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 18:30:05,812 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 18:30:05,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 18:30:05,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 18:30:05,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 18:30:05,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 18:30:05,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 18:30:05,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 18:30:05,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 18:30:05,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 18:30:05,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-13 18:30:05,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-13 18:30:05,814 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-13 18:30:05,815 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-13 18:30:05,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 18:30:05,815 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 18:30:05,816 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_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/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_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y 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 -> 4ed4cbcf73a390a7811d007883e420d1e9d8d4b9f5e59201847b4262dc4b0025 [2021-11-13 18:30:06,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 18:30:06,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 18:30:06,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 18:30:06,252 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 18:30:06,254 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 18:30:06,256 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/../../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2021-11-13 18:30:06,332 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/data/2efd40262/2ead14c5d52b480d9566cb039aff4b2f/FLAGb85969493 [2021-11-13 18:30:06,864 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 18:30:06,865 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2021-11-13 18:30:06,879 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/data/2efd40262/2ead14c5d52b480d9566cb039aff4b2f/FLAGb85969493 [2021-11-13 18:30:07,183 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/data/2efd40262/2ead14c5d52b480d9566cb039aff4b2f [2021-11-13 18:30:07,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 18:30:07,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 18:30:07,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 18:30:07,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 18:30:07,199 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 18:30:07,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:30:07" (1/1) ... [2021-11-13 18:30:07,202 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70638034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:30:07, skipping insertion in model container [2021-11-13 18:30:07,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 06:30:07" (1/1) ... [2021-11-13 18:30:07,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 18:30:07,240 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 18:30:07,470 WARN L228 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_5935862e-f09a-4cf9-b690-de4e292c7944/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c[2950,2963] [2021-11-13 18:30:07,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 18:30:07,483 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 18:30:07,510 WARN L228 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_5935862e-f09a-4cf9-b690-de4e292c7944/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c[2950,2963] [2021-11-13 18:30:07,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 18:30:07,531 INFO L208 MainTranslator]: Completed translation [2021-11-13 18:30:07,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:30:07 WrapperNode [2021-11-13 18:30:07,538 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 18:30:07,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 18:30:07,539 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 18:30:07,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 18:30:07,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:30:07" (1/1) ... [2021-11-13 18:30:07,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:30:07" (1/1) ... [2021-11-13 18:30:07,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 18:30:07,609 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 18:30:07,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 18:30:07,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 18:30:07,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:30:07" (1/1) ... [2021-11-13 18:30:07,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:30:07" (1/1) ... [2021-11-13 18:30:07,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:30:07" (1/1) ... [2021-11-13 18:30:07,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:30:07" (1/1) ... [2021-11-13 18:30:07,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:30:07" (1/1) ... [2021-11-13 18:30:07,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:30:07" (1/1) ... [2021-11-13 18:30:07,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:30:07" (1/1) ... [2021-11-13 18:30:07,667 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 18:30:07,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 18:30:07,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 18:30:07,668 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 18:30:07,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:30:07" (1/1) ... [2021-11-13 18:30:07,685 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 18:30:07,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:30:07,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 18:30:07,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 18:30:07,770 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-11-13 18:30:07,770 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-11-13 18:30:07,770 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-11-13 18:30:07,770 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-11-13 18:30:07,771 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-11-13 18:30:07,771 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-11-13 18:30:07,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 18:30:07,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 18:30:07,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-13 18:30:07,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-11-13 18:30:07,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-11-13 18:30:07,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 18:30:07,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 18:30:07,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-13 18:30:07,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-13 18:30:07,774 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-13 18:30:08,277 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 18:30:08,277 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-13 18:30:08,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:30:08 BoogieIcfgContainer [2021-11-13 18:30:08,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 18:30:08,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 18:30:08,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 18:30:08,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 18:30:08,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 06:30:07" (1/3) ... [2021-11-13 18:30:08,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ba2b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:30:08, skipping insertion in model container [2021-11-13 18:30:08,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 06:30:07" (2/3) ... [2021-11-13 18:30:08,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59ba2b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 06:30:08, skipping insertion in model container [2021-11-13 18:30:08,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:30:08" (3/3) ... [2021-11-13 18:30:08,293 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2021-11-13 18:30:08,298 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-13 18:30:08,299 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 18:30:08,299 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-13 18:30:08,299 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-13 18:30:08,362 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,363 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,363 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,363 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,363 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,364 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,364 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,365 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,365 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,365 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,368 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,368 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,368 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,369 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,369 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,369 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,370 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,371 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,371 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,371 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,372 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,372 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,373 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,373 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,375 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,377 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,378 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,379 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,379 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,379 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,379 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,390 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,394 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,394 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~lv_assert~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,394 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,395 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,395 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,396 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,396 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_~lv_assert~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,397 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 18:30:08,407 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-11-13 18:30:08,481 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 18:30:08,492 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-13 18:30:08,492 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-11-13 18:30:08,513 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 105 transitions, 234 flow [2021-11-13 18:30:08,611 INFO L129 PetriNetUnfolder]: 7/102 cut-off events. [2021-11-13 18:30:08,611 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-13 18:30:08,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 102 events. 7/102 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2021-11-13 18:30:08,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 105 transitions, 234 flow [2021-11-13 18:30:08,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 91 transitions, 200 flow [2021-11-13 18:30:08,666 INFO L129 PetriNetUnfolder]: 7/90 cut-off events. [2021-11-13 18:30:08,666 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-11-13 18:30:08,667 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:08,667 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:30:08,668 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:08,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:08,677 INFO L85 PathProgramCache]: Analyzing trace with hash 237529111, now seen corresponding path program 1 times [2021-11-13 18:30:08,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:08,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102688633] [2021-11-13 18:30:08,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:08,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:09,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:09,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:09,006 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102688633] [2021-11-13 18:30:09,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102688633] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:30:09,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:30:09,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-13 18:30:09,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246354076] [2021-11-13 18:30:09,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:30:09,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-13 18:30:09,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:09,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-13 18:30:09,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-13 18:30:09,111 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 105 [2021-11-13 18:30:09,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 200 flow. Second operand has 2 states, 2 states have (on average 97.0) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:09,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:09,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 105 [2021-11-13 18:30:09,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:09,218 INFO L129 PetriNetUnfolder]: 13/115 cut-off events. [2021-11-13 18:30:09,219 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-11-13 18:30:09,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 115 events. 13/115 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 160 event pairs, 2 based on Foata normal form. 11/115 useless extension candidates. Maximal degree in co-relation 100. Up to 20 conditions per place. [2021-11-13 18:30:09,227 INFO L132 encePairwiseOnDemand]: 102/105 looper letters, 8 selfloop transitions, 0 changer transitions 1/88 dead transitions. [2021-11-13 18:30:09,227 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 88 transitions, 210 flow [2021-11-13 18:30:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 18:30:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-11-13 18:30:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2021-11-13 18:30:09,246 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9380952380952381 [2021-11-13 18:30:09,246 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 197 transitions. [2021-11-13 18:30:09,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 197 transitions. [2021-11-13 18:30:09,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:09,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 197 transitions. [2021-11-13 18:30:09,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:09,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:09,279 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:09,281 INFO L186 Difference]: Start difference. First operand has 94 places, 91 transitions, 200 flow. Second operand 2 states and 197 transitions. [2021-11-13 18:30:09,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 88 transitions, 210 flow [2021-11-13 18:30:09,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 198 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-11-13 18:30:09,290 INFO L242 Difference]: Finished difference. Result has 89 places, 87 transitions, 180 flow [2021-11-13 18:30:09,296 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=180, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2021-11-13 18:30:09,301 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, -5 predicate places. [2021-11-13 18:30:09,302 INFO L470 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 180 flow [2021-11-13 18:30:09,302 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.0) internal successors, (194), 2 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:09,302 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:09,303 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:30:09,303 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-13 18:30:09,304 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:09,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:09,305 INFO L85 PathProgramCache]: Analyzing trace with hash -771818347, now seen corresponding path program 1 times [2021-11-13 18:30:09,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:09,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723354769] [2021-11-13 18:30:09,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:09,306 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:09,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:09,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:09,722 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723354769] [2021-11-13 18:30:09,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723354769] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:30:09,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:30:09,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 18:30:09,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999691307] [2021-11-13 18:30:09,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:30:09,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 18:30:09,727 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:09,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 18:30:09,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-13 18:30:09,732 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2021-11-13 18:30:09,733 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:09,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:09,734 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2021-11-13 18:30:09,734 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:09,986 INFO L129 PetriNetUnfolder]: 79/268 cut-off events. [2021-11-13 18:30:09,987 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-11-13 18:30:09,989 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 268 events. 79/268 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 949 event pairs, 9 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 402. Up to 53 conditions per place. [2021-11-13 18:30:09,992 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 30 selfloop transitions, 6 changer transitions 0/102 dead transitions. [2021-11-13 18:30:09,992 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 102 transitions, 285 flow [2021-11-13 18:30:09,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 18:30:09,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-13 18:30:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 511 transitions. [2021-11-13 18:30:09,999 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8111111111111111 [2021-11-13 18:30:09,999 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 511 transitions. [2021-11-13 18:30:09,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 511 transitions. [2021-11-13 18:30:10,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:10,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 511 transitions. [2021-11-13 18:30:10,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:10,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:10,008 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:10,008 INFO L186 Difference]: Start difference. First operand has 89 places, 87 transitions, 180 flow. Second operand 6 states and 511 transitions. [2021-11-13 18:30:10,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 102 transitions, 285 flow [2021-11-13 18:30:10,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 102 transitions, 285 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-13 18:30:10,013 INFO L242 Difference]: Finished difference. Result has 95 places, 89 transitions, 205 flow [2021-11-13 18:30:10,014 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=95, PETRI_TRANSITIONS=89} [2021-11-13 18:30:10,015 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 1 predicate places. [2021-11-13 18:30:10,017 INFO L470 AbstractCegarLoop]: Abstraction has has 95 places, 89 transitions, 205 flow [2021-11-13 18:30:10,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:10,018 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:10,019 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:30:10,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-13 18:30:10,019 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:10,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:10,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1417648341, now seen corresponding path program 2 times [2021-11-13 18:30:10,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:10,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87448529] [2021-11-13 18:30:10,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:10,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:10,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:10,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87448529] [2021-11-13 18:30:10,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87448529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:30:10,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:30:10,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-13 18:30:10,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895838586] [2021-11-13 18:30:10,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:30:10,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-13 18:30:10,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:10,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-13 18:30:10,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-13 18:30:10,326 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2021-11-13 18:30:10,327 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 89 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:10,327 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:10,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2021-11-13 18:30:10,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:10,551 INFO L129 PetriNetUnfolder]: 64/245 cut-off events. [2021-11-13 18:30:10,551 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2021-11-13 18:30:10,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 245 events. 64/245 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 838 event pairs, 12 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 399. Up to 46 conditions per place. [2021-11-13 18:30:10,558 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 27 selfloop transitions, 8 changer transitions 0/101 dead transitions. [2021-11-13 18:30:10,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 101 transitions, 311 flow [2021-11-13 18:30:10,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 18:30:10,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-11-13 18:30:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 508 transitions. [2021-11-13 18:30:10,563 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8063492063492064 [2021-11-13 18:30:10,563 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 508 transitions. [2021-11-13 18:30:10,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 508 transitions. [2021-11-13 18:30:10,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:10,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 508 transitions. [2021-11-13 18:30:10,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:10,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:10,570 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:10,571 INFO L186 Difference]: Start difference. First operand has 95 places, 89 transitions, 205 flow. Second operand 6 states and 508 transitions. [2021-11-13 18:30:10,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 101 transitions, 311 flow [2021-11-13 18:30:10,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 302 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-13 18:30:10,581 INFO L242 Difference]: Finished difference. Result has 99 places, 92 transitions, 235 flow [2021-11-13 18:30:10,582 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=99, PETRI_TRANSITIONS=92} [2021-11-13 18:30:10,584 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 5 predicate places. [2021-11-13 18:30:10,585 INFO L470 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 235 flow [2021-11-13 18:30:10,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 81.66666666666667) internal successors, (490), 6 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:10,586 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:10,587 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:30:10,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-13 18:30:10,592 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:10,592 INFO L85 PathProgramCache]: Analyzing trace with hash 411281951, now seen corresponding path program 3 times [2021-11-13 18:30:10,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:10,593 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759220379] [2021-11-13 18:30:10,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:10,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:10,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:10,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759220379] [2021-11-13 18:30:10,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759220379] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:30:10,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:30:10,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 18:30:10,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117876742] [2021-11-13 18:30:10,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:30:10,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 18:30:10,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:10,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 18:30:10,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-13 18:30:10,943 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2021-11-13 18:30:10,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 235 flow. Second operand has 7 states, 7 states have (on average 81.28571428571429) internal successors, (569), 7 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:10,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:10,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2021-11-13 18:30:10,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:11,109 INFO L129 PetriNetUnfolder]: 60/211 cut-off events. [2021-11-13 18:30:11,109 INFO L130 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2021-11-13 18:30:11,111 INFO L84 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 211 events. 60/211 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 621 event pairs, 1 based on Foata normal form. 2/191 useless extension candidates. Maximal degree in co-relation 393. Up to 46 conditions per place. [2021-11-13 18:30:11,113 INFO L132 encePairwiseOnDemand]: 97/105 looper letters, 28 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2021-11-13 18:30:11,113 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 104 transitions, 343 flow [2021-11-13 18:30:11,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 18:30:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-13 18:30:11,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 590 transitions. [2021-11-13 18:30:11,116 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8027210884353742 [2021-11-13 18:30:11,117 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 590 transitions. [2021-11-13 18:30:11,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 590 transitions. [2021-11-13 18:30:11,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:11,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 590 transitions. [2021-11-13 18:30:11,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:11,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:11,124 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:11,124 INFO L186 Difference]: Start difference. First operand has 99 places, 92 transitions, 235 flow. Second operand 7 states and 590 transitions. [2021-11-13 18:30:11,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 104 transitions, 343 flow [2021-11-13 18:30:11,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 104 transitions, 334 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-11-13 18:30:11,131 INFO L242 Difference]: Finished difference. Result has 104 places, 94 transitions, 265 flow [2021-11-13 18:30:11,132 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=265, PETRI_PLACES=104, PETRI_TRANSITIONS=94} [2021-11-13 18:30:11,134 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 10 predicate places. [2021-11-13 18:30:11,134 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 94 transitions, 265 flow [2021-11-13 18:30:11,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.28571428571429) internal successors, (569), 7 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:11,136 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:11,136 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:30:11,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-13 18:30:11,136 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:11,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:11,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1786478961, now seen corresponding path program 4 times [2021-11-13 18:30:11,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:11,140 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672068739] [2021-11-13 18:30:11,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:11,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:11,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:11,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672068739] [2021-11-13 18:30:11,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672068739] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:30:11,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:30:11,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-13 18:30:11,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917089988] [2021-11-13 18:30:11,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:30:11,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-13 18:30:11,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:11,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-13 18:30:11,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-13 18:30:11,346 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2021-11-13 18:30:11,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 94 transitions, 265 flow. Second operand has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:11,347 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:11,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2021-11-13 18:30:11,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:11,682 INFO L129 PetriNetUnfolder]: 224/620 cut-off events. [2021-11-13 18:30:11,682 INFO L130 PetriNetUnfolder]: For 360/360 co-relation queries the response was YES. [2021-11-13 18:30:11,685 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 620 events. 224/620 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3300 event pairs, 41 based on Foata normal form. 6/574 useless extension candidates. Maximal degree in co-relation 1258. Up to 157 conditions per place. [2021-11-13 18:30:11,690 INFO L132 encePairwiseOnDemand]: 94/105 looper letters, 35 selfloop transitions, 7 changer transitions 38/142 dead transitions. [2021-11-13 18:30:11,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 142 transitions, 598 flow [2021-11-13 18:30:11,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 18:30:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-13 18:30:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 748 transitions. [2021-11-13 18:30:11,694 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7915343915343915 [2021-11-13 18:30:11,694 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 748 transitions. [2021-11-13 18:30:11,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 748 transitions. [2021-11-13 18:30:11,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:11,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 748 transitions. [2021-11-13 18:30:11,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.11111111111111) internal successors, (748), 9 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:11,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:11,701 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:11,702 INFO L186 Difference]: Start difference. First operand has 104 places, 94 transitions, 265 flow. Second operand 9 states and 748 transitions. [2021-11-13 18:30:11,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 142 transitions, 598 flow [2021-11-13 18:30:11,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 142 transitions, 582 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-11-13 18:30:11,713 INFO L242 Difference]: Finished difference. Result has 113 places, 95 transitions, 299 flow [2021-11-13 18:30:11,714 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=299, PETRI_PLACES=113, PETRI_TRANSITIONS=95} [2021-11-13 18:30:11,717 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 19 predicate places. [2021-11-13 18:30:11,717 INFO L470 AbstractCegarLoop]: Abstraction has has 113 places, 95 transitions, 299 flow [2021-11-13 18:30:11,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 77.57142857142857) internal successors, (543), 7 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:11,718 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:11,718 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 18:30:11,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-13 18:30:11,719 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:11,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash -2074634458, now seen corresponding path program 1 times [2021-11-13 18:30:11,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:11,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629191251] [2021-11-13 18:30:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:11,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:11,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:11,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:11,845 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629191251] [2021-11-13 18:30:11,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629191251] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:30:11,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:30:11,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 18:30:11,846 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510604219] [2021-11-13 18:30:11,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:30:11,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 18:30:11,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:11,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 18:30:11,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 18:30:11,848 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2021-11-13 18:30:11,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 95 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:11,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:11,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2021-11-13 18:30:11,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:12,083 INFO L129 PetriNetUnfolder]: 242/632 cut-off events. [2021-11-13 18:30:12,083 INFO L130 PetriNetUnfolder]: For 671/671 co-relation queries the response was YES. [2021-11-13 18:30:12,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 632 events. 242/632 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3194 event pairs, 5 based on Foata normal form. 15/592 useless extension candidates. Maximal degree in co-relation 1509. Up to 125 conditions per place. [2021-11-13 18:30:12,094 INFO L132 encePairwiseOnDemand]: 96/105 looper letters, 51 selfloop transitions, 22 changer transitions 1/142 dead transitions. [2021-11-13 18:30:12,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 142 transitions, 684 flow [2021-11-13 18:30:12,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 18:30:12,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-11-13 18:30:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 632 transitions. [2021-11-13 18:30:12,098 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8598639455782313 [2021-11-13 18:30:12,098 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 632 transitions. [2021-11-13 18:30:12,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 632 transitions. [2021-11-13 18:30:12,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:12,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 632 transitions. [2021-11-13 18:30:12,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:12,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:12,105 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 105.0) internal successors, (840), 8 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:12,105 INFO L186 Difference]: Start difference. First operand has 113 places, 95 transitions, 299 flow. Second operand 7 states and 632 transitions. [2021-11-13 18:30:12,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 142 transitions, 684 flow [2021-11-13 18:30:12,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 142 transitions, 658 flow, removed 8 selfloop flow, removed 5 redundant places. [2021-11-13 18:30:12,116 INFO L242 Difference]: Finished difference. Result has 116 places, 113 transitions, 504 flow [2021-11-13 18:30:12,116 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=504, PETRI_PLACES=116, PETRI_TRANSITIONS=113} [2021-11-13 18:30:12,117 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 22 predicate places. [2021-11-13 18:30:12,117 INFO L470 AbstractCegarLoop]: Abstraction has has 116 places, 113 transitions, 504 flow [2021-11-13 18:30:12,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:12,118 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:12,118 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 18:30:12,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-13 18:30:12,119 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:12,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:12,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1048037250, now seen corresponding path program 2 times [2021-11-13 18:30:12,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:12,120 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414085970] [2021-11-13 18:30:12,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:12,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:12,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:12,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414085970] [2021-11-13 18:30:12,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414085970] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:30:12,262 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:30:12,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 18:30:12,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862451373] [2021-11-13 18:30:12,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:30:12,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 18:30:12,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:12,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 18:30:12,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 18:30:12,269 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2021-11-13 18:30:12,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 113 transitions, 504 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:12,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:12,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2021-11-13 18:30:12,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:12,651 INFO L129 PetriNetUnfolder]: 414/1064 cut-off events. [2021-11-13 18:30:12,651 INFO L130 PetriNetUnfolder]: For 2505/2507 co-relation queries the response was YES. [2021-11-13 18:30:12,658 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3275 conditions, 1064 events. 414/1064 cut-off events. For 2505/2507 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6429 event pairs, 3 based on Foata normal form. 12/985 useless extension candidates. Maximal degree in co-relation 3257. Up to 173 conditions per place. [2021-11-13 18:30:12,670 INFO L132 encePairwiseOnDemand]: 96/105 looper letters, 82 selfloop transitions, 44 changer transitions 0/194 dead transitions. [2021-11-13 18:30:12,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 194 transitions, 1355 flow [2021-11-13 18:30:12,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 18:30:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-13 18:30:12,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 812 transitions. [2021-11-13 18:30:12,674 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8592592592592593 [2021-11-13 18:30:12,674 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 812 transitions. [2021-11-13 18:30:12,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 812 transitions. [2021-11-13 18:30:12,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:12,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 812 transitions. [2021-11-13 18:30:12,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.22222222222223) internal successors, (812), 9 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:12,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:12,681 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:12,682 INFO L186 Difference]: Start difference. First operand has 116 places, 113 transitions, 504 flow. Second operand 9 states and 812 transitions. [2021-11-13 18:30:12,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 194 transitions, 1355 flow [2021-11-13 18:30:12,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 194 transitions, 1355 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-11-13 18:30:12,701 INFO L242 Difference]: Finished difference. Result has 130 places, 141 transitions, 960 flow [2021-11-13 18:30:12,702 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=960, PETRI_PLACES=130, PETRI_TRANSITIONS=141} [2021-11-13 18:30:12,702 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 36 predicate places. [2021-11-13 18:30:12,702 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 141 transitions, 960 flow [2021-11-13 18:30:12,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:12,703 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:12,703 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 18:30:12,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-13 18:30:12,704 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:12,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1733351978, now seen corresponding path program 3 times [2021-11-13 18:30:12,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:12,705 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812939134] [2021-11-13 18:30:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:12,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:12,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:12,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:12,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812939134] [2021-11-13 18:30:12,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812939134] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:30:12,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:30:12,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 18:30:12,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951855325] [2021-11-13 18:30:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:30:12,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 18:30:12,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:12,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 18:30:12,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-13 18:30:12,855 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2021-11-13 18:30:12,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 141 transitions, 960 flow. Second operand has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:12,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:12,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2021-11-13 18:30:12,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:13,394 INFO L129 PetriNetUnfolder]: 770/1833 cut-off events. [2021-11-13 18:30:13,394 INFO L130 PetriNetUnfolder]: For 9138/9195 co-relation queries the response was YES. [2021-11-13 18:30:13,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7206 conditions, 1833 events. 770/1833 cut-off events. For 9138/9195 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12727 event pairs, 46 based on Foata normal form. 35/1726 useless extension candidates. Maximal degree in co-relation 7181. Up to 453 conditions per place. [2021-11-13 18:30:13,430 INFO L132 encePairwiseOnDemand]: 96/105 looper letters, 113 selfloop transitions, 75 changer transitions 30/286 dead transitions. [2021-11-13 18:30:13,430 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 286 transitions, 2973 flow [2021-11-13 18:30:13,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 18:30:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-11-13 18:30:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 810 transitions. [2021-11-13 18:30:13,434 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2021-11-13 18:30:13,434 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 810 transitions. [2021-11-13 18:30:13,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 810 transitions. [2021-11-13 18:30:13,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:13,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 810 transitions. [2021-11-13 18:30:13,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 90.0) internal successors, (810), 9 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:13,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:13,442 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 105.0) internal successors, (1050), 10 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:13,443 INFO L186 Difference]: Start difference. First operand has 130 places, 141 transitions, 960 flow. Second operand 9 states and 810 transitions. [2021-11-13 18:30:13,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 286 transitions, 2973 flow [2021-11-13 18:30:13,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 286 transitions, 2933 flow, removed 20 selfloop flow, removed 0 redundant places. [2021-11-13 18:30:13,494 INFO L242 Difference]: Finished difference. Result has 146 places, 193 transitions, 1992 flow [2021-11-13 18:30:13,494 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1992, PETRI_PLACES=146, PETRI_TRANSITIONS=193} [2021-11-13 18:30:13,495 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 52 predicate places. [2021-11-13 18:30:13,495 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 193 transitions, 1992 flow [2021-11-13 18:30:13,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:13,496 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:13,496 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 18:30:13,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-13 18:30:13,497 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:13,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:13,497 INFO L85 PathProgramCache]: Analyzing trace with hash 266266506, now seen corresponding path program 4 times [2021-11-13 18:30:13,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:13,498 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665675896] [2021-11-13 18:30:13,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:13,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:13,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:13,575 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665675896] [2021-11-13 18:30:13,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665675896] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:30:13,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:30:13,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 18:30:13,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766303707] [2021-11-13 18:30:13,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:30:13,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 18:30:13,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:13,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 18:30:13,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-13 18:30:13,579 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2021-11-13 18:30:13,580 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 193 transitions, 1992 flow. Second operand has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:13,580 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:13,581 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2021-11-13 18:30:13,581 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:13,747 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([247] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork1_~lv_assert~0_5 256) 0)) InVars {thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} OutVars{thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} AuxVars[] AssignedVars[][95], [Black: 175#true, 111#true, 56#L83true, Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 7#L46true, Black: 140#true, 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 158#(<= 0 ~pos~0), 150#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 25#L110-4true, 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 238#true, Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2021-11-13 18:30:13,748 INFO L384 tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event [2021-11-13 18:30:13,748 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-11-13 18:30:13,748 INFO L387 tUnfolder$Statistics]: existing Event has 57 ancestors and is cut-off event [2021-11-13 18:30:13,748 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-11-13 18:30:13,907 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= v_~v_assert~0_5 (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1)) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][117], [Black: 175#true, 111#true, 30#L59true, Black: 136#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 56#L83true, Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 140#true, 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 158#(<= 0 ~pos~0), 5#L111-4true, 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 28#L92true, 238#true, Black: 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2021-11-13 18:30:13,908 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2021-11-13 18:30:13,908 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-11-13 18:30:13,908 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-11-13 18:30:13,908 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-11-13 18:30:13,909 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([247] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork1_~lv_assert~0_5 256) 0)) InVars {thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} OutVars{thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} AuxVars[] AssignedVars[][95], [Black: 175#true, 111#true, 56#L83true, Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 7#L46true, Black: 140#true, 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, 73#thread3ENTRYtrue, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 158#(<= 0 ~pos~0), 150#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 5#L111-4true, 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 238#true, Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2021-11-13 18:30:13,909 INFO L384 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2021-11-13 18:30:13,909 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-11-13 18:30:13,909 INFO L387 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2021-11-13 18:30:13,910 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2021-11-13 18:30:14,039 INFO L129 PetriNetUnfolder]: 514/1577 cut-off events. [2021-11-13 18:30:14,039 INFO L130 PetriNetUnfolder]: For 11095/11792 co-relation queries the response was YES. [2021-11-13 18:30:14,058 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6463 conditions, 1577 events. 514/1577 cut-off events. For 11095/11792 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12409 event pairs, 54 based on Foata normal form. 64/1514 useless extension candidates. Maximal degree in co-relation 6430. Up to 248 conditions per place. [2021-11-13 18:30:14,077 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 20 selfloop transitions, 5 changer transitions 0/193 dead transitions. [2021-11-13 18:30:14,077 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 193 transitions, 1953 flow [2021-11-13 18:30:14,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 18:30:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-13 18:30:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2021-11-13 18:30:14,080 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8380952380952381 [2021-11-13 18:30:14,080 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 440 transitions. [2021-11-13 18:30:14,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 440 transitions. [2021-11-13 18:30:14,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:14,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 440 transitions. [2021-11-13 18:30:14,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:14,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:14,085 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:14,085 INFO L186 Difference]: Start difference. First operand has 146 places, 193 transitions, 1992 flow. Second operand 5 states and 440 transitions. [2021-11-13 18:30:14,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 193 transitions, 1953 flow [2021-11-13 18:30:14,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 193 transitions, 1913 flow, removed 20 selfloop flow, removed 0 redundant places. [2021-11-13 18:30:14,161 INFO L242 Difference]: Finished difference. Result has 152 places, 188 transitions, 1870 flow [2021-11-13 18:30:14,162 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1870, PETRI_PLACES=152, PETRI_TRANSITIONS=188} [2021-11-13 18:30:14,163 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 58 predicate places. [2021-11-13 18:30:14,163 INFO L470 AbstractCegarLoop]: Abstraction has has 152 places, 188 transitions, 1870 flow [2021-11-13 18:30:14,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:14,164 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:14,164 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-13 18:30:14,164 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-13 18:30:14,165 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:14,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:14,165 INFO L85 PathProgramCache]: Analyzing trace with hash 398857980, now seen corresponding path program 1 times [2021-11-13 18:30:14,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:14,166 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91315348] [2021-11-13 18:30:14,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:14,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:14,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:14,284 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91315348] [2021-11-13 18:30:14,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91315348] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:30:14,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:30:14,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-13 18:30:14,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332749131] [2021-11-13 18:30:14,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:30:14,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-13 18:30:14,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:14,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-13 18:30:14,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-13 18:30:14,287 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 105 [2021-11-13 18:30:14,288 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 188 transitions, 1870 flow. Second operand has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:14,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:14,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 105 [2021-11-13 18:30:14,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:14,816 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= v_~v_assert~0_5 (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1)) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][123], [Black: 175#true, 30#L59true, 111#true, Black: 136#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 49#L78true, Black: 140#true, 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 248#true, 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 158#(<= 0 ~pos~0), 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 5#L111-4true, 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 28#L92true, 238#true, Black: 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2021-11-13 18:30:14,816 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2021-11-13 18:30:14,816 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-11-13 18:30:14,816 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-11-13 18:30:14,817 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-11-13 18:30:14,868 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= v_~v_assert~0_5 (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1)) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][123], [Black: 175#true, 30#L59true, 111#true, Black: 136#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 49#L78true, Black: 140#true, 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 248#true, 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 158#(<= 0 ~pos~0), 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 5#L111-4true, 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 28#L92true, Black: 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 238#true, Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2021-11-13 18:30:14,869 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2021-11-13 18:30:14,869 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-11-13 18:30:14,869 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-11-13 18:30:14,869 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-11-13 18:30:14,869 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-11-13 18:30:14,885 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= v_~v_assert~0_5 (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1)) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][123], [Black: 175#true, 111#true, 30#L59true, Black: 136#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 140#true, 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 248#true, 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), 36#L70true, Black: 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 158#(<= 0 ~pos~0), 5#L111-4true, 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 28#L92true, 238#true, Black: 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2021-11-13 18:30:14,885 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is not cut-off event [2021-11-13 18:30:14,886 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2021-11-13 18:30:14,886 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2021-11-13 18:30:14,886 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2021-11-13 18:30:14,921 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([268] thread3ENTRY-->L92: Formula: (= v_~v_assert~0_5 (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1)) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0][123], [Black: 175#true, 111#true, 30#L59true, Black: 136#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 49#L78true, Black: 140#true, 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 248#true, 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 158#(<= 0 ~pos~0), 5#L111-4true, 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), 28#L92true, 238#true, Black: 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2021-11-13 18:30:14,921 INFO L384 tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event [2021-11-13 18:30:14,921 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-11-13 18:30:14,921 INFO L387 tUnfolder$Statistics]: existing Event has 66 ancestors and is cut-off event [2021-11-13 18:30:14,922 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-11-13 18:30:14,922 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-11-13 18:30:14,922 INFO L387 tUnfolder$Statistics]: existing Event has 71 ancestors and is cut-off event [2021-11-13 18:30:15,079 INFO L129 PetriNetUnfolder]: 909/2760 cut-off events. [2021-11-13 18:30:15,079 INFO L130 PetriNetUnfolder]: For 15791/16029 co-relation queries the response was YES. [2021-11-13 18:30:15,115 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10247 conditions, 2760 events. 909/2760 cut-off events. For 15791/16029 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 24206 event pairs, 180 based on Foata normal form. 45/2608 useless extension candidates. Maximal degree in co-relation 10212. Up to 540 conditions per place. [2021-11-13 18:30:15,146 INFO L132 encePairwiseOnDemand]: 99/105 looper letters, 22 selfloop transitions, 5 changer transitions 0/197 dead transitions. [2021-11-13 18:30:15,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 197 transitions, 1954 flow [2021-11-13 18:30:15,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-13 18:30:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-11-13 18:30:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 441 transitions. [2021-11-13 18:30:15,149 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.84 [2021-11-13 18:30:15,150 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 441 transitions. [2021-11-13 18:30:15,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 441 transitions. [2021-11-13 18:30:15,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:15,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 441 transitions. [2021-11-13 18:30:15,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:15,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:15,155 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:15,155 INFO L186 Difference]: Start difference. First operand has 152 places, 188 transitions, 1870 flow. Second operand 5 states and 441 transitions. [2021-11-13 18:30:15,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 197 transitions, 1954 flow [2021-11-13 18:30:15,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 197 transitions, 1950 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-13 18:30:15,257 INFO L242 Difference]: Finished difference. Result has 156 places, 190 transitions, 1892 flow [2021-11-13 18:30:15,258 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1866, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1892, PETRI_PLACES=156, PETRI_TRANSITIONS=190} [2021-11-13 18:30:15,259 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 62 predicate places. [2021-11-13 18:30:15,259 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 190 transitions, 1892 flow [2021-11-13 18:30:15,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.8) internal successors, (429), 5 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:15,260 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:15,260 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:30:15,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-13 18:30:15,260 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:15,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:15,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1142839705, now seen corresponding path program 1 times [2021-11-13 18:30:15,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:15,267 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81237956] [2021-11-13 18:30:15,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:15,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:15,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:15,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:15,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81237956] [2021-11-13 18:30:15,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81237956] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:30:15,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377055516] [2021-11-13 18:30:15,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:15,425 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:30:15,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:30:15,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:30:15,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-13 18:30:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:15,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-13 18:30:15,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:30:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:16,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:30:16,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:16,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377055516] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:30:16,405 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:30:16,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2021-11-13 18:30:16,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366131435] [2021-11-13 18:30:16,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:30:16,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-13 18:30:16,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:16,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-13 18:30:16,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-13 18:30:16,411 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2021-11-13 18:30:16,413 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 190 transitions, 1892 flow. Second operand has 14 states, 14 states have (on average 77.64285714285714) internal successors, (1087), 14 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:16,413 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:16,413 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2021-11-13 18:30:16,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:18,506 INFO L129 PetriNetUnfolder]: 2420/6000 cut-off events. [2021-11-13 18:30:18,507 INFO L130 PetriNetUnfolder]: For 47366/47443 co-relation queries the response was YES. [2021-11-13 18:30:18,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27569 conditions, 6000 events. 2420/6000 cut-off events. For 47366/47443 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 56079 event pairs, 143 based on Foata normal form. 55/6002 useless extension candidates. Maximal degree in co-relation 27532. Up to 887 conditions per place. [2021-11-13 18:30:18,650 INFO L132 encePairwiseOnDemand]: 91/105 looper letters, 145 selfloop transitions, 156 changer transitions 103/488 dead transitions. [2021-11-13 18:30:18,650 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 488 transitions, 6447 flow [2021-11-13 18:30:18,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-13 18:30:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-11-13 18:30:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1717 transitions. [2021-11-13 18:30:18,658 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7786848072562358 [2021-11-13 18:30:18,658 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1717 transitions. [2021-11-13 18:30:18,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1717 transitions. [2021-11-13 18:30:18,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:18,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1717 transitions. [2021-11-13 18:30:18,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 81.76190476190476) internal successors, (1717), 21 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:18,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 105.0) internal successors, (2310), 22 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:18,675 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 105.0) internal successors, (2310), 22 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:18,675 INFO L186 Difference]: Start difference. First operand has 156 places, 190 transitions, 1892 flow. Second operand 21 states and 1717 transitions. [2021-11-13 18:30:18,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 488 transitions, 6447 flow [2021-11-13 18:30:18,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 488 transitions, 6443 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-11-13 18:30:18,995 INFO L242 Difference]: Finished difference. Result has 186 places, 307 transitions, 4032 flow [2021-11-13 18:30:18,996 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=1888, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4032, PETRI_PLACES=186, PETRI_TRANSITIONS=307} [2021-11-13 18:30:18,996 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 92 predicate places. [2021-11-13 18:30:18,996 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 307 transitions, 4032 flow [2021-11-13 18:30:18,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 77.64285714285714) internal successors, (1087), 14 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:18,997 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:18,998 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:30:19,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-13 18:30:19,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:30:19,211 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:19,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1871322637, now seen corresponding path program 1 times [2021-11-13 18:30:19,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:19,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469443800] [2021-11-13 18:30:19,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:19,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:19,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:19,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469443800] [2021-11-13 18:30:19,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469443800] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:30:19,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080462458] [2021-11-13 18:30:19,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:19,341 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:30:19,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:30:19,342 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:30:19,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-13 18:30:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:19,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-13 18:30:19,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:30:19,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:19,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:30:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:20,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080462458] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:30:20,062 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:30:20,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2021-11-13 18:30:20,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582262332] [2021-11-13 18:30:20,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:30:20,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-11-13 18:30:20,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:20,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-11-13 18:30:20,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-11-13 18:30:20,066 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2021-11-13 18:30:20,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 307 transitions, 4032 flow. Second operand has 14 states, 14 states have (on average 77.78571428571429) internal successors, (1089), 14 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:20,089 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:20,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2021-11-13 18:30:20,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:23,419 INFO L129 PetriNetUnfolder]: 3706/9300 cut-off events. [2021-11-13 18:30:23,419 INFO L130 PetriNetUnfolder]: For 109592/110028 co-relation queries the response was YES. [2021-11-13 18:30:23,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52354 conditions, 9300 events. 3706/9300 cut-off events. For 109592/110028 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 92377 event pairs, 193 based on Foata normal form. 168/9362 useless extension candidates. Maximal degree in co-relation 52304. Up to 1580 conditions per place. [2021-11-13 18:30:23,679 INFO L132 encePairwiseOnDemand]: 92/105 looper letters, 137 selfloop transitions, 181 changer transitions 294/696 dead transitions. [2021-11-13 18:30:23,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 696 transitions, 11218 flow [2021-11-13 18:30:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-11-13 18:30:23,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-11-13 18:30:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1722 transitions. [2021-11-13 18:30:23,688 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.780952380952381 [2021-11-13 18:30:23,688 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1722 transitions. [2021-11-13 18:30:23,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1722 transitions. [2021-11-13 18:30:23,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:23,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1722 transitions. [2021-11-13 18:30:23,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 82.0) internal successors, (1722), 21 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:23,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 105.0) internal successors, (2310), 22 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:23,708 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 105.0) internal successors, (2310), 22 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:23,708 INFO L186 Difference]: Start difference. First operand has 186 places, 307 transitions, 4032 flow. Second operand 21 states and 1722 transitions. [2021-11-13 18:30:23,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 696 transitions, 11218 flow [2021-11-13 18:30:24,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 696 transitions, 10886 flow, removed 125 selfloop flow, removed 5 redundant places. [2021-11-13 18:30:24,561 INFO L242 Difference]: Finished difference. Result has 211 places, 360 transitions, 5277 flow [2021-11-13 18:30:24,563 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=3875, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5277, PETRI_PLACES=211, PETRI_TRANSITIONS=360} [2021-11-13 18:30:24,564 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 117 predicate places. [2021-11-13 18:30:24,565 INFO L470 AbstractCegarLoop]: Abstraction has has 211 places, 360 transitions, 5277 flow [2021-11-13 18:30:24,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 77.78571428571429) internal successors, (1089), 14 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:24,565 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:24,566 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:30:24,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-13 18:30:24,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:30:24,779 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:24,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:24,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1427515022, now seen corresponding path program 2 times [2021-11-13 18:30:24,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:24,780 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130602635] [2021-11-13 18:30:24,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:24,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-13 18:30:24,844 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:24,844 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130602635] [2021-11-13 18:30:24,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130602635] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:30:24,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:30:24,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 18:30:24,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339618899] [2021-11-13 18:30:24,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:30:24,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 18:30:24,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:24,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 18:30:24,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 18:30:24,848 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 105 [2021-11-13 18:30:24,849 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 360 transitions, 5277 flow. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:24,849 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:24,849 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 105 [2021-11-13 18:30:24,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:25,763 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([247] L59-->L46: Formula: (not (= (mod v_thread1Thread1of1ForFork1_~lv_assert~0_5 256) 0)) InVars {thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} OutVars{thread1Thread1of1ForFork1_~lv_assert~0=v_thread1Thread1of1ForFork1_~lv_assert~0_5} AuxVars[] AssignedVars[][94], [Black: 252#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), 56#L83true, Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1347#true, Black: 775#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 787#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), Black: 773#(and (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 140#true, Black: 262#(<= 0 ~pos~0), Black: 777#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 785#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 767#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 263#(<= 1 ~pos~0), Black: 779#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 769#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 248#true, Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 158#(<= 0 ~pos~0), 150#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 25#L110-4true, Black: 1334#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1322#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1332#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), 238#true, Black: 808#(<= 2 ~pos~0), Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 1330#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1320#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 1328#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), Black: 1316#(and (<= 2 ~pos~0) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), Black: 175#true, Black: 1318#(and (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 0 ~pos~0)), 111#true, Black: 1324#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), 807#(<= 0 ~pos~0), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), 7#L46true, 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), 258#true, Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2021-11-13 18:30:25,763 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2021-11-13 18:30:25,763 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-11-13 18:30:25,763 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-11-13 18:30:25,763 INFO L387 tUnfolder$Statistics]: existing Event has 62 ancestors and is cut-off event [2021-11-13 18:30:26,484 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([253] L52-->L54: Formula: (= (+ v_~pos~0_23 1) v_~pos~0_24) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork1_#t~post4=|v_thread1Thread1of1ForFork1_#t~post4_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post4, ~pos~0][246], [Black: 252#(<= (+ (* 256 (div ~d2~0 256)) 1) ~d2~0), Black: 136#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 131#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), 1115#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), Black: 775#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 787#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 140#true, Black: 773#(and (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 262#(<= 0 ~pos~0), Black: 777#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), 228#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 785#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 767#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 263#(<= 1 ~pos~0), Black: 779#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 0 ~pos~0)), 570#(< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)), 248#true, Black: 769#(and (= ~pos~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), Black: 164#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 166#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 1 thread1Thread1of1ForFork1_~lv_assert~0) (<= (div thread1Thread1of1ForFork1_~lv_assert~0 256) 0) (<= 0 ~pos~0)), Black: 158#(<= 0 ~pos~0), 146#(<= (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) 1) thread1Thread1of1ForFork1_~lv_assert~0), 179#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 28#L92true, Black: 1334#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0)), Black: 1322#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1) (<= 0 ~pos~0)), Black: 1332#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 183#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 807#(<= 0 ~pos~0), 238#true, Black: 808#(<= 2 ~pos~0), Black: 177#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 1330#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (<= thread2Thread1of1ForFork2_~lv_assert~1 1) (<= 1 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 185#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 1320#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 1328#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 2 ~pos~0) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), Black: 181#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 175#true, Black: 1316#(and (<= 2 ~pos~0) (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256))), 111#true, Black: 1318#(and (< 0 (mod thread2Thread1of1ForFork2_~lv_assert~1 256)) (<= 0 ~pos~0)), Black: 1324#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= 0 ~pos~0)), 44#L54true, Black: 201#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 195#(= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0), Black: 199#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1))), Black: 196#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 203#(and (= thread1Thread1of1ForFork1_~lv_assert~0 ~v_assert~0) (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), 1349#(= (* 256 (div ~d1~0 256)) ~d1~0), 49#L78true, 205#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 221#(and (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 213#true, Black: 215#(= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1), Black: 216#(<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)), Black: 223#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 219#(and (<= (+ thread1Thread1of1ForFork1_~lv_assert~0 (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256))) (+ (* 256 (div thread1Thread1of1ForFork1_~lv_assert~0 256)) thread2Thread1of1ForFork2_~lv_assert~1)) (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1)), Black: 217#(<= (+ (* 256 (div thread2Thread1of1ForFork2_~lv_assert~1 256)) 1) thread2Thread1of1ForFork2_~lv_assert~1), 5#L111-4true, Black: 242#(<= (+ (* 256 (div ~d1~0 256)) 1) ~d1~0), Black: 123#(and (= ~v_assert~0 thread2Thread1of1ForFork2_~lv_assert~1) (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 118#(and (<= ~v_assert~0 (+ (* 256 (div ~v_assert~0 256)) 1)) (<= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0))]) [2021-11-13 18:30:26,485 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2021-11-13 18:30:26,485 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-11-13 18:30:26,485 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2021-11-13 18:30:26,485 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2021-11-13 18:30:26,624 INFO L129 PetriNetUnfolder]: 2008/6736 cut-off events. [2021-11-13 18:30:26,624 INFO L130 PetriNetUnfolder]: For 84386/85861 co-relation queries the response was YES. [2021-11-13 18:30:26,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37088 conditions, 6736 events. 2008/6736 cut-off events. For 84386/85861 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 72930 event pairs, 285 based on Foata normal form. 572/7130 useless extension candidates. Maximal degree in co-relation 37028. Up to 850 conditions per place. [2021-11-13 18:30:26,793 INFO L132 encePairwiseOnDemand]: 100/105 looper letters, 48 selfloop transitions, 5 changer transitions 5/346 dead transitions. [2021-11-13 18:30:26,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 346 transitions, 4999 flow [2021-11-13 18:30:26,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 18:30:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-11-13 18:30:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 379 transitions. [2021-11-13 18:30:26,799 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9023809523809524 [2021-11-13 18:30:26,799 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 379 transitions. [2021-11-13 18:30:26,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 379 transitions. [2021-11-13 18:30:26,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:26,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 379 transitions. [2021-11-13 18:30:26,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:26,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:26,803 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:26,803 INFO L186 Difference]: Start difference. First operand has 211 places, 360 transitions, 5277 flow. Second operand 4 states and 379 transitions. [2021-11-13 18:30:26,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 346 transitions, 4999 flow [2021-11-13 18:30:27,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 346 transitions, 4792 flow, removed 38 selfloop flow, removed 11 redundant places. [2021-11-13 18:30:27,442 INFO L242 Difference]: Finished difference. Result has 204 places, 329 transitions, 4554 flow [2021-11-13 18:30:27,443 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=4622, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4554, PETRI_PLACES=204, PETRI_TRANSITIONS=329} [2021-11-13 18:30:27,443 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 110 predicate places. [2021-11-13 18:30:27,443 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 329 transitions, 4554 flow [2021-11-13 18:30:27,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:27,444 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:27,444 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:30:27,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-13 18:30:27,445 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:27,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:27,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1468701142, now seen corresponding path program 2 times [2021-11-13 18:30:27,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:27,446 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208717282] [2021-11-13 18:30:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:27,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:27,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-13 18:30:27,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:27,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208717282] [2021-11-13 18:30:27,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208717282] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 18:30:27,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 18:30:27,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 18:30:27,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780661249] [2021-11-13 18:30:27,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 18:30:27,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 18:30:27,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:27,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 18:30:27,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 18:30:27,505 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 105 [2021-11-13 18:30:27,506 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 329 transitions, 4554 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:27,506 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:27,506 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 105 [2021-11-13 18:30:27,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:29,484 INFO L129 PetriNetUnfolder]: 2341/7077 cut-off events. [2021-11-13 18:30:29,485 INFO L130 PetriNetUnfolder]: For 84681/85595 co-relation queries the response was YES. [2021-11-13 18:30:29,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40175 conditions, 7077 events. 2341/7077 cut-off events. For 84681/85595 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 71343 event pairs, 432 based on Foata normal form. 484/7297 useless extension candidates. Maximal degree in co-relation 40117. Up to 987 conditions per place. [2021-11-13 18:30:29,614 INFO L132 encePairwiseOnDemand]: 100/105 looper letters, 57 selfloop transitions, 5 changer transitions 2/336 dead transitions. [2021-11-13 18:30:29,614 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 336 transitions, 4531 flow [2021-11-13 18:30:29,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 18:30:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-11-13 18:30:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2021-11-13 18:30:29,617 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9 [2021-11-13 18:30:29,617 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 378 transitions. [2021-11-13 18:30:29,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 378 transitions. [2021-11-13 18:30:29,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:29,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 378 transitions. [2021-11-13 18:30:29,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:29,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:29,621 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:29,621 INFO L186 Difference]: Start difference. First operand has 204 places, 329 transitions, 4554 flow. Second operand 4 states and 378 transitions. [2021-11-13 18:30:29,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 336 transitions, 4531 flow [2021-11-13 18:30:30,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 336 transitions, 4427 flow, removed 47 selfloop flow, removed 2 redundant places. [2021-11-13 18:30:30,154 INFO L242 Difference]: Finished difference. Result has 207 places, 313 transitions, 4140 flow [2021-11-13 18:30:30,155 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=4133, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4140, PETRI_PLACES=207, PETRI_TRANSITIONS=313} [2021-11-13 18:30:30,155 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 113 predicate places. [2021-11-13 18:30:30,155 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 313 transitions, 4140 flow [2021-11-13 18:30:30,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:30,156 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:30,156 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:30:30,157 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-13 18:30:30,157 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:30,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash 232289249, now seen corresponding path program 1 times [2021-11-13 18:30:30,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:30,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230686342] [2021-11-13 18:30:30,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:30,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:30,277 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:30,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230686342] [2021-11-13 18:30:30,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230686342] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:30:30,278 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368299579] [2021-11-13 18:30:30,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:30,279 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:30:30,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:30:30,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:30:30,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-13 18:30:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:30,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-13 18:30:30,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:30:30,740 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:30,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:30:31,033 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:31,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368299579] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:30:31,034 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:30:31,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2021-11-13 18:30:31,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143063204] [2021-11-13 18:30:31,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:30:31,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-13 18:30:31,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:31,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-13 18:30:31,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2021-11-13 18:30:31,038 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2021-11-13 18:30:31,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 313 transitions, 4140 flow. Second operand has 15 states, 15 states have (on average 77.86666666666666) internal successors, (1168), 15 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:31,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:31,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2021-11-13 18:30:31,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:34,622 INFO L129 PetriNetUnfolder]: 4070/10815 cut-off events. [2021-11-13 18:30:34,622 INFO L130 PetriNetUnfolder]: For 145828/146230 co-relation queries the response was YES. [2021-11-13 18:30:34,732 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66363 conditions, 10815 events. 4070/10815 cut-off events. For 145828/146230 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 111838 event pairs, 182 based on Foata normal form. 287/11042 useless extension candidates. Maximal degree in co-relation 66303. Up to 1607 conditions per place. [2021-11-13 18:30:34,807 INFO L132 encePairwiseOnDemand]: 92/105 looper letters, 149 selfloop transitions, 185 changer transitions 253/730 dead transitions. [2021-11-13 18:30:34,808 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 730 transitions, 11864 flow [2021-11-13 18:30:34,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-11-13 18:30:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-11-13 18:30:34,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2109 transitions. [2021-11-13 18:30:34,813 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7725274725274726 [2021-11-13 18:30:34,813 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2109 transitions. [2021-11-13 18:30:34,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2109 transitions. [2021-11-13 18:30:34,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:34,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2109 transitions. [2021-11-13 18:30:34,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 81.11538461538461) internal successors, (2109), 26 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:34,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 105.0) internal successors, (2835), 27 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:34,827 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 105.0) internal successors, (2835), 27 states have internal predecessors, (2835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:34,827 INFO L186 Difference]: Start difference. First operand has 207 places, 313 transitions, 4140 flow. Second operand 26 states and 2109 transitions. [2021-11-13 18:30:34,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 730 transitions, 11864 flow [2021-11-13 18:30:35,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 730 transitions, 11822 flow, removed 21 selfloop flow, removed 1 redundant places. [2021-11-13 18:30:35,849 INFO L242 Difference]: Finished difference. Result has 246 places, 399 transitions, 6013 flow [2021-11-13 18:30:35,850 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=4106, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=6013, PETRI_PLACES=246, PETRI_TRANSITIONS=399} [2021-11-13 18:30:35,850 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 152 predicate places. [2021-11-13 18:30:35,850 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 399 transitions, 6013 flow [2021-11-13 18:30:35,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 77.86666666666666) internal successors, (1168), 15 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:35,851 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:35,852 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:30:35,889 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-11-13 18:30:36,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:30:36,079 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:36,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:36,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1866638169, now seen corresponding path program 2 times [2021-11-13 18:30:36,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:36,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972722953] [2021-11-13 18:30:36,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:36,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:36,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:36,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972722953] [2021-11-13 18:30:36,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972722953] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:30:36,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057883255] [2021-11-13 18:30:36,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-13 18:30:36,238 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:30:36,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:30:36,240 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:30:36,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-13 18:30:36,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-13 18:30:36,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 18:30:36,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-13 18:30:36,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:30:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:36,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:30:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:36,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057883255] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:30:36,985 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:30:36,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 15 [2021-11-13 18:30:36,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333050885] [2021-11-13 18:30:36,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:30:36,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-13 18:30:36,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:36,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-13 18:30:36,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2021-11-13 18:30:36,988 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2021-11-13 18:30:36,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 399 transitions, 6013 flow. Second operand has 15 states, 15 states have (on average 76.33333333333333) internal successors, (1145), 15 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:36,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:36,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2021-11-13 18:30:36,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:30:42,448 INFO L129 PetriNetUnfolder]: 6420/14656 cut-off events. [2021-11-13 18:30:42,448 INFO L130 PetriNetUnfolder]: For 298211/298231 co-relation queries the response was YES. [2021-11-13 18:30:42,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109942 conditions, 14656 events. 6420/14656 cut-off events. For 298211/298231 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 151559 event pairs, 224 based on Foata normal form. 85/14706 useless extension candidates. Maximal degree in co-relation 109867. Up to 2640 conditions per place. [2021-11-13 18:30:42,813 INFO L132 encePairwiseOnDemand]: 90/105 looper letters, 403 selfloop transitions, 258 changer transitions 295/1024 dead transitions. [2021-11-13 18:30:42,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 1024 transitions, 19581 flow [2021-11-13 18:30:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-11-13 18:30:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2021-11-13 18:30:42,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3008 transitions. [2021-11-13 18:30:42,822 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7538847117794486 [2021-11-13 18:30:42,823 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3008 transitions. [2021-11-13 18:30:42,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3008 transitions. [2021-11-13 18:30:42,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:30:42,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3008 transitions. [2021-11-13 18:30:42,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 79.15789473684211) internal successors, (3008), 38 states have internal predecessors, (3008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:42,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 105.0) internal successors, (4095), 39 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:42,845 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 105.0) internal successors, (4095), 39 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:42,845 INFO L186 Difference]: Start difference. First operand has 246 places, 399 transitions, 6013 flow. Second operand 38 states and 3008 transitions. [2021-11-13 18:30:42,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 1024 transitions, 19581 flow [2021-11-13 18:30:45,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 1024 transitions, 18340 flow, removed 602 selfloop flow, removed 10 redundant places. [2021-11-13 18:30:45,762 INFO L242 Difference]: Finished difference. Result has 294 places, 514 transitions, 8231 flow [2021-11-13 18:30:45,762 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=5626, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=8231, PETRI_PLACES=294, PETRI_TRANSITIONS=514} [2021-11-13 18:30:45,763 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 200 predicate places. [2021-11-13 18:30:45,763 INFO L470 AbstractCegarLoop]: Abstraction has has 294 places, 514 transitions, 8231 flow [2021-11-13 18:30:45,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 76.33333333333333) internal successors, (1145), 15 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:45,763 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-11-13 18:30:45,764 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 18:30:45,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-13 18:30:45,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-11-13 18:30:45,964 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-11-13 18:30:45,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 18:30:45,965 INFO L85 PathProgramCache]: Analyzing trace with hash 5327971, now seen corresponding path program 3 times [2021-11-13 18:30:45,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 18:30:45,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723355700] [2021-11-13 18:30:45,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 18:30:45,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 18:30:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 18:30:46,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:46,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 18:30:46,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723355700] [2021-11-13 18:30:46,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723355700] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 18:30:46,213 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856173743] [2021-11-13 18:30:46,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-13 18:30:46,214 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 18:30:46,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 [2021-11-13 18:30:46,215 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 18:30:46,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-13 18:30:46,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-13 18:30:46,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 18:30:46,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 14 conjunts are in the unsatisfiable core [2021-11-13 18:30:46,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 18:30:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:46,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 18:30:47,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 18:30:47,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856173743] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 18:30:47,100 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 18:30:47,100 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 19 [2021-11-13 18:30:47,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861054893] [2021-11-13 18:30:47,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 18:30:47,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-13 18:30:47,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 18:30:47,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-13 18:30:47,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-11-13 18:30:47,105 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 105 [2021-11-13 18:30:47,107 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 514 transitions, 8231 flow. Second operand has 19 states, 19 states have (on average 67.05263157894737) internal successors, (1274), 19 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:30:47,107 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-11-13 18:30:47,107 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 105 [2021-11-13 18:30:47,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-11-13 18:31:00,724 INFO L129 PetriNetUnfolder]: 17430/30169 cut-off events. [2021-11-13 18:31:00,724 INFO L130 PetriNetUnfolder]: For 593699/593699 co-relation queries the response was YES. [2021-11-13 18:31:01,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215582 conditions, 30169 events. 17430/30169 cut-off events. For 593699/593699 co-relation queries the response was YES. Maximal size of possible extension queue 1931. Compared 286331 event pairs, 1856 based on Foata normal form. 60/30196 useless extension candidates. Maximal degree in co-relation 215482. Up to 11211 conditions per place. [2021-11-13 18:31:01,379 INFO L132 encePairwiseOnDemand]: 90/105 looper letters, 0 selfloop transitions, 0 changer transitions 978/978 dead transitions. [2021-11-13 18:31:01,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 978 transitions, 17906 flow [2021-11-13 18:31:01,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-11-13 18:31:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2021-11-13 18:31:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2187 transitions. [2021-11-13 18:31:01,392 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6718894009216589 [2021-11-13 18:31:01,392 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2187 transitions. [2021-11-13 18:31:01,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2187 transitions. [2021-11-13 18:31:01,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-11-13 18:31:01,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2187 transitions. [2021-11-13 18:31:01,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 70.54838709677419) internal successors, (2187), 31 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:31:01,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 105.0) internal successors, (3360), 32 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:31:01,407 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 105.0) internal successors, (3360), 32 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:31:01,407 INFO L186 Difference]: Start difference. First operand has 294 places, 514 transitions, 8231 flow. Second operand 31 states and 2187 transitions. [2021-11-13 18:31:01,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 978 transitions, 17906 flow [2021-11-13 18:31:12,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 978 transitions, 15964 flow, removed 411 selfloop flow, removed 36 redundant places. [2021-11-13 18:31:12,576 INFO L242 Difference]: Finished difference. Result has 253 places, 0 transitions, 0 flow [2021-11-13 18:31:12,577 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=7103, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=495, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=495, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=0, PETRI_PLACES=253, PETRI_TRANSITIONS=0} [2021-11-13 18:31:12,577 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 159 predicate places. [2021-11-13 18:31:12,577 INFO L470 AbstractCegarLoop]: Abstraction has has 253 places, 0 transitions, 0 flow [2021-11-13 18:31:12,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 67.05263157894737) internal successors, (1274), 19 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 18:31:12,580 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2021-11-13 18:31:12,580 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2021-11-13 18:31:12,580 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2021-11-13 18:31:12,581 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2021-11-13 18:31:12,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-13 18:31:12,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-13 18:31:12,785 INFO L732 BasicCegarLoop]: Path program histogram: [4, 4, 3, 2, 2, 1, 1] [2021-11-13 18:31:12,788 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-13 18:31:12,788 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-13 18:31:12,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 06:31:12 BasicIcfg [2021-11-13 18:31:12,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-13 18:31:12,793 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-13 18:31:12,793 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-13 18:31:12,793 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-13 18:31:12,806 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 06:30:08" (3/4) ... [2021-11-13 18:31:12,809 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-13 18:31:12,816 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-11-13 18:31:12,817 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-11-13 18:31:12,817 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-11-13 18:31:12,822 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2021-11-13 18:31:12,822 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-13 18:31:12,823 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-11-13 18:31:12,823 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-13 18:31:12,867 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/witness.graphml [2021-11-13 18:31:12,867 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-13 18:31:12,869 INFO L158 Benchmark]: Toolchain (without parser) took 65676.55ms. Allocated memory was 115.3MB in the beginning and 10.6GB in the end (delta: 10.4GB). Free memory was 77.1MB in the beginning and 9.1GB in the end (delta: -9.0GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2021-11-13 18:31:12,869 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 115.3MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 18:31:12,870 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.61ms. Allocated memory is still 115.3MB. Free memory was 77.0MB in the beginning and 88.8MB in the end (delta: -11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-13 18:31:12,870 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.85ms. Allocated memory is still 115.3MB. Free memory was 88.8MB in the beginning and 87.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 18:31:12,871 INFO L158 Benchmark]: Boogie Preprocessor took 57.64ms. Allocated memory is still 115.3MB. Free memory was 87.3MB in the beginning and 85.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 18:31:12,871 INFO L158 Benchmark]: RCFGBuilder took 612.60ms. Allocated memory is still 115.3MB. Free memory was 85.8MB in the beginning and 72.6MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-11-13 18:31:12,872 INFO L158 Benchmark]: TraceAbstraction took 64509.91ms. Allocated memory was 115.3MB in the beginning and 10.6GB in the end (delta: 10.4GB). Free memory was 72.1MB in the beginning and 9.1GB in the end (delta: -9.0GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2021-11-13 18:31:12,872 INFO L158 Benchmark]: Witness Printer took 74.99ms. Allocated memory is still 10.6GB. Free memory was 9.1GB in the beginning and 9.1GB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 18:31:12,877 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.32ms. Allocated memory is still 115.3MB. Free memory is still 93.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.61ms. Allocated memory is still 115.3MB. Free memory was 77.0MB in the beginning and 88.8MB in the end (delta: -11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.85ms. Allocated memory is still 115.3MB. Free memory was 88.8MB in the beginning and 87.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.64ms. Allocated memory is still 115.3MB. Free memory was 87.3MB in the beginning and 85.8MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 612.60ms. Allocated memory is still 115.3MB. Free memory was 85.8MB in the beginning and 72.6MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 64509.91ms. Allocated memory was 115.3MB in the beginning and 10.6GB in the end (delta: 10.4GB). Free memory was 72.1MB in the beginning and 9.1GB in the end (delta: -9.0GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 74.99ms. Allocated memory is still 10.6GB. Free memory was 9.1GB in the beginning and 9.1GB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 116]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 126 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 64.3s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 55.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1150 SdHoareTripleChecker+Valid, 3552.10ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1150 mSDsluCounter, 1264 SdHoareTripleChecker+Invalid, 2882.45ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1596 mSDsCounter, 399 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3599 IncrementalHoareTripleChecker+Invalid, 3998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 399 mSolverCounterUnsat, 263 mSDtfsCounter, 3599 mSolverCounterSat, 46.66ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1123 GetRequests, 891 SyntacticMatches, 5 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8231occurred in iteration=16, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1821 NumberOfCodeBlocks, 1821 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2239 ConstructedInterpolants, 0 QuantifiedInterpolants, 6617 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1031 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 27 InterpolantComputations, 12 PerfectInterpolantSequences, 97/181 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-11-13 18:31:12,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5935862e-f09a-4cf9-b690-de4e292c7944/bin/uautomizer-YU5uOKAj3y/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE