./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8 --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 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-e04fb08 [2022-11-16 11:25:32,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:25:32,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:25:32,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:25:32,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:25:32,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:25:32,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:25:32,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:25:32,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:25:32,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:25:32,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:25:32,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:25:32,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:25:32,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:25:32,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:25:32,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:25:32,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:25:32,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:25:32,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:25:32,475 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:25:32,480 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:25:32,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:25:32,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:25:32,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:25:32,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:25:32,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:25:32,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:25:32,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:25:32,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:25:32,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:25:32,511 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:25:32,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:25:32,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:25:32,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:25:32,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:25:32,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:25:32,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:25:32,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:25:32,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:25:32,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:25:32,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:25:32,528 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:25:32,576 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:25:32,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:25:32,578 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:25:32,578 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:25:32,579 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:25:32,580 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:25:32,581 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:25:32,581 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:25:32,581 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:25:32,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:25:32,583 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:25:32,583 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:25:32,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:25:32,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:25:32,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:25:32,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:25:32,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:25:32,585 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:25:32,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:25:32,585 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:25:32,586 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:25:32,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:25:32,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:25:32,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:25:32,587 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:25:32,587 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:25:32,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:25:32,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:25:32,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:25:32,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:25:32,590 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:25:32,590 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:25:32,591 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:25:32,591 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_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/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_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8 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 -> 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a [2022-11-16 11:25:32,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:25:33,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:25:33,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:25:33,014 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:25:33,015 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:25:33,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/pthread-wmm/mix038.opt.i [2022-11-16 11:25:33,105 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/data/f7bfceb66/f06c4c16d4ee440ba3f4e57e8da9fba8/FLAG2ca285b47 [2022-11-16 11:25:33,866 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:25:33,867 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/sv-benchmarks/c/pthread-wmm/mix038.opt.i [2022-11-16 11:25:33,887 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/data/f7bfceb66/f06c4c16d4ee440ba3f4e57e8da9fba8/FLAG2ca285b47 [2022-11-16 11:25:34,074 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/data/f7bfceb66/f06c4c16d4ee440ba3f4e57e8da9fba8 [2022-11-16 11:25:34,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:25:34,080 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:25:34,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:25:34,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:25:34,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:25:34,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:25:34" (1/1) ... [2022-11-16 11:25:34,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70dfb89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:34, skipping insertion in model container [2022-11-16 11:25:34,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:25:34" (1/1) ... [2022-11-16 11:25:34,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:25:34,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:25:34,496 WARN L229 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_5cd83a2d-fb76-43a3-9542-6e279ead9850/sv-benchmarks/c/pthread-wmm/mix038.opt.i[944,957] [2022-11-16 11:25:34,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:25:34,836 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:25:34,861 WARN L229 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_5cd83a2d-fb76-43a3-9542-6e279ead9850/sv-benchmarks/c/pthread-wmm/mix038.opt.i[944,957] [2022-11-16 11:25:34,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:25:35,008 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:25:35,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:35 WrapperNode [2022-11-16 11:25:35,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:25:35,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:25:35,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:25:35,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:25:35,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:35" (1/1) ... [2022-11-16 11:25:35,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:35" (1/1) ... [2022-11-16 11:25:35,114 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 136 [2022-11-16 11:25:35,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:25:35,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:25:35,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:25:35,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:25:35,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:35" (1/1) ... [2022-11-16 11:25:35,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:35" (1/1) ... [2022-11-16 11:25:35,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:35" (1/1) ... [2022-11-16 11:25:35,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:35" (1/1) ... [2022-11-16 11:25:35,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:35" (1/1) ... [2022-11-16 11:25:35,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:35" (1/1) ... [2022-11-16 11:25:35,172 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:35" (1/1) ... [2022-11-16 11:25:35,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:35" (1/1) ... [2022-11-16 11:25:35,190 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:25:35,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:25:35,191 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:25:35,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:25:35,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:35" (1/1) ... [2022-11-16 11:25:35,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:25:35,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:35,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:25:35,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:25:35,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:25:35,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 11:25:35,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:25:35,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:25:35,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:25:35,316 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-16 11:25:35,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-16 11:25:35,317 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-16 11:25:35,318 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-16 11:25:35,318 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-16 11:25:35,318 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-16 11:25:35,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:25:35,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 11:25:35,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:25:35,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:25:35,321 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 11:25:35,587 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:25:35,604 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:25:36,053 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:25:36,367 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:25:36,368 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-16 11:25:36,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:25:36 BoogieIcfgContainer [2022-11-16 11:25:36,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:25:36,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:25:36,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:25:36,379 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:25:36,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:25:34" (1/3) ... [2022-11-16 11:25:36,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4809f422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:25:36, skipping insertion in model container [2022-11-16 11:25:36,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:35" (2/3) ... [2022-11-16 11:25:36,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4809f422 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:25:36, skipping insertion in model container [2022-11-16 11:25:36,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:25:36" (3/3) ... [2022-11-16 11:25:36,383 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2022-11-16 11:25:36,395 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 11:25:36,409 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:25:36,410 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 11:25:36,410 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 11:25:36,522 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-16 11:25:36,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-11-16 11:25:36,656 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-11-16 11:25:36,657 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:25:36,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-16 11:25:36,664 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-11-16 11:25:36,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-11-16 11:25:36,697 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:25:36,712 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2e63ad77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:25:36,713 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-16 11:25:36,764 INFO L130 PetriNetUnfolder]: 0/73 cut-off events. [2022-11-16 11:25:36,764 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-16 11:25:36,765 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:25:36,766 INFO L209 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] [2022-11-16 11:25:36,767 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:25:36,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:36,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1895412343, now seen corresponding path program 1 times [2022-11-16 11:25:36,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:36,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408224396] [2022-11-16 11:25:36,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:36,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:37,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:37,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408224396] [2022-11-16 11:25:37,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408224396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:37,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:37,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:25:37,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887642718] [2022-11-16 11:25:37,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:37,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:25:37,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:37,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:25:37,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:25:37,766 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 117 [2022-11-16 11:25:37,773 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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) [2022-11-16 11:25:37,773 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:25:37,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 117 [2022-11-16 11:25:37,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:25:37,907 INFO L130 PetriNetUnfolder]: 10/152 cut-off events. [2022-11-16 11:25:37,907 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-11-16 11:25:37,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 152 events. 10/152 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 245 event pairs, 2 based on Foata normal form. 6/151 useless extension candidates. Maximal degree in co-relation 137. Up to 17 conditions per place. [2022-11-16 11:25:37,912 INFO L137 encePairwiseOnDemand]: 112/117 looper letters, 8 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-11-16 11:25:37,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 112 transitions, 253 flow [2022-11-16 11:25:37,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:25:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-16 11:25:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 330 transitions. [2022-11-16 11:25:37,945 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9401709401709402 [2022-11-16 11:25:37,946 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 330 transitions. [2022-11-16 11:25:37,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 330 transitions. [2022-11-16 11:25:37,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:25:37,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 330 transitions. [2022-11-16 11:25:37,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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) [2022-11-16 11:25:37,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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) [2022-11-16 11:25:37,979 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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) [2022-11-16 11:25:37,982 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 237 flow. Second operand 3 states and 330 transitions. [2022-11-16 11:25:37,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 112 transitions, 253 flow [2022-11-16 11:25:37,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 112 transitions, 250 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-16 11:25:38,001 INFO L231 Difference]: Finished difference. Result has 119 places, 110 transitions, 230 flow [2022-11-16 11:25:38,004 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=119, PETRI_TRANSITIONS=110} [2022-11-16 11:25:38,011 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, -3 predicate places. [2022-11-16 11:25:38,012 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 110 transitions, 230 flow [2022-11-16 11:25:38,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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) [2022-11-16 11:25:38,013 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:25:38,014 INFO L209 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] [2022-11-16 11:25:38,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:25:38,015 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:25:38,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:38,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1984790191, now seen corresponding path program 1 times [2022-11-16 11:25:38,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:38,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178836645] [2022-11-16 11:25:38,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:38,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:38,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:38,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178836645] [2022-11-16 11:25:38,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178836645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:38,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:38,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:25:38,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849366998] [2022-11-16 11:25:38,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:38,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:25:38,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:38,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:25:38,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:25:38,835 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 117 [2022-11-16 11:25:38,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 110 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 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) [2022-11-16 11:25:38,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:25:38,844 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 117 [2022-11-16 11:25:38,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:25:40,016 INFO L130 PetriNetUnfolder]: 710/2100 cut-off events. [2022-11-16 11:25:40,016 INFO L131 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2022-11-16 11:25:40,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3322 conditions, 2100 events. 710/2100 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 16166 event pairs, 121 based on Foata normal form. 0/2040 useless extension candidates. Maximal degree in co-relation 3265. Up to 405 conditions per place. [2022-11-16 11:25:40,038 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 28 selfloop transitions, 6 changer transitions 69/180 dead transitions. [2022-11-16 11:25:40,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 180 transitions, 560 flow [2022-11-16 11:25:40,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:25:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:25:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1278 transitions. [2022-11-16 11:25:40,044 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8402366863905325 [2022-11-16 11:25:40,045 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1278 transitions. [2022-11-16 11:25:40,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1278 transitions. [2022-11-16 11:25:40,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:25:40,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1278 transitions. [2022-11-16 11:25:40,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.3076923076923) internal successors, (1278), 13 states have internal predecessors, (1278), 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) [2022-11-16 11:25:40,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 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) [2022-11-16 11:25:40,055 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 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) [2022-11-16 11:25:40,055 INFO L175 Difference]: Start difference. First operand has 119 places, 110 transitions, 230 flow. Second operand 13 states and 1278 transitions. [2022-11-16 11:25:40,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 180 transitions, 560 flow [2022-11-16 11:25:40,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 180 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-16 11:25:40,060 INFO L231 Difference]: Finished difference. Result has 141 places, 102 transitions, 288 flow [2022-11-16 11:25:40,061 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=288, PETRI_PLACES=141, PETRI_TRANSITIONS=102} [2022-11-16 11:25:40,061 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 19 predicate places. [2022-11-16 11:25:40,062 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 102 transitions, 288 flow [2022-11-16 11:25:40,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 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) [2022-11-16 11:25:40,062 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:25:40,063 INFO L209 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, 1, 1] [2022-11-16 11:25:40,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:25:40,063 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:25:40,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:40,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1257034036, now seen corresponding path program 1 times [2022-11-16 11:25:40,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:40,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139212886] [2022-11-16 11:25:40,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:40,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:40,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:40,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139212886] [2022-11-16 11:25:40,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139212886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:40,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:40,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:25:40,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770355131] [2022-11-16 11:25:40,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:40,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:25:40,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:40,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:25:40,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:25:40,526 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 117 [2022-11-16 11:25:40,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 102 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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) [2022-11-16 11:25:40,528 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:25:40,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 117 [2022-11-16 11:25:40,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:25:41,348 INFO L130 PetriNetUnfolder]: 424/1160 cut-off events. [2022-11-16 11:25:41,349 INFO L131 PetriNetUnfolder]: For 2317/2317 co-relation queries the response was YES. [2022-11-16 11:25:41,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3515 conditions, 1160 events. 424/1160 cut-off events. For 2317/2317 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7260 event pairs, 75 based on Foata normal form. 26/1148 useless extension candidates. Maximal degree in co-relation 3446. Up to 334 conditions per place. [2022-11-16 11:25:41,364 INFO L137 encePairwiseOnDemand]: 106/117 looper letters, 33 selfloop transitions, 13 changer transitions 49/172 dead transitions. [2022-11-16 11:25:41,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 172 transitions, 914 flow [2022-11-16 11:25:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:25:41,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-16 11:25:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1277 transitions. [2022-11-16 11:25:41,369 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8395792241946088 [2022-11-16 11:25:41,370 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1277 transitions. [2022-11-16 11:25:41,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1277 transitions. [2022-11-16 11:25:41,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:25:41,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1277 transitions. [2022-11-16 11:25:41,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.23076923076923) internal successors, (1277), 13 states have internal predecessors, (1277), 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) [2022-11-16 11:25:41,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 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) [2022-11-16 11:25:41,381 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 117.0) internal successors, (1638), 14 states have internal predecessors, (1638), 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) [2022-11-16 11:25:41,381 INFO L175 Difference]: Start difference. First operand has 141 places, 102 transitions, 288 flow. Second operand 13 states and 1277 transitions. [2022-11-16 11:25:41,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 172 transitions, 914 flow [2022-11-16 11:25:41,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 172 transitions, 862 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-11-16 11:25:41,397 INFO L231 Difference]: Finished difference. Result has 139 places, 108 transitions, 393 flow [2022-11-16 11:25:41,398 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=393, PETRI_PLACES=139, PETRI_TRANSITIONS=108} [2022-11-16 11:25:41,399 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 17 predicate places. [2022-11-16 11:25:41,399 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 108 transitions, 393 flow [2022-11-16 11:25:41,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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) [2022-11-16 11:25:41,400 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:25:41,400 INFO L209 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, 1, 1, 1, 1] [2022-11-16 11:25:41,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:25:41,401 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:25:41,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:41,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1739468817, now seen corresponding path program 1 times [2022-11-16 11:25:41,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:41,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905114708] [2022-11-16 11:25:41,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:41,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:41,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:41,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905114708] [2022-11-16 11:25:41,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905114708] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:41,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:41,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:25:41,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614836664] [2022-11-16 11:25:41,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:41,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:25:41,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:41,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:25:41,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:25:41,762 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 117 [2022-11-16 11:25:41,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 108 transitions, 393 flow. Second operand has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 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) [2022-11-16 11:25:41,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:25:41,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 117 [2022-11-16 11:25:41,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:25:42,791 INFO L130 PetriNetUnfolder]: 1374/2935 cut-off events. [2022-11-16 11:25:42,791 INFO L131 PetriNetUnfolder]: For 5522/7107 co-relation queries the response was YES. [2022-11-16 11:25:42,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7589 conditions, 2935 events. 1374/2935 cut-off events. For 5522/7107 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 22443 event pairs, 68 based on Foata normal form. 47/2781 useless extension candidates. Maximal degree in co-relation 7512. Up to 843 conditions per place. [2022-11-16 11:25:42,824 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 39 selfloop transitions, 7 changer transitions 41/175 dead transitions. [2022-11-16 11:25:42,824 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 175 transitions, 901 flow [2022-11-16 11:25:42,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:25:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:25:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1023 transitions. [2022-11-16 11:25:42,828 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8743589743589744 [2022-11-16 11:25:42,828 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1023 transitions. [2022-11-16 11:25:42,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1023 transitions. [2022-11-16 11:25:42,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:25:42,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1023 transitions. [2022-11-16 11:25:42,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 102.3) internal successors, (1023), 10 states have internal predecessors, (1023), 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) [2022-11-16 11:25:42,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 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) [2022-11-16 11:25:42,835 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 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) [2022-11-16 11:25:42,836 INFO L175 Difference]: Start difference. First operand has 139 places, 108 transitions, 393 flow. Second operand 10 states and 1023 transitions. [2022-11-16 11:25:42,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 175 transitions, 901 flow [2022-11-16 11:25:42,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 175 transitions, 871 flow, removed 15 selfloop flow, removed 12 redundant places. [2022-11-16 11:25:42,851 INFO L231 Difference]: Finished difference. Result has 133 places, 112 transitions, 425 flow [2022-11-16 11:25:42,852 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=425, PETRI_PLACES=133, PETRI_TRANSITIONS=112} [2022-11-16 11:25:42,853 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 11 predicate places. [2022-11-16 11:25:42,853 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 112 transitions, 425 flow [2022-11-16 11:25:42,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 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) [2022-11-16 11:25:42,853 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:25:42,854 INFO L209 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, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:42,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:25:42,854 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:25:42,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:42,855 INFO L85 PathProgramCache]: Analyzing trace with hash 621687696, now seen corresponding path program 1 times [2022-11-16 11:25:42,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:42,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611904317] [2022-11-16 11:25:42,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:42,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:43,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:43,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611904317] [2022-11-16 11:25:43,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611904317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:43,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:43,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:25:43,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096090612] [2022-11-16 11:25:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:43,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:25:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:43,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:25:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:25:43,177 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 117 [2022-11-16 11:25:43,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 112 transitions, 425 flow. Second operand has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 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) [2022-11-16 11:25:43,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:25:43,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 117 [2022-11-16 11:25:43,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:25:43,995 INFO L130 PetriNetUnfolder]: 600/2032 cut-off events. [2022-11-16 11:25:43,995 INFO L131 PetriNetUnfolder]: For 3562/3683 co-relation queries the response was YES. [2022-11-16 11:25:44,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5929 conditions, 2032 events. 600/2032 cut-off events. For 3562/3683 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 16902 event pairs, 227 based on Foata normal form. 26/1917 useless extension candidates. Maximal degree in co-relation 5852. Up to 469 conditions per place. [2022-11-16 11:25:44,020 INFO L137 encePairwiseOnDemand]: 109/117 looper letters, 39 selfloop transitions, 17 changer transitions 19/156 dead transitions. [2022-11-16 11:25:44,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 156 transitions, 866 flow [2022-11-16 11:25:44,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:25:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-16 11:25:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 979 transitions. [2022-11-16 11:25:44,024 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8367521367521368 [2022-11-16 11:25:44,025 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 979 transitions. [2022-11-16 11:25:44,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 979 transitions. [2022-11-16 11:25:44,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:25:44,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 979 transitions. [2022-11-16 11:25:44,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.9) internal successors, (979), 10 states have internal predecessors, (979), 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) [2022-11-16 11:25:44,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 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) [2022-11-16 11:25:44,033 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 117.0) internal successors, (1287), 11 states have internal predecessors, (1287), 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) [2022-11-16 11:25:44,033 INFO L175 Difference]: Start difference. First operand has 133 places, 112 transitions, 425 flow. Second operand 10 states and 979 transitions. [2022-11-16 11:25:44,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 156 transitions, 866 flow [2022-11-16 11:25:44,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 156 transitions, 857 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-16 11:25:44,045 INFO L231 Difference]: Finished difference. Result has 142 places, 120 transitions, 554 flow [2022-11-16 11:25:44,046 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=554, PETRI_PLACES=142, PETRI_TRANSITIONS=120} [2022-11-16 11:25:44,047 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 20 predicate places. [2022-11-16 11:25:44,047 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 120 transitions, 554 flow [2022-11-16 11:25:44,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 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) [2022-11-16 11:25:44,048 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:25:44,048 INFO L209 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, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:44,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:25:44,049 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:25:44,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:44,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1674934970, now seen corresponding path program 1 times [2022-11-16 11:25:44,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:44,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746094992] [2022-11-16 11:25:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:44,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:44,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:44,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746094992] [2022-11-16 11:25:44,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746094992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:44,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:44,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:25:44,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060522753] [2022-11-16 11:25:44,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:44,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:25:44,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:44,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:25:44,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:25:44,474 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 117 [2022-11-16 11:25:44,475 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 120 transitions, 554 flow. Second operand has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:44,475 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:25:44,475 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 117 [2022-11-16 11:25:44,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:25:45,135 INFO L130 PetriNetUnfolder]: 772/2142 cut-off events. [2022-11-16 11:25:45,135 INFO L131 PetriNetUnfolder]: For 4965/5303 co-relation queries the response was YES. [2022-11-16 11:25:45,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6919 conditions, 2142 events. 772/2142 cut-off events. For 4965/5303 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 17173 event pairs, 47 based on Foata normal form. 83/2172 useless extension candidates. Maximal degree in co-relation 6839. Up to 591 conditions per place. [2022-11-16 11:25:45,155 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 44 selfloop transitions, 20 changer transitions 32/185 dead transitions. [2022-11-16 11:25:45,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 185 transitions, 1144 flow [2022-11-16 11:25:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:25:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:25:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1126 transitions. [2022-11-16 11:25:45,158 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8749028749028749 [2022-11-16 11:25:45,159 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1126 transitions. [2022-11-16 11:25:45,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1126 transitions. [2022-11-16 11:25:45,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:25:45,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1126 transitions. [2022-11-16 11:25:45,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 102.36363636363636) internal successors, (1126), 11 states have internal predecessors, (1126), 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) [2022-11-16 11:25:45,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 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) [2022-11-16 11:25:45,167 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 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) [2022-11-16 11:25:45,167 INFO L175 Difference]: Start difference. First operand has 142 places, 120 transitions, 554 flow. Second operand 11 states and 1126 transitions. [2022-11-16 11:25:45,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 185 transitions, 1144 flow [2022-11-16 11:25:45,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 185 transitions, 1119 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-11-16 11:25:45,180 INFO L231 Difference]: Finished difference. Result has 155 places, 129 transitions, 639 flow [2022-11-16 11:25:45,181 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=639, PETRI_PLACES=155, PETRI_TRANSITIONS=129} [2022-11-16 11:25:45,183 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 33 predicate places. [2022-11-16 11:25:45,183 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 129 transitions, 639 flow [2022-11-16 11:25:45,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.0) internal successors, (679), 7 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:45,184 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:25:45,184 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:45,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:25:45,185 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:25:45,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:45,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1042157948, now seen corresponding path program 1 times [2022-11-16 11:25:45,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:45,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6431245] [2022-11-16 11:25:45,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:45,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:45,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:45,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6431245] [2022-11-16 11:25:45,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6431245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:45,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:45,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:25:45,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225467524] [2022-11-16 11:25:45,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:45,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:25:45,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:45,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:25:45,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:25:45,616 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 117 [2022-11-16 11:25:45,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 129 transitions, 639 flow. Second operand has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 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) [2022-11-16 11:25:45,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:25:45,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 117 [2022-11-16 11:25:45,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:25:46,296 INFO L130 PetriNetUnfolder]: 607/1803 cut-off events. [2022-11-16 11:25:46,296 INFO L131 PetriNetUnfolder]: For 5842/6171 co-relation queries the response was YES. [2022-11-16 11:25:46,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6467 conditions, 1803 events. 607/1803 cut-off events. For 5842/6171 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14889 event pairs, 40 based on Foata normal form. 61/1816 useless extension candidates. Maximal degree in co-relation 6435. Up to 507 conditions per place. [2022-11-16 11:25:46,316 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 36 selfloop transitions, 24 changer transitions 24/170 dead transitions. [2022-11-16 11:25:46,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 170 transitions, 1049 flow [2022-11-16 11:25:46,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-16 11:25:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-11-16 11:25:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1404 transitions. [2022-11-16 11:25:46,320 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-11-16 11:25:46,321 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1404 transitions. [2022-11-16 11:25:46,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1404 transitions. [2022-11-16 11:25:46,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:25:46,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1404 transitions. [2022-11-16 11:25:46,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 100.28571428571429) internal successors, (1404), 14 states have internal predecessors, (1404), 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) [2022-11-16 11:25:46,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 117.0) internal successors, (1755), 15 states have internal predecessors, (1755), 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) [2022-11-16 11:25:46,330 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 117.0) internal successors, (1755), 15 states have internal predecessors, (1755), 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) [2022-11-16 11:25:46,330 INFO L175 Difference]: Start difference. First operand has 155 places, 129 transitions, 639 flow. Second operand 14 states and 1404 transitions. [2022-11-16 11:25:46,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 170 transitions, 1049 flow [2022-11-16 11:25:46,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 170 transitions, 863 flow, removed 82 selfloop flow, removed 12 redundant places. [2022-11-16 11:25:46,383 INFO L231 Difference]: Finished difference. Result has 157 places, 126 transitions, 549 flow [2022-11-16 11:25:46,383 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=549, PETRI_PLACES=157, PETRI_TRANSITIONS=126} [2022-11-16 11:25:46,384 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 35 predicate places. [2022-11-16 11:25:46,384 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 126 transitions, 549 flow [2022-11-16 11:25:46,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 97.0) internal successors, (776), 8 states have internal predecessors, (776), 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) [2022-11-16 11:25:46,385 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:25:46,385 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:46,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:25:46,386 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:25:46,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:46,386 INFO L85 PathProgramCache]: Analyzing trace with hash 684281770, now seen corresponding path program 1 times [2022-11-16 11:25:46,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:46,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695754635] [2022-11-16 11:25:46,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:46,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:46,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:46,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:46,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695754635] [2022-11-16 11:25:46,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695754635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:46,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:46,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:25:46,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990420364] [2022-11-16 11:25:46,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:46,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:25:46,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:46,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:25:46,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:25:46,717 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-11-16 11:25:46,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 126 transitions, 549 flow. Second operand has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 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) [2022-11-16 11:25:46,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:25:46,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-11-16 11:25:46,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:25:47,052 INFO L130 PetriNetUnfolder]: 115/708 cut-off events. [2022-11-16 11:25:47,053 INFO L131 PetriNetUnfolder]: For 1170/1216 co-relation queries the response was YES. [2022-11-16 11:25:47,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 708 events. 115/708 cut-off events. For 1170/1216 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5179 event pairs, 7 based on Foata normal form. 3/668 useless extension candidates. Maximal degree in co-relation 1775. Up to 86 conditions per place. [2022-11-16 11:25:47,060 INFO L137 encePairwiseOnDemand]: 106/117 looper letters, 30 selfloop transitions, 12 changer transitions 5/144 dead transitions. [2022-11-16 11:25:47,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 144 transitions, 735 flow [2022-11-16 11:25:47,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:25:47,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-16 11:25:47,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 756 transitions. [2022-11-16 11:25:47,062 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8076923076923077 [2022-11-16 11:25:47,063 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 756 transitions. [2022-11-16 11:25:47,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 756 transitions. [2022-11-16 11:25:47,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:25:47,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 756 transitions. [2022-11-16 11:25:47,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.5) internal successors, (756), 8 states have internal predecessors, (756), 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) [2022-11-16 11:25:47,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 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) [2022-11-16 11:25:47,068 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 117.0) internal successors, (1053), 9 states have internal predecessors, (1053), 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) [2022-11-16 11:25:47,068 INFO L175 Difference]: Start difference. First operand has 157 places, 126 transitions, 549 flow. Second operand 8 states and 756 transitions. [2022-11-16 11:25:47,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 144 transitions, 735 flow [2022-11-16 11:25:47,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 144 transitions, 642 flow, removed 27 selfloop flow, removed 15 redundant places. [2022-11-16 11:25:47,081 INFO L231 Difference]: Finished difference. Result has 151 places, 132 transitions, 576 flow [2022-11-16 11:25:47,081 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=576, PETRI_PLACES=151, PETRI_TRANSITIONS=132} [2022-11-16 11:25:47,082 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 29 predicate places. [2022-11-16 11:25:47,082 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 132 transitions, 576 flow [2022-11-16 11:25:47,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 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) [2022-11-16 11:25:47,083 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:25:47,083 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:47,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:25:47,084 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:25:47,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:47,084 INFO L85 PathProgramCache]: Analyzing trace with hash -435069730, now seen corresponding path program 2 times [2022-11-16 11:25:47,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:47,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124532282] [2022-11-16 11:25:47,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:47,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:48,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:48,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:48,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124532282] [2022-11-16 11:25:48,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124532282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:48,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:48,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-16 11:25:48,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583251953] [2022-11-16 11:25:48,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:48,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 11:25:48,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:48,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 11:25:48,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:25:48,085 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 117 [2022-11-16 11:25:48,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 132 transitions, 576 flow. Second operand has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 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) [2022-11-16 11:25:48,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:25:48,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 117 [2022-11-16 11:25:48,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:25:48,536 INFO L130 PetriNetUnfolder]: 123/720 cut-off events. [2022-11-16 11:25:48,537 INFO L131 PetriNetUnfolder]: For 824/869 co-relation queries the response was YES. [2022-11-16 11:25:48,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1844 conditions, 720 events. 123/720 cut-off events. For 824/869 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5403 event pairs, 3 based on Foata normal form. 2/679 useless extension candidates. Maximal degree in co-relation 1818. Up to 101 conditions per place. [2022-11-16 11:25:48,542 INFO L137 encePairwiseOnDemand]: 103/117 looper letters, 27 selfloop transitions, 15 changer transitions 25/149 dead transitions. [2022-11-16 11:25:48,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 149 transitions, 806 flow [2022-11-16 11:25:48,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:25:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-16 11:25:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 982 transitions. [2022-11-16 11:25:48,545 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.763014763014763 [2022-11-16 11:25:48,546 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 982 transitions. [2022-11-16 11:25:48,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 982 transitions. [2022-11-16 11:25:48,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:25:48,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 982 transitions. [2022-11-16 11:25:48,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 89.27272727272727) internal successors, (982), 11 states have internal predecessors, (982), 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) [2022-11-16 11:25:48,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 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) [2022-11-16 11:25:48,552 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 117.0) internal successors, (1404), 12 states have internal predecessors, (1404), 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) [2022-11-16 11:25:48,552 INFO L175 Difference]: Start difference. First operand has 151 places, 132 transitions, 576 flow. Second operand 11 states and 982 transitions. [2022-11-16 11:25:48,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 149 transitions, 806 flow [2022-11-16 11:25:48,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 149 transitions, 796 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-11-16 11:25:48,567 INFO L231 Difference]: Finished difference. Result has 160 places, 122 transitions, 540 flow [2022-11-16 11:25:48,567 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=540, PETRI_PLACES=160, PETRI_TRANSITIONS=122} [2022-11-16 11:25:48,569 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 38 predicate places. [2022-11-16 11:25:48,569 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 122 transitions, 540 flow [2022-11-16 11:25:48,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 88.0) internal successors, (792), 9 states have internal predecessors, (792), 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) [2022-11-16 11:25:48,570 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:25:48,570 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:48,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:25:48,570 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:25:48,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:48,571 INFO L85 PathProgramCache]: Analyzing trace with hash 76303372, now seen corresponding path program 3 times [2022-11-16 11:25:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:48,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900817873] [2022-11-16 11:25:48,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:48,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:48,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:48,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900817873] [2022-11-16 11:25:48,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900817873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:48,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:48,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 11:25:48,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130701525] [2022-11-16 11:25:48,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:48,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:25:48,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:48,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:25:48,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:25:48,902 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2022-11-16 11:25:48,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 122 transitions, 540 flow. Second operand has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 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) [2022-11-16 11:25:48,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-16 11:25:48,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2022-11-16 11:25:48,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-16 11:25:49,199 INFO L130 PetriNetUnfolder]: 74/574 cut-off events. [2022-11-16 11:25:49,200 INFO L131 PetriNetUnfolder]: For 617/653 co-relation queries the response was YES. [2022-11-16 11:25:49,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1355 conditions, 574 events. 74/574 cut-off events. For 617/653 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3863 event pairs, 6 based on Foata normal form. 2/538 useless extension candidates. Maximal degree in co-relation 1326. Up to 101 conditions per place. [2022-11-16 11:25:49,204 INFO L137 encePairwiseOnDemand]: 107/117 looper letters, 18 selfloop transitions, 5 changer transitions 32/135 dead transitions. [2022-11-16 11:25:49,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 135 transitions, 714 flow [2022-11-16 11:25:49,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:25:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-16 11:25:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 847 transitions. [2022-11-16 11:25:49,207 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8043684710351378 [2022-11-16 11:25:49,208 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 847 transitions. [2022-11-16 11:25:49,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 847 transitions. [2022-11-16 11:25:49,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:25:49,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 847 transitions. [2022-11-16 11:25:49,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.11111111111111) internal successors, (847), 9 states have internal predecessors, (847), 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) [2022-11-16 11:25:49,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 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) [2022-11-16 11:25:49,214 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 117.0) internal successors, (1170), 10 states have internal predecessors, (1170), 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) [2022-11-16 11:25:49,215 INFO L175 Difference]: Start difference. First operand has 160 places, 122 transitions, 540 flow. Second operand 9 states and 847 transitions. [2022-11-16 11:25:49,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 135 transitions, 714 flow [2022-11-16 11:25:49,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 135 transitions, 660 flow, removed 14 selfloop flow, removed 12 redundant places. [2022-11-16 11:25:49,225 INFO L231 Difference]: Finished difference. Result has 151 places, 103 transitions, 346 flow [2022-11-16 11:25:49,226 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=346, PETRI_PLACES=151, PETRI_TRANSITIONS=103} [2022-11-16 11:25:49,227 INFO L288 CegarLoopForPetriNet]: 122 programPoint places, 29 predicate places. [2022-11-16 11:25:49,227 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 103 transitions, 346 flow [2022-11-16 11:25:49,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 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) [2022-11-16 11:25:49,228 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-16 11:25:49,228 INFO L209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:49,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:25:49,228 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-16 11:25:49,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:49,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1246919996, now seen corresponding path program 4 times [2022-11-16 11:25:49,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:49,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714001734] [2022-11-16 11:25:49,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:49,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:25:49,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:25:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:25:49,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:25:49,391 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:25:49,392 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-16 11:25:49,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-16 11:25:49,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-16 11:25:49,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-16 11:25:49,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-16 11:25:49,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-16 11:25:49,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:25:49,396 INFO L444 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:49,404 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 11:25:49,405 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:25:49,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:25:49 BasicIcfg [2022-11-16 11:25:49,555 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:25:49,556 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:25:49,556 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:25:49,556 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:25:49,557 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:25:36" (3/4) ... [2022-11-16 11:25:49,559 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:25:49,693 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:25:49,694 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:25:49,694 INFO L158 Benchmark]: Toolchain (without parser) took 15614.53ms. Allocated memory was 121.6MB in the beginning and 325.1MB in the end (delta: 203.4MB). Free memory was 79.1MB in the beginning and 218.9MB in the end (delta: -139.8MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2022-11-16 11:25:49,695 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 121.6MB. Free memory was 97.1MB in the beginning and 97.1MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:25:49,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 924.23ms. Allocated memory is still 121.6MB. Free memory was 79.0MB in the beginning and 84.1MB in the end (delta: -5.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:25:49,696 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.21ms. Allocated memory is still 121.6MB. Free memory was 84.1MB in the beginning and 81.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:25:49,696 INFO L158 Benchmark]: Boogie Preprocessor took 72.88ms. Allocated memory is still 121.6MB. Free memory was 81.6MB in the beginning and 79.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:25:49,697 INFO L158 Benchmark]: RCFGBuilder took 1180.01ms. Allocated memory is still 121.6MB. Free memory was 79.9MB in the beginning and 50.3MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-16 11:25:49,697 INFO L158 Benchmark]: TraceAbstraction took 13181.64ms. Allocated memory was 121.6MB in the beginning and 325.1MB in the end (delta: 203.4MB). Free memory was 49.6MB in the beginning and 242.0MB in the end (delta: -192.4MB). Peak memory consumption was 181.3MB. Max. memory is 16.1GB. [2022-11-16 11:25:49,697 INFO L158 Benchmark]: Witness Printer took 138.16ms. Allocated memory is still 325.1MB. Free memory was 242.0MB in the beginning and 218.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-16 11:25:49,699 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.46ms. Allocated memory is still 121.6MB. Free memory was 97.1MB in the beginning and 97.1MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 924.23ms. Allocated memory is still 121.6MB. Free memory was 79.0MB in the beginning and 84.1MB in the end (delta: -5.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.21ms. Allocated memory is still 121.6MB. Free memory was 84.1MB in the beginning and 81.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.88ms. Allocated memory is still 121.6MB. Free memory was 81.6MB in the beginning and 79.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1180.01ms. Allocated memory is still 121.6MB. Free memory was 79.9MB in the beginning and 50.3MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13181.64ms. Allocated memory was 121.6MB in the beginning and 325.1MB in the end (delta: 203.4MB). Free memory was 49.6MB in the beginning and 242.0MB in the end (delta: -192.4MB). Peak memory consumption was 181.3MB. Max. memory is 16.1GB. * Witness Printer took 138.16ms. Allocated memory is still 325.1MB. Free memory was 242.0MB in the beginning and 218.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L715] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_p2_EBX=0] [L742] 0 _Bool weak$$choice0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0] [L743] 0 _Bool weak$$choice2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0] [L736] 0 int y$w_buff0; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0] [L738] 0 int y$w_buff1; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L728] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L729] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L725] 0 int y$mem_tmp; VAL [__unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L711] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L726] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L727] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L734] 0 _Bool y$read_delayed; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L717] 0 int a = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L713] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L724] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L739] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L731] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L733] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] 0 pthread_t t1004; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1004={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1004, ((void *)0), P0, ((void *)0))=-2, t1004={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] 0 pthread_t t1005; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1005, ((void *)0), P1, ((void *)0))=-1, t1004={5:0}, t1005={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] 0 pthread_t t1006; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1006, ((void *)0), P2, ((void *)0))=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004={5:0}, t1005={6:0}, t1006={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 569 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 569 mSDsluCounter, 627 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 487 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1032 IncrementalHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 140 mSDtfsCounter, 1032 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=639occurred in iteration=6, InterpolantAutomatonStates: 102, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 918 NumberOfCodeBlocks, 918 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 817 ConstructedInterpolants, 0 QuantifiedInterpolants, 3223 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 11:25:49,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5cd83a2d-fb76-43a3-9542-6e279ead9850/bin/uautomizer-tPACEb0tL8/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE