./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC --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 bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 22:50:32,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 22:50:32,693 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-23 22:50:32,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 22:50:32,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 22:50:32,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 22:50:32,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 22:50:32,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 22:50:32,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 22:50:32,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 22:50:32,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 22:50:32,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 22:50:32,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 22:50:32,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 22:50:32,731 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 22:50:32,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 22:50:32,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 22:50:32,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 22:50:32,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 22:50:32,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 22:50:32,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 22:50:32,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 22:50:32,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 22:50:32,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 22:50:32,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 22:50:32,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 22:50:32,733 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 22:50:32,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 22:50:32,734 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 22:50:32,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 22:50:32,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 22:50:32,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 22:50:32,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 22:50:32,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 22:50:32,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 22:50:32,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 22:50:32,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 22:50:32,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 22:50:32,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 22:50:32,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 22:50:32,736 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 22:50:32,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 22:50:32,736 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 22:50:32,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 22:50:32,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 22:50:32,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 22:50:32,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 22:50:32,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 22:50:32,737 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_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC 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 -> bdec055c4bfc04b6b0c3fc918f7b96def91dcb331178222835136af29a7feef5 [2024-11-23 22:50:33,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 22:50:33,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 22:50:33,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 22:50:33,092 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 22:50:33,093 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 22:50:33,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2024-11-23 22:50:36,220 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/data/0e8d26742/52a9765ef7ae425da03730f05c97bec3/FLAG6bb1478f3 [2024-11-23 22:50:36,575 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 22:50:36,576 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i [2024-11-23 22:50:36,606 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/data/0e8d26742/52a9765ef7ae425da03730f05c97bec3/FLAG6bb1478f3 [2024-11-23 22:50:36,628 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/data/0e8d26742/52a9765ef7ae425da03730f05c97bec3 [2024-11-23 22:50:36,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 22:50:36,635 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 22:50:36,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 22:50:36,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 22:50:36,648 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 22:50:36,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:50:36" (1/1) ... [2024-11-23 22:50:36,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a9161bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:36, skipping insertion in model container [2024-11-23 22:50:36,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:50:36" (1/1) ... [2024-11-23 22:50:36,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 22:50:36,973 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_8d865dd6-2658-4c6d-a428-c51353d4a638/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i[959,972] [2024-11-23 22:50:37,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 22:50:37,309 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 22:50:37,325 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_8d865dd6-2658-4c6d-a428-c51353d4a638/sv-benchmarks/c/pthread-wmm/safe011_power.opt_pso.opt.i[959,972] [2024-11-23 22:50:37,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 22:50:37,427 INFO L204 MainTranslator]: Completed translation [2024-11-23 22:50:37,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:37 WrapperNode [2024-11-23 22:50:37,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 22:50:37,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 22:50:37,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 22:50:37,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 22:50:37,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:37" (1/1) ... [2024-11-23 22:50:37,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:37" (1/1) ... [2024-11-23 22:50:37,481 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-11-23 22:50:37,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 22:50:37,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 22:50:37,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 22:50:37,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 22:50:37,495 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:37" (1/1) ... [2024-11-23 22:50:37,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:37" (1/1) ... [2024-11-23 22:50:37,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:37" (1/1) ... [2024-11-23 22:50:37,530 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-23 22:50:37,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:37" (1/1) ... [2024-11-23 22:50:37,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:37" (1/1) ... [2024-11-23 22:50:37,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:37" (1/1) ... [2024-11-23 22:50:37,554 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:37" (1/1) ... [2024-11-23 22:50:37,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:37" (1/1) ... [2024-11-23 22:50:37,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:37" (1/1) ... [2024-11-23 22:50:37,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:37" (1/1) ... [2024-11-23 22:50:37,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 22:50:37,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 22:50:37,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 22:50:37,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 22:50:37,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:37" (1/1) ... [2024-11-23 22:50:37,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 22:50:37,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:50:37,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 22:50:37,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 22:50:37,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-23 22:50:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 22:50:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-23 22:50:37,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-23 22:50:37,659 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-23 22:50:37,659 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-23 22:50:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-23 22:50:37,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-23 22:50:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 22:50:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-23 22:50:37,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 22:50:37,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 22:50:37,663 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-23 22:50:37,869 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 22:50:37,872 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 22:50:38,477 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-23 22:50:38,477 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 22:50:38,813 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 22:50:38,814 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-23 22:50:38,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:50:38 BoogieIcfgContainer [2024-11-23 22:50:38,815 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 22:50:38,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 22:50:38,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 22:50:38,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 22:50:38,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:50:36" (1/3) ... [2024-11-23 22:50:38,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35fbb964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:50:38, skipping insertion in model container [2024-11-23 22:50:38,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:50:37" (2/3) ... [2024-11-23 22:50:38,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35fbb964 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:50:38, skipping insertion in model container [2024-11-23 22:50:38,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:50:38" (3/3) ... [2024-11-23 22:50:38,828 INFO L128 eAbstractionObserver]: Analyzing ICFG safe011_power.opt_pso.opt.i [2024-11-23 22:50:38,848 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 22:50:38,850 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe011_power.opt_pso.opt.i that has 4 procedures, 39 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-11-23 22:50:38,854 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-23 22:50:38,941 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-23 22:50:38,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-11-23 22:50:39,027 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-11-23 22:50:39,029 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 22:50:39,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-11-23 22:50:39,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-11-23 22:50:39,040 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-11-23 22:50:39,055 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 22:50:39,077 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;@232bcbe8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 22:50:39,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-23 22:50:39,092 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-23 22:50:39,092 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-11-23 22:50:39,092 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-23 22:50:39,092 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:50:39,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-23 22:50:39,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-23 22:50:39,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:50:39,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1906582196, now seen corresponding path program 1 times [2024-11-23 22:50:39,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:50:39,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316998604] [2024-11-23 22:50:39,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:50:39,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:50:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:50:39,829 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-23 22:50:39,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:50:39,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316998604] [2024-11-23 22:50:39,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316998604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:50:39,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:50:39,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-23 22:50:39,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828725334] [2024-11-23 22:50:39,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:50:39,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 22:50:39,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:50:39,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 22:50:39,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 22:50:39,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2024-11-23 22:50:39,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-23 22:50:39,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:50:39,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2024-11-23 22:50:39,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:50:40,457 INFO L124 PetriNetUnfolderBase]: 528/983 cut-off events. [2024-11-23 22:50:40,457 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-23 22:50:40,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1831 conditions, 983 events. 528/983 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5745 event pairs, 168 based on Foata normal form. 36/998 useless extension candidates. Maximal degree in co-relation 1820. Up to 652 conditions per place. [2024-11-23 22:50:40,474 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 27 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2024-11-23 22:50:40,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 166 flow [2024-11-23 22:50:40,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 22:50:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-23 22:50:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-11-23 22:50:40,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7521367521367521 [2024-11-23 22:50:40,496 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 88 transitions. [2024-11-23 22:50:40,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 166 flow [2024-11-23 22:50:40,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-23 22:50:40,509 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-11-23 22:50:40,513 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-11-23 22:50:40,519 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-11-23 22:50:40,520 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-11-23 22:50:40,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-23 22:50:40,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:50:40,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:50:40,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-23 22:50:40,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-23 22:50:40,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:50:40,523 INFO L85 PathProgramCache]: Analyzing trace with hash -103316819, now seen corresponding path program 1 times [2024-11-23 22:50:40,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:50:40,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030842674] [2024-11-23 22:50:40,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:50:40,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:50:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:50:41,132 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-23 22:50:41,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:50:41,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030842674] [2024-11-23 22:50:41,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030842674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:50:41,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:50:41,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:50:41,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941269477] [2024-11-23 22:50:41,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:50:41,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 22:50:41,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:50:41,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 22:50:41,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 22:50:41,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-23 22:50:41,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-23 22:50:41,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:50:41,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-23 22:50:41,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:50:41,930 INFO L124 PetriNetUnfolderBase]: 983/1687 cut-off events. [2024-11-23 22:50:41,931 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-11-23 22:50:41,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3343 conditions, 1687 events. 983/1687 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10603 event pairs, 167 based on Foata normal form. 0/1642 useless extension candidates. Maximal degree in co-relation 3333. Up to 790 conditions per place. [2024-11-23 22:50:41,946 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 26 selfloop transitions, 2 changer transitions 39/79 dead transitions. [2024-11-23 22:50:41,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 79 transitions, 314 flow [2024-11-23 22:50:41,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 22:50:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-23 22:50:41,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-11-23 22:50:41,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6057692307692307 [2024-11-23 22:50:41,950 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 8 states and 189 transitions. [2024-11-23 22:50:41,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 79 transitions, 314 flow [2024-11-23 22:50:41,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-23 22:50:41,956 INFO L231 Difference]: Finished difference. Result has 52 places, 32 transitions, 86 flow [2024-11-23 22:50:41,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=86, PETRI_PLACES=52, PETRI_TRANSITIONS=32} [2024-11-23 22:50:41,957 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-11-23 22:50:41,958 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 32 transitions, 86 flow [2024-11-23 22:50:41,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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-23 22:50:41,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:50:41,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:50:41,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 22:50:41,959 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-23 22:50:41,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:50:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash 434958478, now seen corresponding path program 1 times [2024-11-23 22:50:41,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:50:41,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892040619] [2024-11-23 22:50:41,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:50:41,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:50:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:50:42,891 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-23 22:50:42,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:50:42,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892040619] [2024-11-23 22:50:42,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892040619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:50:42,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:50:42,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 22:50:42,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583486541] [2024-11-23 22:50:42,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:50:42,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 22:50:42,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:50:42,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 22:50:42,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 22:50:42,929 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-11-23 22:50:42,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 32 transitions, 86 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-23 22:50:42,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:50:42,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-11-23 22:50:42,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:50:44,489 INFO L124 PetriNetUnfolderBase]: 2326/3718 cut-off events. [2024-11-23 22:50:44,490 INFO L125 PetriNetUnfolderBase]: For 1140/1140 co-relation queries the response was YES. [2024-11-23 22:50:44,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8086 conditions, 3718 events. 2326/3718 cut-off events. For 1140/1140 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 22811 event pairs, 235 based on Foata normal form. 110/3828 useless extension candidates. Maximal degree in co-relation 8071. Up to 1473 conditions per place. [2024-11-23 22:50:44,523 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 51 selfloop transitions, 16 changer transitions 66/142 dead transitions. [2024-11-23 22:50:44,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 142 transitions, 630 flow [2024-11-23 22:50:44,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 22:50:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-23 22:50:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 293 transitions. [2024-11-23 22:50:44,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5779092702169625 [2024-11-23 22:50:44,528 INFO L175 Difference]: Start difference. First operand has 52 places, 32 transitions, 86 flow. Second operand 13 states and 293 transitions. [2024-11-23 22:50:44,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 142 transitions, 630 flow [2024-11-23 22:50:44,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 142 transitions, 574 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-11-23 22:50:44,560 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 253 flow [2024-11-23 22:50:44,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=253, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2024-11-23 22:50:44,561 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2024-11-23 22:50:44,562 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 253 flow [2024-11-23 22:50:44,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-23 22:50:44,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:50:44,562 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:50:44,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 22:50:44,563 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-23 22:50:44,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:50:44,571 INFO L85 PathProgramCache]: Analyzing trace with hash 749281358, now seen corresponding path program 2 times [2024-11-23 22:50:44,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:50:44,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294232265] [2024-11-23 22:50:44,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 22:50:44,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:50:44,604 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 22:50:44,604 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 22:50:44,909 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-23 22:50:44,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:50:44,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294232265] [2024-11-23 22:50:44,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294232265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:50:44,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:50:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 22:50:44,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81527568] [2024-11-23 22:50:44,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:50:44,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 22:50:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:50:44,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 22:50:44,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 22:50:44,926 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-23 22:50:44,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-23 22:50:44,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:50:44,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-23 22:50:44,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:50:45,959 INFO L124 PetriNetUnfolderBase]: 2147/3528 cut-off events. [2024-11-23 22:50:45,959 INFO L125 PetriNetUnfolderBase]: For 13327/13471 co-relation queries the response was YES. [2024-11-23 22:50:45,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14132 conditions, 3528 events. 2147/3528 cut-off events. For 13327/13471 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 22372 event pairs, 304 based on Foata normal form. 208/3698 useless extension candidates. Maximal degree in co-relation 14109. Up to 1402 conditions per place. [2024-11-23 22:50:45,996 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 38 selfloop transitions, 3 changer transitions 57/111 dead transitions. [2024-11-23 22:50:45,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 111 transitions, 870 flow [2024-11-23 22:50:45,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 22:50:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-23 22:50:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 182 transitions. [2024-11-23 22:50:45,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-11-23 22:50:45,998 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 253 flow. Second operand 8 states and 182 transitions. [2024-11-23 22:50:45,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 111 transitions, 870 flow [2024-11-23 22:50:46,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 111 transitions, 850 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-11-23 22:50:46,022 INFO L231 Difference]: Finished difference. Result has 67 places, 40 transitions, 222 flow [2024-11-23 22:50:46,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=67, PETRI_TRANSITIONS=40} [2024-11-23 22:50:46,024 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2024-11-23 22:50:46,024 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 40 transitions, 222 flow [2024-11-23 22:50:46,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-23 22:50:46,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:50:46,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:50:46,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 22:50:46,027 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-23 22:50:46,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:50:46,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1032686659, now seen corresponding path program 1 times [2024-11-23 22:50:46,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:50:46,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322893715] [2024-11-23 22:50:46,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:50:46,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:50:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:50:46,358 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-23 22:50:46,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:50:46,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322893715] [2024-11-23 22:50:46,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322893715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:50:46,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:50:46,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:50:46,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652221893] [2024-11-23 22:50:46,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:50:46,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 22:50:46,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:50:46,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 22:50:46,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 22:50:46,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-23 22:50:46,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 40 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-23 22:50:46,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:50:46,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-23 22:50:46,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:50:46,959 INFO L124 PetriNetUnfolderBase]: 1088/1897 cut-off events. [2024-11-23 22:50:46,960 INFO L125 PetriNetUnfolderBase]: For 7570/7616 co-relation queries the response was YES. [2024-11-23 22:50:46,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7791 conditions, 1897 events. 1088/1897 cut-off events. For 7570/7616 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11093 event pairs, 493 based on Foata normal form. 59/1924 useless extension candidates. Maximal degree in co-relation 7771. Up to 1299 conditions per place. [2024-11-23 22:50:46,979 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 37 selfloop transitions, 4 changer transitions 35/87 dead transitions. [2024-11-23 22:50:46,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 87 transitions, 698 flow [2024-11-23 22:50:46,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 22:50:46,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-23 22:50:46,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2024-11-23 22:50:46,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5860805860805861 [2024-11-23 22:50:46,981 INFO L175 Difference]: Start difference. First operand has 67 places, 40 transitions, 222 flow. Second operand 7 states and 160 transitions. [2024-11-23 22:50:46,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 87 transitions, 698 flow [2024-11-23 22:50:46,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 87 transitions, 614 flow, removed 13 selfloop flow, removed 12 redundant places. [2024-11-23 22:50:46,992 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 228 flow [2024-11-23 22:50:46,993 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2024-11-23 22:50:46,993 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2024-11-23 22:50:46,994 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 228 flow [2024-11-23 22:50:46,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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-23 22:50:46,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:50:46,994 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] [2024-11-23 22:50:46,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 22:50:46,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-23 22:50:46,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:50:46,995 INFO L85 PathProgramCache]: Analyzing trace with hash 288585306, now seen corresponding path program 1 times [2024-11-23 22:50:46,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:50:46,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140984732] [2024-11-23 22:50:46,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:50:46,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:50:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:50:47,249 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-23 22:50:47,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:50:47,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140984732] [2024-11-23 22:50:47,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140984732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:50:47,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:50:47,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 22:50:47,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816140233] [2024-11-23 22:50:47,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:50:47,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 22:50:47,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:50:47,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 22:50:47,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 22:50:47,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-23 22:50:47,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 228 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-23 22:50:47,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:50:47,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-23 22:50:47,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:50:47,958 INFO L124 PetriNetUnfolderBase]: 1359/2390 cut-off events. [2024-11-23 22:50:47,958 INFO L125 PetriNetUnfolderBase]: For 11024/11024 co-relation queries the response was YES. [2024-11-23 22:50:47,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9736 conditions, 2390 events. 1359/2390 cut-off events. For 11024/11024 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15156 event pairs, 514 based on Foata normal form. 63/2431 useless extension candidates. Maximal degree in co-relation 9719. Up to 930 conditions per place. [2024-11-23 22:50:47,986 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 38 selfloop transitions, 4 changer transitions 29/82 dead transitions. [2024-11-23 22:50:47,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 680 flow [2024-11-23 22:50:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 22:50:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-23 22:50:47,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2024-11-23 22:50:47,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5934065934065934 [2024-11-23 22:50:47,988 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 228 flow. Second operand 7 states and 162 transitions. [2024-11-23 22:50:47,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 680 flow [2024-11-23 22:50:48,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 82 transitions, 658 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-11-23 22:50:48,003 INFO L231 Difference]: Finished difference. Result has 66 places, 42 transitions, 240 flow [2024-11-23 22:50:48,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2024-11-23 22:50:48,004 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2024-11-23 22:50:48,004 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 240 flow [2024-11-23 22:50:48,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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-23 22:50:48,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:50:48,004 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-23 22:50:48,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 22:50:48,005 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-23 22:50:48,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:50:48,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1101356706, now seen corresponding path program 1 times [2024-11-23 22:50:48,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:50:48,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530113600] [2024-11-23 22:50:48,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:50:48,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:50:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:50:49,114 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-23 22:50:49,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:50:49,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530113600] [2024-11-23 22:50:49,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530113600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:50:49,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:50:49,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 22:50:49,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905075697] [2024-11-23 22:50:49,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:50:49,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 22:50:49,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:50:49,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 22:50:49,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-23 22:50:49,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-23 22:50:49,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 42 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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-23 22:50:49,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:50:49,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-23 22:50:49,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:50:50,104 INFO L124 PetriNetUnfolderBase]: 1719/3097 cut-off events. [2024-11-23 22:50:50,104 INFO L125 PetriNetUnfolderBase]: For 14356/14409 co-relation queries the response was YES. [2024-11-23 22:50:50,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11965 conditions, 3097 events. 1719/3097 cut-off events. For 14356/14409 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 20213 event pairs, 681 based on Foata normal form. 112/3131 useless extension candidates. Maximal degree in co-relation 11945. Up to 2006 conditions per place. [2024-11-23 22:50:50,132 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 43 selfloop transitions, 15 changer transitions 51/125 dead transitions. [2024-11-23 22:50:50,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 125 transitions, 958 flow [2024-11-23 22:50:50,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 22:50:50,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-23 22:50:50,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 248 transitions. [2024-11-23 22:50:50,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.578088578088578 [2024-11-23 22:50:50,135 INFO L175 Difference]: Start difference. First operand has 66 places, 42 transitions, 240 flow. Second operand 11 states and 248 transitions. [2024-11-23 22:50:50,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 125 transitions, 958 flow [2024-11-23 22:50:50,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 125 transitions, 930 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-23 22:50:50,161 INFO L231 Difference]: Finished difference. Result has 76 places, 54 transitions, 435 flow [2024-11-23 22:50:50,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=435, PETRI_PLACES=76, PETRI_TRANSITIONS=54} [2024-11-23 22:50:50,162 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2024-11-23 22:50:50,162 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 54 transitions, 435 flow [2024-11-23 22:50:50,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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-23 22:50:50,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:50:50,162 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-23 22:50:50,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 22:50:50,163 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-23 22:50:50,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:50:50,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1162614652, now seen corresponding path program 2 times [2024-11-23 22:50:50,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:50:50,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238485185] [2024-11-23 22:50:50,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 22:50:50,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:50:50,205 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 22:50:50,206 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 22:50:51,237 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-23 22:50:51,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:50:51,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238485185] [2024-11-23 22:50:51,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238485185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:50:51,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:50:51,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 22:50:51,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462855521] [2024-11-23 22:50:51,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:50:51,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 22:50:51,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:50:51,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 22:50:51,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-23 22:50:51,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-11-23 22:50:51,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 54 transitions, 435 flow. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 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-23 22:50:51,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:50:51,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-11-23 22:50:51,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:50:52,205 INFO L124 PetriNetUnfolderBase]: 1848/3225 cut-off events. [2024-11-23 22:50:52,205 INFO L125 PetriNetUnfolderBase]: For 25954/25996 co-relation queries the response was YES. [2024-11-23 22:50:52,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16119 conditions, 3225 events. 1848/3225 cut-off events. For 25954/25996 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 20429 event pairs, 767 based on Foata normal form. 135/3350 useless extension candidates. Maximal degree in co-relation 16094. Up to 2206 conditions per place. [2024-11-23 22:50:52,236 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 57 selfloop transitions, 26 changer transitions 27/121 dead transitions. [2024-11-23 22:50:52,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 121 transitions, 1285 flow [2024-11-23 22:50:52,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 22:50:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-23 22:50:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2024-11-23 22:50:52,237 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5860805860805861 [2024-11-23 22:50:52,238 INFO L175 Difference]: Start difference. First operand has 76 places, 54 transitions, 435 flow. Second operand 7 states and 160 transitions. [2024-11-23 22:50:52,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 121 transitions, 1285 flow [2024-11-23 22:50:52,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 121 transitions, 1273 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-23 22:50:52,264 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 812 flow [2024-11-23 22:50:52,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=812, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2024-11-23 22:50:52,265 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2024-11-23 22:50:52,265 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 812 flow [2024-11-23 22:50:52,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 8 states have internal predecessors, (119), 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-23 22:50:52,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:50:52,266 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] [2024-11-23 22:50:52,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 22:50:52,266 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-23 22:50:52,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:50:52,266 INFO L85 PathProgramCache]: Analyzing trace with hash 461515016, now seen corresponding path program 1 times [2024-11-23 22:50:52,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:50:52,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276015891] [2024-11-23 22:50:52,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:50:52,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:50:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:50:53,071 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-23 22:50:53,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:50:53,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276015891] [2024-11-23 22:50:53,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276015891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:50:53,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:50:53,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 22:50:53,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542813887] [2024-11-23 22:50:53,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:50:53,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 22:50:53,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:50:53,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 22:50:53,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-23 22:50:53,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-23 22:50:53,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 812 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 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-23 22:50:53,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:50:53,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-23 22:50:53,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:50:54,104 INFO L124 PetriNetUnfolderBase]: 1574/2799 cut-off events. [2024-11-23 22:50:54,105 INFO L125 PetriNetUnfolderBase]: For 29315/29449 co-relation queries the response was YES. [2024-11-23 22:50:54,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15456 conditions, 2799 events. 1574/2799 cut-off events. For 29315/29449 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17660 event pairs, 579 based on Foata normal form. 82/2808 useless extension candidates. Maximal degree in co-relation 15427. Up to 2019 conditions per place. [2024-11-23 22:50:54,133 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 69 selfloop transitions, 13 changer transitions 36/135 dead transitions. [2024-11-23 22:50:54,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 135 transitions, 1719 flow [2024-11-23 22:50:54,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 22:50:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-23 22:50:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2024-11-23 22:50:54,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5783475783475783 [2024-11-23 22:50:54,135 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 812 flow. Second operand 9 states and 203 transitions. [2024-11-23 22:50:54,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 135 transitions, 1719 flow [2024-11-23 22:50:54,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 135 transitions, 1611 flow, removed 54 selfloop flow, removed 2 redundant places. [2024-11-23 22:50:54,173 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 868 flow [2024-11-23 22:50:54,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=868, PETRI_PLACES=89, PETRI_TRANSITIONS=81} [2024-11-23 22:50:54,174 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 44 predicate places. [2024-11-23 22:50:54,174 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 868 flow [2024-11-23 22:50:54,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 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-23 22:50:54,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:50:54,175 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] [2024-11-23 22:50:54,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 22:50:54,176 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-23 22:50:54,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:50:54,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1312697072, now seen corresponding path program 2 times [2024-11-23 22:50:54,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:50:54,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117282376] [2024-11-23 22:50:54,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 22:50:54,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:50:54,219 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 22:50:54,219 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 22:50:54,329 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-23 22:50:54,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:50:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117282376] [2024-11-23 22:50:54,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117282376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:50:54,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:50:54,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 22:50:54,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001916391] [2024-11-23 22:50:54,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:50:54,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:50:54,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:50:54,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:50:54,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:50:54,342 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-23 22:50:54,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 868 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-23 22:50:54,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:50:54,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-23 22:50:54,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:50:55,217 INFO L124 PetriNetUnfolderBase]: 2923/4758 cut-off events. [2024-11-23 22:50:55,218 INFO L125 PetriNetUnfolderBase]: For 75042/75324 co-relation queries the response was YES. [2024-11-23 22:50:55,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26224 conditions, 4758 events. 2923/4758 cut-off events. For 75042/75324 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 28382 event pairs, 501 based on Foata normal form. 310/4874 useless extension candidates. Maximal degree in co-relation 26190. Up to 2473 conditions per place. [2024-11-23 22:50:55,267 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 61 selfloop transitions, 5 changer transitions 4/87 dead transitions. [2024-11-23 22:50:55,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 87 transitions, 1084 flow [2024-11-23 22:50:55,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 22:50:55,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-23 22:50:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-11-23 22:50:55,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2024-11-23 22:50:55,269 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 868 flow. Second operand 4 states and 103 transitions. [2024-11-23 22:50:55,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 87 transitions, 1084 flow [2024-11-23 22:50:55,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 87 transitions, 975 flow, removed 41 selfloop flow, removed 7 redundant places. [2024-11-23 22:50:55,317 INFO L231 Difference]: Finished difference. Result has 83 places, 62 transitions, 553 flow [2024-11-23 22:50:55,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=553, PETRI_PLACES=83, PETRI_TRANSITIONS=62} [2024-11-23 22:50:55,317 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places. [2024-11-23 22:50:55,317 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 62 transitions, 553 flow [2024-11-23 22:50:55,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-23 22:50:55,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:50:55,318 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] [2024-11-23 22:50:55,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-23 22:50:55,318 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-23 22:50:55,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:50:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1593716529, now seen corresponding path program 1 times [2024-11-23 22:50:55,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:50:55,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673451358] [2024-11-23 22:50:55,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:50:55,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:50:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:50:55,566 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-23 22:50:55,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:50:55,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673451358] [2024-11-23 22:50:55,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673451358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:50:55,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:50:55,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 22:50:55,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252216599] [2024-11-23 22:50:55,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:50:55,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 22:50:55,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:50:55,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 22:50:55,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 22:50:55,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-23 22:50:55,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 62 transitions, 553 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-23 22:50:55,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:50:55,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-23 22:50:55,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:50:56,237 INFO L124 PetriNetUnfolderBase]: 2060/3423 cut-off events. [2024-11-23 22:50:56,237 INFO L125 PetriNetUnfolderBase]: For 53620/53784 co-relation queries the response was YES. [2024-11-23 22:50:56,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18415 conditions, 3423 events. 2060/3423 cut-off events. For 53620/53784 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 19400 event pairs, 226 based on Foata normal form. 273/3542 useless extension candidates. Maximal degree in co-relation 18383. Up to 1005 conditions per place. [2024-11-23 22:50:56,268 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 67 selfloop transitions, 8 changer transitions 6/98 dead transitions. [2024-11-23 22:50:56,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 98 transitions, 1105 flow [2024-11-23 22:50:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 22:50:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-23 22:50:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2024-11-23 22:50:56,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6615384615384615 [2024-11-23 22:50:56,270 INFO L175 Difference]: Start difference. First operand has 83 places, 62 transitions, 553 flow. Second operand 5 states and 129 transitions. [2024-11-23 22:50:56,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 98 transitions, 1105 flow [2024-11-23 22:50:56,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 98 transitions, 1006 flow, removed 48 selfloop flow, removed 5 redundant places. [2024-11-23 22:50:56,298 INFO L231 Difference]: Finished difference. Result has 84 places, 63 transitions, 521 flow [2024-11-23 22:50:56,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=521, PETRI_PLACES=84, PETRI_TRANSITIONS=63} [2024-11-23 22:50:56,299 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2024-11-23 22:50:56,299 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 521 flow [2024-11-23 22:50:56,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-23 22:50:56,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:50:56,299 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-23 22:50:56,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-23 22:50:56,300 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-23 22:50:56,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:50:56,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1763995980, now seen corresponding path program 1 times [2024-11-23 22:50:56,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:50:56,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17217294] [2024-11-23 22:50:56,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:50:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:50:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:50:56,548 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-23 22:50:56,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:50:56,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17217294] [2024-11-23 22:50:56,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17217294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:50:56,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:50:56,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 22:50:56,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507138757] [2024-11-23 22:50:56,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:50:56,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 22:50:56,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:50:56,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 22:50:56,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-23 22:50:56,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-11-23 22:50:56,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 521 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-23 22:50:56,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:50:56,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-11-23 22:50:56,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:50:57,171 INFO L124 PetriNetUnfolderBase]: 1570/2617 cut-off events. [2024-11-23 22:50:57,171 INFO L125 PetriNetUnfolderBase]: For 30223/30356 co-relation queries the response was YES. [2024-11-23 22:50:57,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13463 conditions, 2617 events. 1570/2617 cut-off events. For 30223/30356 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 14631 event pairs, 188 based on Foata normal form. 177/2655 useless extension candidates. Maximal degree in co-relation 13433. Up to 930 conditions per place. [2024-11-23 22:50:57,195 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 49 selfloop transitions, 11 changer transitions 18/91 dead transitions. [2024-11-23 22:50:57,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 91 transitions, 877 flow [2024-11-23 22:50:57,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 22:50:57,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-23 22:50:57,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-11-23 22:50:57,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6068376068376068 [2024-11-23 22:50:57,197 INFO L175 Difference]: Start difference. First operand has 84 places, 63 transitions, 521 flow. Second operand 6 states and 142 transitions. [2024-11-23 22:50:57,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 91 transitions, 877 flow [2024-11-23 22:50:57,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 91 transitions, 792 flow, removed 34 selfloop flow, removed 6 redundant places. [2024-11-23 22:50:57,220 INFO L231 Difference]: Finished difference. Result has 85 places, 52 transitions, 398 flow [2024-11-23 22:50:57,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=398, PETRI_PLACES=85, PETRI_TRANSITIONS=52} [2024-11-23 22:50:57,221 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2024-11-23 22:50:57,221 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 52 transitions, 398 flow [2024-11-23 22:50:57,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-23 22:50:57,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:50:57,221 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] [2024-11-23 22:50:57,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-23 22:50:57,222 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-23 22:50:57,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:50:57,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1844194040, now seen corresponding path program 1 times [2024-11-23 22:50:57,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:50:57,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815468614] [2024-11-23 22:50:57,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:50:57,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:50:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:50:58,937 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-23 22:50:58,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:50:58,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815468614] [2024-11-23 22:50:58,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815468614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:50:58,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:50:58,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-23 22:50:58,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355338857] [2024-11-23 22:50:58,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:50:58,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 22:50:58,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:50:58,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 22:50:58,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-23 22:50:58,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-11-23 22:50:58,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 52 transitions, 398 flow. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 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-23 22:50:58,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-23 22:50:58,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-11-23 22:50:58,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-23 22:50:59,469 INFO L124 PetriNetUnfolderBase]: 656/1412 cut-off events. [2024-11-23 22:50:59,469 INFO L125 PetriNetUnfolderBase]: For 7802/7920 co-relation queries the response was YES. [2024-11-23 22:50:59,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5730 conditions, 1412 events. 656/1412 cut-off events. For 7802/7920 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8996 event pairs, 232 based on Foata normal form. 27/1329 useless extension candidates. Maximal degree in co-relation 5702. Up to 525 conditions per place. [2024-11-23 22:50:59,477 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 30 selfloop transitions, 4 changer transitions 17/74 dead transitions. [2024-11-23 22:50:59,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 74 transitions, 602 flow [2024-11-23 22:50:59,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 22:50:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-23 22:50:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-11-23 22:50:59,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5421245421245421 [2024-11-23 22:50:59,479 INFO L175 Difference]: Start difference. First operand has 85 places, 52 transitions, 398 flow. Second operand 7 states and 148 transitions. [2024-11-23 22:50:59,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 74 transitions, 602 flow [2024-11-23 22:50:59,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 74 transitions, 454 flow, removed 54 selfloop flow, removed 18 redundant places. [2024-11-23 22:50:59,496 INFO L231 Difference]: Finished difference. Result has 75 places, 49 transitions, 277 flow [2024-11-23 22:50:59,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=277, PETRI_PLACES=75, PETRI_TRANSITIONS=49} [2024-11-23 22:50:59,497 INFO L279 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2024-11-23 22:50:59,497 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 49 transitions, 277 flow [2024-11-23 22:50:59,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 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-23 22:50:59,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-23 22:50:59,498 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] [2024-11-23 22:50:59,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-23 22:50:59,498 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-23 22:50:59,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:50:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1219296802, now seen corresponding path program 2 times [2024-11-23 22:50:59,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:50:59,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287458425] [2024-11-23 22:50:59,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 22:50:59,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:50:59,573 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-23 22:50:59,573 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-23 22:50:59,573 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 22:50:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 22:50:59,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 22:50:59,697 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 22:50:59,698 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-23 22:50:59,699 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-23 22:50:59,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-23 22:50:59,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-23 22:50:59,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-23 22:50:59,700 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-23 22:50:59,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-23 22:50:59,700 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-23 22:50:59,800 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-23 22:50:59,800 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 22:50:59,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:50:59 BasicIcfg [2024-11-23 22:50:59,806 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 22:50:59,806 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 22:50:59,806 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 22:50:59,807 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 22:50:59,807 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:50:38" (3/4) ... [2024-11-23 22:50:59,808 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-23 22:50:59,931 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9. [2024-11-23 22:50:59,999 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/witness.graphml [2024-11-23 22:50:59,999 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/witness.yml [2024-11-23 22:50:59,999 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 22:51:00,000 INFO L158 Benchmark]: Toolchain (without parser) took 23366.09ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 91.4MB in the beginning and 363.3MB in the end (delta: -271.9MB). Peak memory consumption was 152.7MB. Max. memory is 16.1GB. [2024-11-23 22:51:00,000 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 117.4MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 22:51:00,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 791.73ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 67.5MB in the end (delta: 23.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 22:51:00,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.67ms. Allocated memory is still 117.4MB. Free memory was 67.5MB in the beginning and 65.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 22:51:00,001 INFO L158 Benchmark]: Boogie Preprocessor took 85.05ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 62.0MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 22:51:00,001 INFO L158 Benchmark]: RCFGBuilder took 1247.17ms. Allocated memory is still 117.4MB. Free memory was 62.0MB in the beginning and 64.5MB in the end (delta: -2.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-23 22:51:00,002 INFO L158 Benchmark]: TraceAbstraction took 20988.23ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 64.0MB in the beginning and 375.8MB in the end (delta: -311.9MB). Peak memory consumption was 113.8MB. Max. memory is 16.1GB. [2024-11-23 22:51:00,002 INFO L158 Benchmark]: Witness Printer took 193.25ms. Allocated memory is still 545.3MB. Free memory was 375.8MB in the beginning and 363.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 22:51:00,007 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.76ms. Allocated memory is still 117.4MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 791.73ms. Allocated memory is still 117.4MB. Free memory was 91.2MB in the beginning and 67.5MB in the end (delta: 23.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.67ms. Allocated memory is still 117.4MB. Free memory was 67.5MB in the beginning and 65.1MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 85.05ms. Allocated memory is still 117.4MB. Free memory was 65.1MB in the beginning and 62.0MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1247.17ms. Allocated memory is still 117.4MB. Free memory was 62.0MB in the beginning and 64.5MB in the end (delta: -2.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20988.23ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 64.0MB in the beginning and 375.8MB in the end (delta: -311.9MB). Peak memory consumption was 113.8MB. Max. memory is 16.1GB. * Witness Printer took 193.25ms. Allocated memory is still 545.3MB. Free memory was 375.8MB in the beginning and 363.3MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff0_thd3; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$read_delayed; [L727] 0 int *x$read_delayed_var; [L728] 0 int x$w_buff0; [L729] 0 _Bool x$w_buff0_used; [L730] 0 int x$w_buff1; [L731] 0 _Bool x$w_buff1_used; [L733] 0 int y = 0; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2028; [L819] FCALL, FORK 0 pthread_create(&t2028, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L820] 0 pthread_t t2029; [L821] FCALL, FORK 0 pthread_create(&t2029, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-1, t2029=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t2030; [L823] FCALL, FORK 0 pthread_create(&t2030, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L790] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L793] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L741] 1 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L744] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2028=-1, t2029=0, t2030=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, 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: 821]: 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: 823]: 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: 819]: 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 7 procedures, 64 locations, 6 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: 20.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 642 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 617 mSDsluCounter, 241 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 201 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1711 IncrementalHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 40 mSDtfsCounter, 1711 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=868occurred in iteration=9, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 242 ConstructedInterpolants, 0 QuantifiedInterpolants, 1767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-23 22:51:00,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8d865dd6-2658-4c6d-a428-c51353d4a638/bin/uautomizer-verify-LYvppIcaGC/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