./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix013.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix013.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:20:49,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:20:49,520 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 23:20:49,526 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:20:49,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:20:49,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:20:49,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:20:49,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:20:49,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:20:49,556 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:20:49,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:20:49,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:20:49,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:20:49,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:20:49,557 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:20:49,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:20:49,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:20:49,557 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:20:49,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:20:49,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:20:49,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:20:49,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:20:49,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:20:49,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:20:49,558 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:20:49,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:20:49,559 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:20:49,559 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:20:49,559 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:20:49,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:20:49,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:20:49,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:20:49,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:20:49,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:20:49,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:20:49,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:20:49,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:20:49,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:20:49,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:20:49,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:20:49,561 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:20:49,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:20:49,562 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:20:49,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:20:49,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:20:49,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:20:49,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:20:49,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:20:49,562 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_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d5aa429e9fa5fafdbda3a249edb2f84a5af4e6e0b36ce720714921f621bb137 [2024-11-27 23:20:49,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:20:49,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:20:49,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:20:49,875 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:20:49,875 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:20:49,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/mix013.opt.i [2024-11-27 23:20:52,870 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/data/87327809d/8fba59f6ac444185926e33ce6b1587d2/FLAG58725eb02 [2024-11-27 23:20:53,233 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:20:53,234 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/sv-benchmarks/c/pthread-wmm/mix013.opt.i [2024-11-27 23:20:53,263 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/data/87327809d/8fba59f6ac444185926e33ce6b1587d2/FLAG58725eb02 [2024-11-27 23:20:53,284 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/data/87327809d/8fba59f6ac444185926e33ce6b1587d2 [2024-11-27 23:20:53,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:20:53,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:20:53,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:20:53,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:20:53,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:20:53,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:20:53" (1/1) ... [2024-11-27 23:20:53,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa0dc7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53, skipping insertion in model container [2024-11-27 23:20:53,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:20:53" (1/1) ... [2024-11-27 23:20:53,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:20:53,579 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_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/sv-benchmarks/c/pthread-wmm/mix013.opt.i[944,957] [2024-11-27 23:20:53,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:20:53,873 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:20:53,884 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_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/sv-benchmarks/c/pthread-wmm/mix013.opt.i[944,957] [2024-11-27 23:20:53,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:20:53,976 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:20:53,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53 WrapperNode [2024-11-27 23:20:53,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:20:53,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:20:53,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:20:53,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:20:53,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53" (1/1) ... [2024-11-27 23:20:54,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53" (1/1) ... [2024-11-27 23:20:54,046 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2024-11-27 23:20:54,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:20:54,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:20:54,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:20:54,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:20:54,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53" (1/1) ... [2024-11-27 23:20:54,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53" (1/1) ... [2024-11-27 23:20:54,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53" (1/1) ... [2024-11-27 23:20:54,087 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-27 23:20:54,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53" (1/1) ... [2024-11-27 23:20:54,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53" (1/1) ... [2024-11-27 23:20:54,105 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53" (1/1) ... [2024-11-27 23:20:54,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53" (1/1) ... [2024-11-27 23:20:54,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53" (1/1) ... [2024-11-27 23:20:54,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53" (1/1) ... [2024-11-27 23:20:54,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53" (1/1) ... [2024-11-27 23:20:54,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:20:54,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:20:54,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:20:54,124 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:20:54,124 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53" (1/1) ... [2024-11-27 23:20:54,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:20:54,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:20:54,166 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:20:54,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:20:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-27 23:20:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:20:54,202 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-27 23:20:54,202 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-27 23:20:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-27 23:20:54,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-27 23:20:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-27 23:20:54,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-27 23:20:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-11-27 23:20:54,203 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-11-27 23:20:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:20:54,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-27 23:20:54,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:20:54,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:20:54,205 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 23:20:54,396 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:20:54,399 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:20:54,874 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 23:20:54,874 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:20:55,157 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:20:55,157 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 23:20:55,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:20:55 BoogieIcfgContainer [2024-11-27 23:20:55,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:20:55,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:20:55,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:20:55,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:20:55,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:20:53" (1/3) ... [2024-11-27 23:20:55,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc95d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:20:55, skipping insertion in model container [2024-11-27 23:20:55,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:20:53" (2/3) ... [2024-11-27 23:20:55,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cc95d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:20:55, skipping insertion in model container [2024-11-27 23:20:55,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:20:55" (3/3) ... [2024-11-27 23:20:55,168 INFO L128 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2024-11-27 23:20:55,185 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:20:55,188 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mix013.opt.i that has 5 procedures, 50 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-11-27 23:20:55,188 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 23:20:55,269 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 23:20:55,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2024-11-27 23:20:55,370 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-11-27 23:20:55,375 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 23:20:55,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 99 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2024-11-27 23:20:55,381 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2024-11-27 23:20:55,385 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2024-11-27 23:20:55,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:20:55,416 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;@1a7ab783, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:20:55,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-27 23:20:55,436 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 23:20:55,436 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-27 23:20:55,436 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 23:20:55,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:20:55,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:20:55,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-27 23:20:55,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:20:55,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1584569766, now seen corresponding path program 1 times [2024-11-27 23:20:55,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:20:55,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836580045] [2024-11-27 23:20:55,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:20:55,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:20:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:20:56,220 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-27 23:20:56,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:20:56,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836580045] [2024-11-27 23:20:56,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836580045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:20:56,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:20:56,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 23:20:56,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035708828] [2024-11-27 23:20:56,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:20:56,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 23:20:56,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:20:56,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 23:20:56,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 23:20:56,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 50 [2024-11-27 23:20:56,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-27 23:20:56,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:20:56,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 50 [2024-11-27 23:20:56,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:20:56,900 INFO L124 PetriNetUnfolderBase]: 879/1525 cut-off events. [2024-11-27 23:20:56,901 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 23:20:56,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1525 events. 879/1525 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 10688 event pairs, 159 based on Foata normal form. 60/1540 useless extension candidates. Maximal degree in co-relation 2833. Up to 1009 conditions per place. [2024-11-27 23:20:56,925 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 26 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2024-11-27 23:20:56,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 178 flow [2024-11-27 23:20:56,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 23:20:56,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 23:20:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-11-27 23:20:56,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.76 [2024-11-27 23:20:56,944 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 114 transitions. [2024-11-27 23:20:56,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 178 flow [2024-11-27 23:20:56,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 53 transitions, 174 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-27 23:20:56,956 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2024-11-27 23:20:56,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-11-27 23:20:56,963 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2024-11-27 23:20:56,965 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2024-11-27 23:20:56,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-27 23:20:56,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:20:56,966 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:20:56,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:20:56,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-27 23:20:56,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:20:56,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1004378493, now seen corresponding path program 1 times [2024-11-27 23:20:56,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:20:56,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832891346] [2024-11-27 23:20:56,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:20:56,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:20:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:20:57,431 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-27 23:20:57,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:20:57,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832891346] [2024-11-27 23:20:57,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832891346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:20:57,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:20:57,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 23:20:57,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90845887] [2024-11-27 23:20:57,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:20:57,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 23:20:57,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:20:57,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 23:20:57,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 23:20:57,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-11-27 23:20:57,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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-27 23:20:57,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:20:57,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-11-27 23:20:57,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:20:58,731 INFO L124 PetriNetUnfolderBase]: 4037/6466 cut-off events. [2024-11-27 23:20:58,732 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2024-11-27 23:20:58,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12426 conditions, 6466 events. 4037/6466 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 46295 event pairs, 603 based on Foata normal form. 216/6463 useless extension candidates. Maximal degree in co-relation 12416. Up to 3225 conditions per place. [2024-11-27 23:20:58,790 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 46 selfloop transitions, 6 changer transitions 1/71 dead transitions. [2024-11-27 23:20:58,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 270 flow [2024-11-27 23:20:58,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 23:20:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 23:20:58,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2024-11-27 23:20:58,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.715 [2024-11-27 23:20:58,793 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 143 transitions. [2024-11-27 23:20:58,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 270 flow [2024-11-27 23:20:58,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 23:20:58,797 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2024-11-27 23:20:58,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-11-27 23:20:58,799 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2024-11-27 23:20:58,799 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2024-11-27 23:20:58,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 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-27 23:20:58,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:20:58,799 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-27 23:20:58,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:20:58,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-27 23:20:58,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:20:58,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2082555623, now seen corresponding path program 1 times [2024-11-27 23:20:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:20:58,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973040223] [2024-11-27 23:20:58,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:20:58,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:20:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:20:59,074 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-27 23:20:59,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:20:59,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973040223] [2024-11-27 23:20:59,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973040223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:20:59,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:20:59,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 23:20:59,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062476313] [2024-11-27 23:20:59,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:20:59,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:20:59,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:20:59,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:20:59,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:20:59,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-11-27 23:20:59,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-27 23:20:59,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:20:59,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-11-27 23:20:59,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:21:00,088 INFO L124 PetriNetUnfolderBase]: 3433/5500 cut-off events. [2024-11-27 23:21:00,089 INFO L125 PetriNetUnfolderBase]: For 1469/1475 co-relation queries the response was YES. [2024-11-27 23:21:00,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12506 conditions, 5500 events. 3433/5500 cut-off events. For 1469/1475 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 37683 event pairs, 213 based on Foata normal form. 210/5535 useless extension candidates. Maximal degree in co-relation 12494. Up to 2433 conditions per place. [2024-11-27 23:21:00,133 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 59 selfloop transitions, 10 changer transitions 1/88 dead transitions. [2024-11-27 23:21:00,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 387 flow [2024-11-27 23:21:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:21:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 23:21:00,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2024-11-27 23:21:00,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.728 [2024-11-27 23:21:00,135 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 182 transitions. [2024-11-27 23:21:00,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 387 flow [2024-11-27 23:21:00,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 376 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-27 23:21:00,139 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2024-11-27 23:21:00,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-11-27 23:21:00,140 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2024-11-27 23:21:00,140 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2024-11-27 23:21:00,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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-27 23:21:00,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:21:00,141 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-27 23:21:00,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 23:21:00,141 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-27 23:21:00,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:21:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1661612182, now seen corresponding path program 1 times [2024-11-27 23:21:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:21:00,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316183760] [2024-11-27 23:21:00,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:21:00,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:21:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:21:00,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-27 23:21:00,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:21:00,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316183760] [2024-11-27 23:21:00,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316183760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:21:00,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:21:00,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:21:00,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890148052] [2024-11-27 23:21:00,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:21:00,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:21:00,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:21:00,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:21:00,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:21:00,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-11-27 23:21:00,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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-27 23:21:00,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:21:00,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-11-27 23:21:00,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:21:01,388 INFO L124 PetriNetUnfolderBase]: 2355/3706 cut-off events. [2024-11-27 23:21:01,388 INFO L125 PetriNetUnfolderBase]: For 3028/3040 co-relation queries the response was YES. [2024-11-27 23:21:01,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9624 conditions, 3706 events. 2355/3706 cut-off events. For 3028/3040 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 22126 event pairs, 81 based on Foata normal form. 168/3783 useless extension candidates. Maximal degree in co-relation 9610. Up to 1089 conditions per place. [2024-11-27 23:21:01,419 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 70 selfloop transitions, 14 changer transitions 1/103 dead transitions. [2024-11-27 23:21:01,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 510 flow [2024-11-27 23:21:01,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:21:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-27 23:21:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2024-11-27 23:21:01,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.73 [2024-11-27 23:21:01,421 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 219 transitions. [2024-11-27 23:21:01,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 510 flow [2024-11-27 23:21:01,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 480 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-27 23:21:01,437 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2024-11-27 23:21:01,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-11-27 23:21:01,438 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2024-11-27 23:21:01,438 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2024-11-27 23:21:01,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 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-27 23:21:01,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:21:01,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:21:01,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 23:21:01,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-27 23:21:01,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:21:01,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1809935281, now seen corresponding path program 1 times [2024-11-27 23:21:01,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:21:01,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183471736] [2024-11-27 23:21:01,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:21:01,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:21:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:21:01,799 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-27 23:21:01,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:21:01,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183471736] [2024-11-27 23:21:01,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183471736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:21:01,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:21:01,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:21:01,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038502575] [2024-11-27 23:21:01,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:21:01,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:21:01,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:21:01,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:21:01,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:21:01,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-11-27 23:21:01,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 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-27 23:21:01,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:21:01,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-11-27 23:21:01,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:21:02,400 INFO L124 PetriNetUnfolderBase]: 1527/2282 cut-off events. [2024-11-27 23:21:02,401 INFO L125 PetriNetUnfolderBase]: For 3374/3386 co-relation queries the response was YES. [2024-11-27 23:21:02,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6769 conditions, 2282 events. 1527/2282 cut-off events. For 3374/3386 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 11329 event pairs, 47 based on Foata normal form. 84/2339 useless extension candidates. Maximal degree in co-relation 6754. Up to 768 conditions per place. [2024-11-27 23:21:02,418 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 63 selfloop transitions, 18 changer transitions 1/100 dead transitions. [2024-11-27 23:21:02,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 508 flow [2024-11-27 23:21:02,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 23:21:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-27 23:21:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2024-11-27 23:21:02,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-11-27 23:21:02,420 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 238 transitions. [2024-11-27 23:21:02,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 508 flow [2024-11-27 23:21:02,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 100 transitions, 462 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-27 23:21:02,437 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2024-11-27 23:21:02,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-11-27 23:21:02,441 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2024-11-27 23:21:02,441 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2024-11-27 23:21:02,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.428571428571427) internal successors, (171), 7 states have internal predecessors, (171), 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-27 23:21:02,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:21:02,441 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:21:02,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 23:21:02,442 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-27 23:21:02,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:21:02,446 INFO L85 PathProgramCache]: Analyzing trace with hash -383780341, now seen corresponding path program 1 times [2024-11-27 23:21:02,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:21:02,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729866684] [2024-11-27 23:21:02,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:21:02,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:21:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:21:03,180 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-27 23:21:03,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:21:03,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729866684] [2024-11-27 23:21:03,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729866684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:21:03,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:21:03,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:21:03,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901938535] [2024-11-27 23:21:03,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:21:03,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:21:03,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:21:03,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:21:03,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:21:03,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2024-11-27 23:21:03,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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-27 23:21:03,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:21:03,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2024-11-27 23:21:03,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:21:04,281 INFO L124 PetriNetUnfolderBase]: 3598/6084 cut-off events. [2024-11-27 23:21:04,282 INFO L125 PetriNetUnfolderBase]: For 2937/3043 co-relation queries the response was YES. [2024-11-27 23:21:04,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14221 conditions, 6084 events. 3598/6084 cut-off events. For 2937/3043 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 41590 event pairs, 297 based on Foata normal form. 16/5877 useless extension candidates. Maximal degree in co-relation 14205. Up to 2862 conditions per place. [2024-11-27 23:21:04,343 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 54 selfloop transitions, 12 changer transitions 12/106 dead transitions. [2024-11-27 23:21:04,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 106 transitions, 526 flow [2024-11-27 23:21:04,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 23:21:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-27 23:21:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2024-11-27 23:21:04,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6257142857142857 [2024-11-27 23:21:04,346 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 7 states and 219 transitions. [2024-11-27 23:21:04,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 106 transitions, 526 flow [2024-11-27 23:21:04,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 106 transitions, 420 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-11-27 23:21:04,402 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 239 flow [2024-11-27 23:21:04,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=239, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-11-27 23:21:04,403 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 10 predicate places. [2024-11-27 23:21:04,403 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 239 flow [2024-11-27 23:21:04,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 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-27 23:21:04,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:21:04,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:21:04,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 23:21:04,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-27 23:21:04,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:21:04,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1767736663, now seen corresponding path program 2 times [2024-11-27 23:21:04,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:21:04,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053641978] [2024-11-27 23:21:04,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:21:04,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:21:04,563 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 23:21:04,565 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:21:05,009 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-27 23:21:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:21:05,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053641978] [2024-11-27 23:21:05,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053641978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:21:05,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:21:05,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 23:21:05,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986268652] [2024-11-27 23:21:05,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:21:05,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 23:21:05,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:21:05,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 23:21:05,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-27 23:21:05,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2024-11-27 23:21:05,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 239 flow. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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-27 23:21:05,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:21:05,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2024-11-27 23:21:05,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:21:06,517 INFO L124 PetriNetUnfolderBase]: 6195/10263 cut-off events. [2024-11-27 23:21:06,518 INFO L125 PetriNetUnfolderBase]: For 3638/3702 co-relation queries the response was YES. [2024-11-27 23:21:06,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24355 conditions, 10263 events. 6195/10263 cut-off events. For 3638/3702 co-relation queries the response was YES. Maximal size of possible extension queue 615. Compared 74191 event pairs, 1447 based on Foata normal form. 42/9770 useless extension candidates. Maximal degree in co-relation 24339. Up to 4609 conditions per place. [2024-11-27 23:21:06,585 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 46 selfloop transitions, 7 changer transitions 52/134 dead transitions. [2024-11-27 23:21:06,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 134 transitions, 691 flow [2024-11-27 23:21:06,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:21:06,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-27 23:21:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 249 transitions. [2024-11-27 23:21:06,587 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6225 [2024-11-27 23:21:06,587 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 239 flow. Second operand 8 states and 249 transitions. [2024-11-27 23:21:06,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 134 transitions, 691 flow [2024-11-27 23:21:06,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 134 transitions, 685 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-27 23:21:06,592 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 283 flow [2024-11-27 23:21:06,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=283, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2024-11-27 23:21:06,593 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2024-11-27 23:21:06,593 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 283 flow [2024-11-27 23:21:06,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 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-27 23:21:06,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:21:06,594 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:21:06,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 23:21:06,594 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-27 23:21:06,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:21:06,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1195343249, now seen corresponding path program 3 times [2024-11-27 23:21:06,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:21:06,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271610581] [2024-11-27 23:21:06,597 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:21:06,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:21:06,703 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-27 23:21:06,703 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:21:07,588 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-27 23:21:07,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:21:07,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271610581] [2024-11-27 23:21:07,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271610581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:21:07,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:21:07,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 23:21:07,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935327571] [2024-11-27 23:21:07,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:21:07,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 23:21:07,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:21:07,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 23:21:07,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-27 23:21:07,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2024-11-27 23:21:07,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 283 flow. Second operand has 10 states, 10 states have (on average 22.3) internal successors, (223), 10 states have internal predecessors, (223), 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-27 23:21:07,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:21:07,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2024-11-27 23:21:07,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:21:09,406 INFO L124 PetriNetUnfolderBase]: 5581/9471 cut-off events. [2024-11-27 23:21:09,407 INFO L125 PetriNetUnfolderBase]: For 5312/5350 co-relation queries the response was YES. [2024-11-27 23:21:09,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22991 conditions, 9471 events. 5581/9471 cut-off events. For 5312/5350 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 69979 event pairs, 1340 based on Foata normal form. 40/8892 useless extension candidates. Maximal degree in co-relation 22969. Up to 3279 conditions per place. [2024-11-27 23:21:09,485 INFO L140 encePairwiseOnDemand]: 40/50 looper letters, 32 selfloop transitions, 5 changer transitions 130/196 dead transitions. [2024-11-27 23:21:09,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 196 transitions, 1201 flow [2024-11-27 23:21:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 23:21:09,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-11-27 23:21:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 475 transitions. [2024-11-27 23:21:09,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2024-11-27 23:21:09,493 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 283 flow. Second operand 17 states and 475 transitions. [2024-11-27 23:21:09,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 196 transitions, 1201 flow [2024-11-27 23:21:09,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 196 transitions, 1155 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-11-27 23:21:09,525 INFO L231 Difference]: Finished difference. Result has 95 places, 59 transitions, 266 flow [2024-11-27 23:21:09,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=266, PETRI_PLACES=95, PETRI_TRANSITIONS=59} [2024-11-27 23:21:09,526 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 37 predicate places. [2024-11-27 23:21:09,526 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 59 transitions, 266 flow [2024-11-27 23:21:09,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.3) internal successors, (223), 10 states have internal predecessors, (223), 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-27 23:21:09,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:21:09,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:21:09,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 23:21:09,530 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-27 23:21:09,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:21:09,531 INFO L85 PathProgramCache]: Analyzing trace with hash -901307187, now seen corresponding path program 4 times [2024-11-27 23:21:09,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:21:09,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046344492] [2024-11-27 23:21:09,531 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 23:21:09,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:21:09,575 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 23:21:09,576 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:21:09,912 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-27 23:21:09,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:21:09,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046344492] [2024-11-27 23:21:09,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046344492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:21:09,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:21:09,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 23:21:09,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151538406] [2024-11-27 23:21:09,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:21:09,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 23:21:09,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:21:09,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 23:21:09,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 23:21:09,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-11-27 23:21:09,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 59 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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-27 23:21:09,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:21:09,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-11-27 23:21:09,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:21:10,614 INFO L124 PetriNetUnfolderBase]: 2234/4125 cut-off events. [2024-11-27 23:21:10,614 INFO L125 PetriNetUnfolderBase]: For 6251/6305 co-relation queries the response was YES. [2024-11-27 23:21:10,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9992 conditions, 4125 events. 2234/4125 cut-off events. For 6251/6305 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 28608 event pairs, 512 based on Foata normal form. 16/3812 useless extension candidates. Maximal degree in co-relation 9962. Up to 1324 conditions per place. [2024-11-27 23:21:10,651 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 28 selfloop transitions, 1 changer transitions 31/90 dead transitions. [2024-11-27 23:21:10,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 458 flow [2024-11-27 23:21:10,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 23:21:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-27 23:21:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2024-11-27 23:21:10,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6114285714285714 [2024-11-27 23:21:10,654 INFO L175 Difference]: Start difference. First operand has 95 places, 59 transitions, 266 flow. Second operand 7 states and 214 transitions. [2024-11-27 23:21:10,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 458 flow [2024-11-27 23:21:10,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 90 transitions, 406 flow, removed 21 selfloop flow, removed 12 redundant places. [2024-11-27 23:21:10,678 INFO L231 Difference]: Finished difference. Result has 80 places, 54 transitions, 197 flow [2024-11-27 23:21:10,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=197, PETRI_PLACES=80, PETRI_TRANSITIONS=54} [2024-11-27 23:21:10,678 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 22 predicate places. [2024-11-27 23:21:10,679 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 54 transitions, 197 flow [2024-11-27 23:21:10,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 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-27 23:21:10,680 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:21:10,680 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:21:10,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 23:21:10,681 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-27 23:21:10,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:21:10,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1057607673, now seen corresponding path program 5 times [2024-11-27 23:21:10,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:21:10,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782575388] [2024-11-27 23:21:10,683 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-27 23:21:10,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:21:10,764 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 23:21:10,765 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:21:12,759 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-27 23:21:12,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:21:12,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782575388] [2024-11-27 23:21:12,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782575388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:21:12,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:21:12,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 23:21:12,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212170191] [2024-11-27 23:21:12,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:21:12,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 23:21:12,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:21:12,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 23:21:12,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:21:12,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2024-11-27 23:21:12,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 54 transitions, 197 flow. Second operand has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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-27 23:21:12,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 23:21:12,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2024-11-27 23:21:12,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 23:21:13,544 INFO L124 PetriNetUnfolderBase]: 1203/2302 cut-off events. [2024-11-27 23:21:13,544 INFO L125 PetriNetUnfolderBase]: For 246/250 co-relation queries the response was YES. [2024-11-27 23:21:13,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4783 conditions, 2302 events. 1203/2302 cut-off events. For 246/250 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 14666 event pairs, 392 based on Foata normal form. 16/2103 useless extension candidates. Maximal degree in co-relation 4760. Up to 756 conditions per place. [2024-11-27 23:21:13,565 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 29 selfloop transitions, 5 changer transitions 12/78 dead transitions. [2024-11-27 23:21:13,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 78 transitions, 345 flow [2024-11-27 23:21:13,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:21:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-27 23:21:13,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 272 transitions. [2024-11-27 23:21:13,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6044444444444445 [2024-11-27 23:21:13,568 INFO L175 Difference]: Start difference. First operand has 80 places, 54 transitions, 197 flow. Second operand 9 states and 272 transitions. [2024-11-27 23:21:13,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 78 transitions, 345 flow [2024-11-27 23:21:13,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 78 transitions, 322 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-11-27 23:21:13,574 INFO L231 Difference]: Finished difference. Result has 79 places, 55 transitions, 205 flow [2024-11-27 23:21:13,575 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=205, PETRI_PLACES=79, PETRI_TRANSITIONS=55} [2024-11-27 23:21:13,576 INFO L279 CegarLoopForPetriNet]: 58 programPoint places, 21 predicate places. [2024-11-27 23:21:13,578 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 55 transitions, 205 flow [2024-11-27 23:21:13,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.0) internal successors, (243), 9 states have internal predecessors, (243), 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-27 23:21:13,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 23:21:13,579 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:21:13,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 23:21:13,579 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-27 23:21:13,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:21:13,580 INFO L85 PathProgramCache]: Analyzing trace with hash 300668231, now seen corresponding path program 6 times [2024-11-27 23:21:13,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:21:13,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680442685] [2024-11-27 23:21:13,581 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-27 23:21:13,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:21:13,696 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-27 23:21:13,697 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-27 23:21:13,697 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 23:21:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:21:13,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 23:21:13,852 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 23:21:13,854 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-11-27 23:21:13,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-27 23:21:13,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-11-27 23:21:13,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-27 23:21:13,856 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-27 23:21:13,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-27 23:21:13,858 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-27 23:21:13,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 23:21:13,859 INFO L422 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-11-27 23:21:13,991 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-27 23:21:13,991 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 23:21:14,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:21:14 BasicIcfg [2024-11-27 23:21:14,000 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 23:21:14,001 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 23:21:14,001 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 23:21:14,001 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 23:21:14,002 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:20:55" (3/4) ... [2024-11-27 23:21:14,004 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-27 23:21:14,149 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9. [2024-11-27 23:21:14,213 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 23:21:14,213 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 23:21:14,213 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 23:21:14,214 INFO L158 Benchmark]: Toolchain (without parser) took 20926.41ms. Allocated memory was 142.6MB in the beginning and 654.3MB in the end (delta: 511.7MB). Free memory was 117.9MB in the beginning and 559.8MB in the end (delta: -441.9MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2024-11-27 23:21:14,215 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 142.6MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:21:14,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 686.01ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 93.5MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 23:21:14,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.64ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 90.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:21:14,215 INFO L158 Benchmark]: Boogie Preprocessor took 75.48ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 87.2MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:21:14,216 INFO L158 Benchmark]: RCFGBuilder took 1035.56ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 83.6MB in the end (delta: 3.6MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2024-11-27 23:21:14,216 INFO L158 Benchmark]: TraceAbstraction took 18839.72ms. Allocated memory was 142.6MB in the beginning and 654.3MB in the end (delta: 511.7MB). Free memory was 83.0MB in the beginning and 580.8MB in the end (delta: -497.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-27 23:21:14,216 INFO L158 Benchmark]: Witness Printer took 212.47ms. Allocated memory is still 654.3MB. Free memory was 580.8MB in the beginning and 559.8MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 23:21:14,218 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.26ms. Allocated memory is still 142.6MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 686.01ms. Allocated memory is still 142.6MB. Free memory was 117.6MB in the beginning and 93.5MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.64ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 90.9MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.48ms. Allocated memory is still 142.6MB. Free memory was 90.9MB in the beginning and 87.2MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1035.56ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 83.6MB in the end (delta: 3.6MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18839.72ms. Allocated memory was 142.6MB in the beginning and 654.3MB in the end (delta: 511.7MB). Free memory was 83.0MB in the beginning and 580.8MB in the end (delta: -497.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Witness Printer took 212.47ms. Allocated memory is still 654.3MB. Free memory was 580.8MB in the beginning and 559.8MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-3, t326=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-3, t326=-2, t327=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t325=-3, t326=-2, t327=-1, t328=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EBX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-3, t326=-2, t327=-1, t328=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-3, t326=-2, t327=-1, t328=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325=-3, t326=-2, t327=-1, t328=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - 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: 878]: 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: 876]: 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: 872]: 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: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 774 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 750 mSDsluCounter, 315 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 278 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1738 IncrementalHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 37 mSDtfsCounter, 1738 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=7, InterpolantAutomatonStates: 73, 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.9s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 333 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 285 ConstructedInterpolants, 0 QuantifiedInterpolants, 2260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-27 23:21:14,247 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad6e3e8f-576a-4a91-98b0-7a78910ecee6/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE