./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --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 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:39:21,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:39:21,815 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:39:21,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:39:21,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:39:21,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:39:21,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:39:21,847 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:39:21,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:39:21,850 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:39:21,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:39:21,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:39:21,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:39:21,852 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:39:21,852 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:39:21,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:39:21,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:39:21,852 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:39:21,853 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:39:21,853 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:39:21,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:39:21,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:39:21,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:39:21,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:39:21,853 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:39:21,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:39:21,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:39:21,853 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:39:21,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:39:21,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:39:21,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:39:21,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:39:21,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:39:21,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:39:21,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:39:21,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:39:21,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:39:21,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:39:21,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:39:21,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:39:21,856 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:39:21,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:39:21,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:39:21,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:39:21,857 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:39:21,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:39:21,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:39:21,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:39:21,857 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af [2024-11-28 02:39:22,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:39:22,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:39:22,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:39:22,199 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:39:22,200 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:39:22,202 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2024-11-28 02:39:25,169 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/data/4648b279a/362f2fd93c4e442b8a533e924c8a8480/FLAG659580ded [2024-11-28 02:39:25,602 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:39:25,603 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2024-11-28 02:39:25,624 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/data/4648b279a/362f2fd93c4e442b8a533e924c8a8480/FLAG659580ded [2024-11-28 02:39:25,647 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/data/4648b279a/362f2fd93c4e442b8a533e924c8a8480 [2024-11-28 02:39:25,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:39:25,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:39:25,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:39:25,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:39:25,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:39:25,661 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:39:25" (1/1) ... [2024-11-28 02:39:25,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66777090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:25, skipping insertion in model container [2024-11-28 02:39:25,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:39:25" (1/1) ... [2024-11-28 02:39:25,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:39:25,918 WARN L250 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_4166359c-6d11-4fe3-871e-2e6598ec06b6/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2024-11-28 02:39:26,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:39:26,162 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:39:26,174 WARN L250 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_4166359c-6d11-4fe3-871e-2e6598ec06b6/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2024-11-28 02:39:26,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:39:26,302 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:39:26,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:26 WrapperNode [2024-11-28 02:39:26,304 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:39:26,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:39:26,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:39:26,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:39:26,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:26" (1/1) ... [2024-11-28 02:39:26,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:26" (1/1) ... [2024-11-28 02:39:26,370 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2024-11-28 02:39:26,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:39:26,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:39:26,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:39:26,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:39:26,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:26" (1/1) ... [2024-11-28 02:39:26,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:26" (1/1) ... [2024-11-28 02:39:26,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:26" (1/1) ... [2024-11-28 02:39:26,406 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-28 02:39:26,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:26" (1/1) ... [2024-11-28 02:39:26,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:26" (1/1) ... [2024-11-28 02:39:26,413 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:26" (1/1) ... [2024-11-28 02:39:26,415 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:26" (1/1) ... [2024-11-28 02:39:26,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:26" (1/1) ... [2024-11-28 02:39:26,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:26" (1/1) ... [2024-11-28 02:39:26,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:26" (1/1) ... [2024-11-28 02:39:26,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:39:26,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:39:26,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:39:26,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:39:26,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:26" (1/1) ... [2024-11-28 02:39:26,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:39:26,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:39:26,471 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:39:26,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:39:26,505 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 02:39:26,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:39:26,505 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-28 02:39:26,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-28 02:39:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-28 02:39:26,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-28 02:39:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-28 02:39:26,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-28 02:39:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-28 02:39:26,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-28 02:39:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:39:26,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 02:39:26,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:39:26,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:39:26,508 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 02:39:26,699 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:39:26,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:39:27,104 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 02:39:27,104 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:39:27,424 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:39:27,425 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-28 02:39:27,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:39:27 BoogieIcfgContainer [2024-11-28 02:39:27,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:39:27,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:39:27,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:39:27,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:39:27,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:39:25" (1/3) ... [2024-11-28 02:39:27,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab133b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:39:27, skipping insertion in model container [2024-11-28 02:39:27,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:39:26" (2/3) ... [2024-11-28 02:39:27,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ab133b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:39:27, skipping insertion in model container [2024-11-28 02:39:27,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:39:27" (3/3) ... [2024-11-28 02:39:27,437 INFO L128 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2024-11-28 02:39:27,454 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:39:27,456 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix029_power.opt_pso.opt_rmo.opt.i that has 5 procedures, 49 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-11-28 02:39:27,456 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 02:39:27,540 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 02:39:27,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2024-11-28 02:39:27,641 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-11-28 02:39:27,643 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:39:27,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-11-28 02:39:27,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2024-11-28 02:39:27,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2024-11-28 02:39:27,666 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:39:27,688 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@e11a950, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:39:27,688 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-28 02:39:27,701 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 02:39:27,702 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-11-28 02:39:27,702 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:39:27,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:27,703 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:27,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 02:39:27,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:27,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1445825349, now seen corresponding path program 1 times [2024-11-28 02:39:27,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:27,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351828339] [2024-11-28 02:39:27,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:28,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:28,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351828339] [2024-11-28 02:39:28,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351828339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:28,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:28,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-28 02:39:28,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069257381] [2024-11-28 02:39:28,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:28,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:39:28,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:28,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:39:28,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:39:28,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 49 [2024-11-28 02:39:28,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2024-11-28 02:39:28,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:39:28,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 49 [2024-11-28 02:39:28,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:39:29,402 INFO L124 PetriNetUnfolderBase]: 1339/2305 cut-off events. [2024-11-28 02:39:29,402 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-28 02:39:29,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4285 conditions, 2305 events. 1339/2305 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16335 event pairs, 244 based on Foata normal form. 72/2310 useless extension candidates. Maximal degree in co-relation 4273. Up to 1510 conditions per place. [2024-11-28 02:39:29,446 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 31 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-28 02:39:29,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 197 flow [2024-11-28 02:39:29,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:39:29,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:39:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-28 02:39:29,465 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7687074829931972 [2024-11-28 02:39:29,467 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 113 transitions. [2024-11-28 02:39:29,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 197 flow [2024-11-28 02:39:29,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 56 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 02:39:29,481 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2024-11-28 02:39:29,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-11-28 02:39:29,489 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-11-28 02:39:29,489 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2024-11-28 02:39:29,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2024-11-28 02:39:29,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:29,490 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:29,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:39:29,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 02:39:29,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:29,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1232115996, now seen corresponding path program 1 times [2024-11-28 02:39:29,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:29,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026483565] [2024-11-28 02:39:29,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:29,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:30,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:30,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:30,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026483565] [2024-11-28 02:39:30,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026483565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:30,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:30,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:39:30,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321860059] [2024-11-28 02:39:30,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:30,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:39:30,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:30,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:39:30,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:39:30,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-28 02:39:30,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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) [2024-11-28 02:39:30,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:39:30,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-28 02:39:30,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:39:31,858 INFO L124 PetriNetUnfolderBase]: 5293/8023 cut-off events. [2024-11-28 02:39:31,858 INFO L125 PetriNetUnfolderBase]: For 388/388 co-relation queries the response was YES. [2024-11-28 02:39:31,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15871 conditions, 8023 events. 5293/8023 cut-off events. For 388/388 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 54793 event pairs, 663 based on Foata normal form. 240/7986 useless extension candidates. Maximal degree in co-relation 15861. Up to 4461 conditions per place. [2024-11-28 02:39:31,929 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 47 selfloop transitions, 6 changer transitions 1/70 dead transitions. [2024-11-28 02:39:31,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 270 flow [2024-11-28 02:39:31,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:39:31,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 02:39:31,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-11-28 02:39:31,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6938775510204082 [2024-11-28 02:39:31,934 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 4 states and 136 transitions. [2024-11-28 02:39:31,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 270 flow [2024-11-28 02:39:31,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:39:31,940 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 134 flow [2024-11-28 02:39:31,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-11-28 02:39:31,943 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-11-28 02:39:31,943 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 134 flow [2024-11-28 02:39:31,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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) [2024-11-28 02:39:31,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:31,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:39:31,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:39:31,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 02:39:31,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:31,947 INFO L85 PathProgramCache]: Analyzing trace with hash -275063556, now seen corresponding path program 1 times [2024-11-28 02:39:31,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:31,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462855521] [2024-11-28 02:39:31,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:31,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:32,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:32,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462855521] [2024-11-28 02:39:32,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462855521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:32,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:32,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 02:39:32,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460422116] [2024-11-28 02:39:32,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:32,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 02:39:32,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:32,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 02:39:32,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:39:32,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-28 02:39:32,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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) [2024-11-28 02:39:32,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:39:32,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-28 02:39:32,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:39:33,698 INFO L124 PetriNetUnfolderBase]: 4321/6591 cut-off events. [2024-11-28 02:39:33,699 INFO L125 PetriNetUnfolderBase]: For 1730/1730 co-relation queries the response was YES. [2024-11-28 02:39:33,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15141 conditions, 6591 events. 4321/6591 cut-off events. For 1730/1730 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 43188 event pairs, 249 based on Foata normal form. 228/6606 useless extension candidates. Maximal degree in co-relation 15129. Up to 3201 conditions per place. [2024-11-28 02:39:33,755 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 60 selfloop transitions, 10 changer transitions 1/87 dead transitions. [2024-11-28 02:39:33,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 87 transitions, 387 flow [2024-11-28 02:39:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 02:39:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 02:39:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2024-11-28 02:39:33,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7061224489795919 [2024-11-28 02:39:33,758 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 134 flow. Second operand 5 states and 173 transitions. [2024-11-28 02:39:33,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 87 transitions, 387 flow [2024-11-28 02:39:33,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 376 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-28 02:39:33,766 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 186 flow [2024-11-28 02:39:33,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-11-28 02:39:33,768 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2024-11-28 02:39:33,768 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 186 flow [2024-11-28 02:39:33,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 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) [2024-11-28 02:39:33,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:33,769 INFO L206 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] [2024-11-28 02:39:33,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:39:33,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 02:39:33,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash -962915426, now seen corresponding path program 1 times [2024-11-28 02:39:33,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:33,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229667637] [2024-11-28 02:39:33,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:33,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:34,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:34,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229667637] [2024-11-28 02:39:34,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229667637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:34,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:34,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:39:34,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32360717] [2024-11-28 02:39:34,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:34,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:39:34,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:34,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:39:34,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:39:34,303 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-28 02:39:34,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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) [2024-11-28 02:39:34,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:39:34,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-28 02:39:34,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:39:35,225 INFO L124 PetriNetUnfolderBase]: 2837/4315 cut-off events. [2024-11-28 02:39:35,225 INFO L125 PetriNetUnfolderBase]: For 3455/3455 co-relation queries the response was YES. [2024-11-28 02:39:35,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11213 conditions, 4315 events. 2837/4315 cut-off events. For 3455/3455 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 25192 event pairs, 115 based on Foata normal form. 172/4371 useless extension candidates. Maximal degree in co-relation 11199. Up to 1361 conditions per place. [2024-11-28 02:39:35,261 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 71 selfloop transitions, 14 changer transitions 1/102 dead transitions. [2024-11-28 02:39:35,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 510 flow [2024-11-28 02:39:35,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:39:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:39:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 208 transitions. [2024-11-28 02:39:35,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7074829931972789 [2024-11-28 02:39:35,267 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 186 flow. Second operand 6 states and 208 transitions. [2024-11-28 02:39:35,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 510 flow [2024-11-28 02:39:35,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 102 transitions, 480 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-28 02:39:35,290 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 236 flow [2024-11-28 02:39:35,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-11-28 02:39:35,293 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2024-11-28 02:39:35,293 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 236 flow [2024-11-28 02:39:35,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 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) [2024-11-28 02:39:35,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:35,294 INFO L206 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] [2024-11-28 02:39:35,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:39:35,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 02:39:35,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:35,295 INFO L85 PathProgramCache]: Analyzing trace with hash 751927760, now seen corresponding path program 1 times [2024-11-28 02:39:35,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:35,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117406017] [2024-11-28 02:39:35,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:35,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:35,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:35,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117406017] [2024-11-28 02:39:35,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117406017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:35,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:35,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:39:35,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339018093] [2024-11-28 02:39:35,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:35,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:39:35,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:35,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:39:35,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:39:35,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-11-28 02:39:35,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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) [2024-11-28 02:39:35,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:39:35,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-11-28 02:39:35,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:39:36,489 INFO L124 PetriNetUnfolderBase]: 1825/2699 cut-off events. [2024-11-28 02:39:36,489 INFO L125 PetriNetUnfolderBase]: For 3789/3789 co-relation queries the response was YES. [2024-11-28 02:39:36,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7830 conditions, 2699 events. 1825/2699 cut-off events. For 3789/3789 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 13779 event pairs, 77 based on Foata normal form. 80/2727 useless extension candidates. Maximal degree in co-relation 7815. Up to 828 conditions per place. [2024-11-28 02:39:36,510 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 64 selfloop transitions, 18 changer transitions 1/99 dead transitions. [2024-11-28 02:39:36,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 99 transitions, 508 flow [2024-11-28 02:39:36,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:39:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 02:39:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2024-11-28 02:39:36,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6559766763848397 [2024-11-28 02:39:36,512 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 236 flow. Second operand 7 states and 225 transitions. [2024-11-28 02:39:36,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 99 transitions, 508 flow [2024-11-28 02:39:36,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 462 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-28 02:39:36,533 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 246 flow [2024-11-28 02:39:36,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-11-28 02:39:36,534 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2024-11-28 02:39:36,534 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 246 flow [2024-11-28 02:39:36,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 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) [2024-11-28 02:39:36,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:36,535 INFO L206 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] [2024-11-28 02:39:36,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:39:36,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 02:39:36,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:36,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1233856089, now seen corresponding path program 1 times [2024-11-28 02:39:36,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:36,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390997953] [2024-11-28 02:39:36,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:39:36,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:39:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:38,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:38,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390997953] [2024-11-28 02:39:38,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390997953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:38,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:38,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:39:38,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828970238] [2024-11-28 02:39:38,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:38,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:39:38,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:38,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:39:38,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:39:38,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-11-28 02:39:38,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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) [2024-11-28 02:39:38,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:39:38,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-11-28 02:39:38,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:39:39,951 INFO L124 PetriNetUnfolderBase]: 4734/7416 cut-off events. [2024-11-28 02:39:39,951 INFO L125 PetriNetUnfolderBase]: For 3234/3350 co-relation queries the response was YES. [2024-11-28 02:39:39,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17423 conditions, 7416 events. 4734/7416 cut-off events. For 3234/3350 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 47852 event pairs, 973 based on Foata normal form. 16/7189 useless extension candidates. Maximal degree in co-relation 17407. Up to 3377 conditions per place. [2024-11-28 02:39:40,004 INFO L140 encePairwiseOnDemand]: 35/49 looper letters, 44 selfloop transitions, 16 changer transitions 42/128 dead transitions. [2024-11-28 02:39:40,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 128 transitions, 624 flow [2024-11-28 02:39:40,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:39:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 02:39:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 247 transitions. [2024-11-28 02:39:40,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6301020408163265 [2024-11-28 02:39:40,007 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 246 flow. Second operand 8 states and 247 transitions. [2024-11-28 02:39:40,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 128 transitions, 624 flow [2024-11-28 02:39:40,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 128 transitions, 518 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-11-28 02:39:40,078 INFO L231 Difference]: Finished difference. Result has 69 places, 67 transitions, 268 flow [2024-11-28 02:39:40,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=268, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2024-11-28 02:39:40,081 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2024-11-28 02:39:40,082 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 268 flow [2024-11-28 02:39:40,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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) [2024-11-28 02:39:40,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:40,083 INFO L206 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] [2024-11-28 02:39:40,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:39:40,083 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 02:39:40,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:40,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1645066991, now seen corresponding path program 2 times [2024-11-28 02:39:40,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:40,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43826488] [2024-11-28 02:39:40,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:39:40,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:40,263 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:39:40,264 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:39:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:41,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:41,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43826488] [2024-11-28 02:39:41,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43826488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:41,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:41,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 02:39:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302541122] [2024-11-28 02:39:41,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:41,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 02:39:41,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:41,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 02:39:41,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-28 02:39:41,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2024-11-28 02:39:41,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 268 flow. Second operand has 10 states, 10 states have (on average 23.1) internal successors, (231), 10 states have internal predecessors, (231), 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) [2024-11-28 02:39:41,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:39:41,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2024-11-28 02:39:41,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:39:44,118 INFO L124 PetriNetUnfolderBase]: 6313/10570 cut-off events. [2024-11-28 02:39:44,119 INFO L125 PetriNetUnfolderBase]: For 5129/5219 co-relation queries the response was YES. [2024-11-28 02:39:44,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27213 conditions, 10570 events. 6313/10570 cut-off events. For 5129/5219 co-relation queries the response was YES. Maximal size of possible extension queue 602. Compared 78244 event pairs, 1054 based on Foata normal form. 20/10125 useless extension candidates. Maximal degree in co-relation 27196. Up to 3155 conditions per place. [2024-11-28 02:39:44,208 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 47 selfloop transitions, 12 changer transitions 47/137 dead transitions. [2024-11-28 02:39:44,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 137 transitions, 723 flow [2024-11-28 02:39:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:39:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 02:39:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 295 transitions. [2024-11-28 02:39:44,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6020408163265306 [2024-11-28 02:39:44,213 INFO L175 Difference]: Start difference. First operand has 69 places, 67 transitions, 268 flow. Second operand 10 states and 295 transitions. [2024-11-28 02:39:44,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 137 transitions, 723 flow [2024-11-28 02:39:44,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 137 transitions, 713 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-28 02:39:44,227 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 303 flow [2024-11-28 02:39:44,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=303, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2024-11-28 02:39:44,231 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2024-11-28 02:39:44,231 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 303 flow [2024-11-28 02:39:44,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.1) internal successors, (231), 10 states have internal predecessors, (231), 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) [2024-11-28 02:39:44,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:44,233 INFO L206 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] [2024-11-28 02:39:44,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:39:44,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 02:39:44,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:44,235 INFO L85 PathProgramCache]: Analyzing trace with hash 820966403, now seen corresponding path program 3 times [2024-11-28 02:39:44,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:44,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822060007] [2024-11-28 02:39:44,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 02:39:44,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:44,412 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-28 02:39:44,412 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:39:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:45,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:45,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822060007] [2024-11-28 02:39:45,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822060007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:45,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:45,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:39:45,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995751474] [2024-11-28 02:39:45,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:45,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:39:45,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:45,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:39:45,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:39:46,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 49 [2024-11-28 02:39:46,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 303 flow. Second operand has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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) [2024-11-28 02:39:46,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:39:46,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 49 [2024-11-28 02:39:46,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:39:47,280 INFO L124 PetriNetUnfolderBase]: 4025/6808 cut-off events. [2024-11-28 02:39:47,281 INFO L125 PetriNetUnfolderBase]: For 5577/5696 co-relation queries the response was YES. [2024-11-28 02:39:47,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18791 conditions, 6808 events. 4025/6808 cut-off events. For 5577/5696 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 47168 event pairs, 989 based on Foata normal form. 66/6501 useless extension candidates. Maximal degree in co-relation 18771. Up to 2539 conditions per place. [2024-11-28 02:39:47,339 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 33 selfloop transitions, 6 changer transitions 68/133 dead transitions. [2024-11-28 02:39:47,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 133 transitions, 792 flow [2024-11-28 02:39:47,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:39:47,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 02:39:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 242 transitions. [2024-11-28 02:39:47,343 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6173469387755102 [2024-11-28 02:39:47,343 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 303 flow. Second operand 8 states and 242 transitions. [2024-11-28 02:39:47,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 133 transitions, 792 flow [2024-11-28 02:39:47,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 133 transitions, 761 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-11-28 02:39:47,352 INFO L231 Difference]: Finished difference. Result has 79 places, 56 transitions, 235 flow [2024-11-28 02:39:47,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=235, PETRI_PLACES=79, PETRI_TRANSITIONS=56} [2024-11-28 02:39:47,356 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 22 predicate places. [2024-11-28 02:39:47,359 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 56 transitions, 235 flow [2024-11-28 02:39:47,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.428571428571427) internal successors, (150), 7 states have internal predecessors, (150), 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) [2024-11-28 02:39:47,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:47,360 INFO L206 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] [2024-11-28 02:39:47,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:39:47,360 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 02:39:47,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:47,361 INFO L85 PathProgramCache]: Analyzing trace with hash -958458477, now seen corresponding path program 4 times [2024-11-28 02:39:47,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:47,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643299010] [2024-11-28 02:39:47,361 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-28 02:39:47,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:47,486 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-28 02:39:47,488 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:39:49,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:39:49,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:39:49,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643299010] [2024-11-28 02:39:49,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643299010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:39:49,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:39:49,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 02:39:49,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891067088] [2024-11-28 02:39:49,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:39:49,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 02:39:49,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:39:49,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 02:39:49,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-28 02:39:49,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 49 [2024-11-28 02:39:49,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 56 transitions, 235 flow. Second operand has 11 states, 11 states have (on average 24.727272727272727) internal successors, (272), 11 states have internal predecessors, (272), 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) [2024-11-28 02:39:49,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:39:49,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 49 [2024-11-28 02:39:49,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:39:50,874 INFO L124 PetriNetUnfolderBase]: 1867/3276 cut-off events. [2024-11-28 02:39:50,875 INFO L125 PetriNetUnfolderBase]: For 1448/1608 co-relation queries the response was YES. [2024-11-28 02:39:50,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8012 conditions, 3276 events. 1867/3276 cut-off events. For 1448/1608 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 20535 event pairs, 566 based on Foata normal form. 16/3009 useless extension candidates. Maximal degree in co-relation 7990. Up to 1389 conditions per place. [2024-11-28 02:39:50,899 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 27 selfloop transitions, 4 changer transitions 31/93 dead transitions. [2024-11-28 02:39:50,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 93 transitions, 465 flow [2024-11-28 02:39:50,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 02:39:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 02:39:50,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 245 transitions. [2024-11-28 02:39:50,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-28 02:39:50,902 INFO L175 Difference]: Start difference. First operand has 79 places, 56 transitions, 235 flow. Second operand 8 states and 245 transitions. [2024-11-28 02:39:50,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 93 transitions, 465 flow [2024-11-28 02:39:50,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 93 transitions, 444 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-28 02:39:50,907 INFO L231 Difference]: Finished difference. Result has 79 places, 55 transitions, 230 flow [2024-11-28 02:39:50,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=230, PETRI_PLACES=79, PETRI_TRANSITIONS=55} [2024-11-28 02:39:50,908 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 22 predicate places. [2024-11-28 02:39:50,909 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 55 transitions, 230 flow [2024-11-28 02:39:50,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.727272727272727) internal successors, (272), 11 states have internal predecessors, (272), 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) [2024-11-28 02:39:50,909 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:39:50,910 INFO L206 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] [2024-11-28 02:39:50,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:39:50,910 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-28 02:39:50,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:39:50,911 INFO L85 PathProgramCache]: Analyzing trace with hash -130734891, now seen corresponding path program 5 times [2024-11-28 02:39:50,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:39:50,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054890567] [2024-11-28 02:39:50,911 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-28 02:39:50,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:39:51,030 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 02:39:51,031 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-28 02:39:51,031 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:39:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:39:51,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 02:39:51,189 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 02:39:51,191 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-28 02:39:51,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-28 02:39:51,193 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-28 02:39:51,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-28 02:39:51,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-28 02:39:51,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-28 02:39:51,194 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-28 02:39:51,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:39:51,195 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-11-28 02:39:51,322 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 02:39:51,322 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 02:39:51,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:39:51 BasicIcfg [2024-11-28 02:39:51,330 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 02:39:51,330 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 02:39:51,331 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 02:39:51,331 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 02:39:51,332 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:39:27" (3/4) ... [2024-11-28 02:39:51,333 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 02:39:51,495 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9. [2024-11-28 02:39:51,560 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 02:39:51,560 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 02:39:51,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 02:39:51,562 INFO L158 Benchmark]: Toolchain (without parser) took 25909.59ms. Allocated memory was 142.6MB in the beginning and 889.2MB in the end (delta: 746.6MB). Free memory was 103.2MB in the beginning and 546.5MB in the end (delta: -443.3MB). Peak memory consumption was 303.5MB. Max. memory is 16.1GB. [2024-11-28 02:39:51,563 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:39:51,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 650.14ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 79.3MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 02:39:51,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.78ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 76.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:39:51,564 INFO L158 Benchmark]: Boogie Preprocessor took 48.49ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 73.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:39:51,565 INFO L158 Benchmark]: RCFGBuilder took 1001.53ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 88.4MB in the end (delta: -15.1MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2024-11-28 02:39:51,565 INFO L158 Benchmark]: TraceAbstraction took 23901.78ms. Allocated memory was 142.6MB in the beginning and 889.2MB in the end (delta: 746.6MB). Free memory was 88.4MB in the beginning and 570.2MB in the end (delta: -481.9MB). Peak memory consumption was 263.1MB. Max. memory is 16.1GB. [2024-11-28 02:39:51,565 INFO L158 Benchmark]: Witness Printer took 230.22ms. Allocated memory is still 889.2MB. Free memory was 570.2MB in the beginning and 546.5MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 02:39:51,567 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.72ms. Allocated memory is still 167.8MB. Free memory is still 104.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 650.14ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 79.3MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.78ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 76.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.49ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 73.3MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1001.53ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 88.4MB in the end (delta: -15.1MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. * TraceAbstraction took 23901.78ms. Allocated memory was 142.6MB in the beginning and 889.2MB in the end (delta: 746.6MB). Free memory was 88.4MB in the beginning and 570.2MB in the end (delta: -481.9MB). Peak memory consumption was 263.1MB. Max. memory is 16.1GB. * Witness Printer took 230.22ms. Allocated memory is still 889.2MB. Free memory was 570.2MB in the beginning and 546.5MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t773=-1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, y=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t773=-1, t774=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, y=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t773=-1, t774=0, t775=1, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, y=0, z=0] [L852] 0 pthread_t t776; [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t773=-1, t774=0, t775=1, t776=2, 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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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, y=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 4 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0: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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0: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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0: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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L768] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L801] 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) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 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 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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$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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773=-1, t774=0, t775=1, t776=2, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 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) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 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 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773=-1, t774=0, t775=1, t776=2, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773=-1, t774=0, t775=1, t776=2, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 83 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 707 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 666 mSDsluCounter, 392 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 349 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1596 IncrementalHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 43 mSDtfsCounter, 1596 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=7, InterpolantAutomatonStates: 59, 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, 1.2s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 241 ConstructedInterpolants, 0 QuantifiedInterpolants, 1913 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-28 02:39:51,598 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4166359c-6d11-4fe3-871e-2e6598ec06b6/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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