./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/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_ce770869-1963-4665-b700-1292336b141d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/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_ce770869-1963-4665-b700-1292336b141d/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 0b6ad05084ff5d70a22ef215b05587fd59d1867832386446579778aa62df8d63 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:19:49,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:19:49,743 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 20:19:49,749 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:19:49,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:19:49,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:19:49,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:19:49,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:19:49,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:19:49,782 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:19:49,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:19:49,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:19:49,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:19:49,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:19:49,786 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:19:49,786 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:19:49,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:19:49,787 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:19:49,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:19:49,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:19:49,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:19:49,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:19:49,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:19:49,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:19:49,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:19:49,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:19:49,788 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:19:49,788 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:19:49,788 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:19:49,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:19:49,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:19:49,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:19:49,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:19:49,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:19:49,789 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:19:49,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:19:49,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:19:49,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:19:49,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:19:49,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:19:49,789 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:19:49,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:19:49,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:19:49,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:19:49,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:19:49,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:19:49,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:19:49,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:19:49,792 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_ce770869-1963-4665-b700-1292336b141d/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 -> 0b6ad05084ff5d70a22ef215b05587fd59d1867832386446579778aa62df8d63 [2024-11-27 20:19:50,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:19:50,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:19:50,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:19:50,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:19:50,257 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:19:50,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-27 20:19:53,767 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/bin/uautomizer-verify-aQ6SnzHsRB/data/59158f9bb/0dc1be70a5ce4f2bab2944d6058ebc71/FLAG0b8f0fa14 [2024-11-27 20:19:54,124 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:19:54,128 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-27 20:19:54,151 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/bin/uautomizer-verify-aQ6SnzHsRB/data/59158f9bb/0dc1be70a5ce4f2bab2944d6058ebc71/FLAG0b8f0fa14 [2024-11-27 20:19:54,176 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/bin/uautomizer-verify-aQ6SnzHsRB/data/59158f9bb/0dc1be70a5ce4f2bab2944d6058ebc71 [2024-11-27 20:19:54,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:19:54,184 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:19:54,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:19:54,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:19:54,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:19:54,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:19:54" (1/1) ... [2024-11-27 20:19:54,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc098be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:54, skipping insertion in model container [2024-11-27 20:19:54,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:19:54" (1/1) ... [2024-11-27 20:19:54,239 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:19:54,474 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_ce770869-1963-4665-b700-1292336b141d/sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-11-27 20:19:54,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:19:54,877 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:19:54,893 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_ce770869-1963-4665-b700-1292336b141d/sv-benchmarks/c/pthread-wmm/safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-11-27 20:19:54,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:19:55,048 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:19:55,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:55 WrapperNode [2024-11-27 20:19:55,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:19:55,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:19:55,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:19:55,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:19:55,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:55" (1/1) ... [2024-11-27 20:19:55,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:55" (1/1) ... [2024-11-27 20:19:55,131 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 122 [2024-11-27 20:19:55,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:19:55,132 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:19:55,132 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:19:55,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:19:55,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:55" (1/1) ... [2024-11-27 20:19:55,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:55" (1/1) ... [2024-11-27 20:19:55,148 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:55" (1/1) ... [2024-11-27 20:19:55,167 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 20:19:55,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:55" (1/1) ... [2024-11-27 20:19:55,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:55" (1/1) ... [2024-11-27 20:19:55,176 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:55" (1/1) ... [2024-11-27 20:19:55,177 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:55" (1/1) ... [2024-11-27 20:19:55,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:55" (1/1) ... [2024-11-27 20:19:55,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:55" (1/1) ... [2024-11-27 20:19:55,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:55" (1/1) ... [2024-11-27 20:19:55,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:19:55,188 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:19:55,188 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:19:55,188 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:19:55,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:55" (1/1) ... [2024-11-27 20:19:55,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:19:55,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:19:55,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:19:55,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:19:55,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-27 20:19:55,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:19:55,269 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-27 20:19:55,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-27 20:19:55,269 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-27 20:19:55,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-27 20:19:55,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:19:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-27 20:19:55,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:19:55,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:19:55,271 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 20:19:55,437 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:19:55,440 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:19:55,856 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 20:19:55,857 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:19:56,247 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:19:56,248 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 20:19:56,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:19:56 BoogieIcfgContainer [2024-11-27 20:19:56,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:19:56,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:19:56,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:19:56,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:19:56,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:19:54" (1/3) ... [2024-11-27 20:19:56,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1b6f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:19:56, skipping insertion in model container [2024-11-27 20:19:56,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:19:55" (2/3) ... [2024-11-27 20:19:56,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1b6f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:19:56, skipping insertion in model container [2024-11-27 20:19:56,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:19:56" (3/3) ... [2024-11-27 20:19:56,264 INFO L128 eAbstractionObserver]: Analyzing ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-27 20:19:56,277 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:19:56,279 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe010_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 3 procedures, 30 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2024-11-27 20:19:56,279 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 20:19:56,365 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 20:19:56,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 68 flow [2024-11-27 20:19:56,479 INFO L124 PetriNetUnfolderBase]: 1/28 cut-off events. [2024-11-27 20:19:56,483 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:19:56,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 1/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2024-11-27 20:19:56,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 30 transitions, 68 flow [2024-11-27 20:19:56,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 28 transitions, 62 flow [2024-11-27 20:19:56,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:19:56,530 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;@13568cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:19:56,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-27 20:19:56,539 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:19:56,539 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-27 20:19:56,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:19:56,540 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:56,541 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-27 20:19:56,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-27 20:19:56,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:56,550 INFO L85 PathProgramCache]: Analyzing trace with hash 9558482, now seen corresponding path program 1 times [2024-11-27 20:19:56,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:19:56,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240252328] [2024-11-27 20:19:56,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:56,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:19:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:57,242 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 20:19:57,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:19:57,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240252328] [2024-11-27 20:19:57,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240252328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:19:57,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:19:57,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-27 20:19:57,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555643140] [2024-11-27 20:19:57,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:19:57,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:19:57,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:19:57,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:19:57,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:19:57,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-27 20:19:57,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 20:19:57,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:19:57,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-27 20:19:57,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:19:57,686 INFO L124 PetriNetUnfolderBase]: 114/263 cut-off events. [2024-11-27 20:19:57,687 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-27 20:19:57,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 263 events. 114/263 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1253 event pairs, 40 based on Foata normal form. 12/267 useless extension candidates. Maximal degree in co-relation 474. Up to 172 conditions per place. [2024-11-27 20:19:57,696 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 21 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2024-11-27 20:19:57,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 131 flow [2024-11-27 20:19:57,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:19:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:19:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-11-27 20:19:57,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7444444444444445 [2024-11-27 20:19:57,725 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 62 flow. Second operand 3 states and 67 transitions. [2024-11-27 20:19:57,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 131 flow [2024-11-27 20:19:57,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:19:57,738 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 58 flow [2024-11-27 20:19:57,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2024-11-27 20:19:57,748 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2024-11-27 20:19:57,749 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 58 flow [2024-11-27 20:19:57,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 20:19:57,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:57,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:19:57,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:19:57,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-27 20:19:57,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1103627620, now seen corresponding path program 1 times [2024-11-27 20:19:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:19:57,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648076084] [2024-11-27 20:19:57,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:57,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:19:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:58,360 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 20:19:58,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:19:58,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648076084] [2024-11-27 20:19:58,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648076084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:19:58,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:19:58,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 20:19:58,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129024621] [2024-11-27 20:19:58,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:19:58,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:19:58,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:19:58,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:19:58,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:19:58,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2024-11-27 20:19:58,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 20:19:58,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:19:58,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2024-11-27 20:19:58,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:19:58,702 INFO L124 PetriNetUnfolderBase]: 163/357 cut-off events. [2024-11-27 20:19:58,705 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-27 20:19:58,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 357 events. 163/357 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1669 event pairs, 26 based on Foata normal form. 20/351 useless extension candidates. Maximal degree in co-relation 691. Up to 166 conditions per place. [2024-11-27 20:19:58,711 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 28 selfloop transitions, 4 changer transitions 1/41 dead transitions. [2024-11-27 20:19:58,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 162 flow [2024-11-27 20:19:58,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:19:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-27 20:19:58,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2024-11-27 20:19:58,714 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-27 20:19:58,715 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 58 flow. Second operand 4 states and 75 transitions. [2024-11-27 20:19:58,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 162 flow [2024-11-27 20:19:58,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:19:58,720 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 80 flow [2024-11-27 20:19:58,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2024-11-27 20:19:58,723 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2024-11-27 20:19:58,723 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 80 flow [2024-11-27 20:19:58,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 20:19:58,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:58,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:19:58,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:19:58,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-27 20:19:58,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:58,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1415869558, now seen corresponding path program 1 times [2024-11-27 20:19:58,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:19:58,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444538376] [2024-11-27 20:19:58,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:58,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:19:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:19:59,369 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 20:19:59,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:19:59,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444538376] [2024-11-27 20:19:59,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444538376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:19:59,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:19:59,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:19:59,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094320919] [2024-11-27 20:19:59,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:19:59,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:19:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:19:59,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:19:59,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:19:59,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2024-11-27 20:19:59,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 20:19:59,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:19:59,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2024-11-27 20:19:59,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:19:59,615 INFO L124 PetriNetUnfolderBase]: 86/194 cut-off events. [2024-11-27 20:19:59,616 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-11-27 20:19:59,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 194 events. 86/194 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 657 event pairs, 18 based on Foata normal form. 14/195 useless extension candidates. Maximal degree in co-relation 443. Up to 71 conditions per place. [2024-11-27 20:19:59,620 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 24 selfloop transitions, 6 changer transitions 1/39 dead transitions. [2024-11-27 20:19:59,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 171 flow [2024-11-27 20:19:59,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:19:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 20:19:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2024-11-27 20:19:59,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5533333333333333 [2024-11-27 20:19:59,626 INFO L175 Difference]: Start difference. First operand has 35 places, 27 transitions, 80 flow. Second operand 5 states and 83 transitions. [2024-11-27 20:19:59,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 171 flow [2024-11-27 20:19:59,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 162 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-27 20:19:59,632 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 96 flow [2024-11-27 20:19:59,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2024-11-27 20:19:59,634 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2024-11-27 20:19:59,635 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 96 flow [2024-11-27 20:19:59,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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 20:19:59,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:19:59,635 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:19:59,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:19:59,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-27 20:19:59,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:19:59,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1751334755, now seen corresponding path program 1 times [2024-11-27 20:19:59,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:19:59,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350304687] [2024-11-27 20:19:59,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:19:59,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:19:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:20:04,564 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 20:20:04,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:20:04,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350304687] [2024-11-27 20:20:04,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350304687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:20:04,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:20:04,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:20:04,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779789109] [2024-11-27 20:20:04,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:20:04,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:20:04,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:20:04,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:20:04,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:20:04,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2024-11-27 20:20:04,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 96 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 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 20:20:04,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:20:04,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2024-11-27 20:20:04,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:20:05,221 INFO L124 PetriNetUnfolderBase]: 110/270 cut-off events. [2024-11-27 20:20:05,221 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2024-11-27 20:20:05,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 270 events. 110/270 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1075 event pairs, 29 based on Foata normal form. 4/266 useless extension candidates. Maximal degree in co-relation 599. Up to 116 conditions per place. [2024-11-27 20:20:05,225 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 24 selfloop transitions, 10 changer transitions 12/56 dead transitions. [2024-11-27 20:20:05,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 256 flow [2024-11-27 20:20:05,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:20:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-27 20:20:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2024-11-27 20:20:05,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5074074074074074 [2024-11-27 20:20:05,228 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 96 flow. Second operand 9 states and 137 transitions. [2024-11-27 20:20:05,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 256 flow [2024-11-27 20:20:05,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 222 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-27 20:20:05,231 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 117 flow [2024-11-27 20:20:05,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=117, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2024-11-27 20:20:05,233 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2024-11-27 20:20:05,233 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 117 flow [2024-11-27 20:20:05,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 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 20:20:05,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:20:05,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:20:05,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:20:05,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-27 20:20:05,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:05,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1794110133, now seen corresponding path program 2 times [2024-11-27 20:20:05,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:20:05,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607454202] [2024-11-27 20:20:05,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 20:20:05,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:20:05,368 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-27 20:20:05,369 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 20:20:06,744 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 20:20:06,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:20:06,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607454202] [2024-11-27 20:20:06,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607454202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:20:06,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:20:06,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:20:06,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988859101] [2024-11-27 20:20:06,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:20:06,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:20:06,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:20:06,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:20:06,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:20:06,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-11-27 20:20:06,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 117 flow. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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 20:20:06,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:20:06,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-11-27 20:20:06,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:20:07,313 INFO L124 PetriNetUnfolderBase]: 198/459 cut-off events. [2024-11-27 20:20:07,313 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-11-27 20:20:07,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1057 conditions, 459 events. 198/459 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2212 event pairs, 79 based on Foata normal form. 4/449 useless extension candidates. Maximal degree in co-relation 1042. Up to 178 conditions per place. [2024-11-27 20:20:07,316 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 20 selfloop transitions, 3 changer transitions 28/60 dead transitions. [2024-11-27 20:20:07,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 296 flow [2024-11-27 20:20:07,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:20:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-27 20:20:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2024-11-27 20:20:07,318 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-27 20:20:07,318 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 117 flow. Second operand 8 states and 120 transitions. [2024-11-27 20:20:07,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 296 flow [2024-11-27 20:20:07,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 289 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-27 20:20:07,322 INFO L231 Difference]: Finished difference. Result has 50 places, 27 transitions, 99 flow [2024-11-27 20:20:07,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=99, PETRI_PLACES=50, PETRI_TRANSITIONS=27} [2024-11-27 20:20:07,323 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2024-11-27 20:20:07,323 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 99 flow [2024-11-27 20:20:07,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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 20:20:07,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:20:07,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:20:07,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:20:07,324 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-27 20:20:07,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:20:07,328 INFO L85 PathProgramCache]: Analyzing trace with hash -699724027, now seen corresponding path program 3 times [2024-11-27 20:20:07,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:20:07,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896874404] [2024-11-27 20:20:07,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 20:20:07,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:20:07,421 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-27 20:20:07,421 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-27 20:20:07,421 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:20:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:20:07,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:20:07,539 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:20:07,540 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-27 20:20:07,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-27 20:20:07,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-27 20:20:07,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-27 20:20:07,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-27 20:20:07,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:20:07,544 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-11-27 20:20:07,590 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-27 20:20:07,590 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:20:07,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:20:07 BasicIcfg [2024-11-27 20:20:07,598 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:20:07,599 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:20:07,599 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:20:07,599 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:20:07,603 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:19:56" (3/4) ... [2024-11-27 20:20:07,604 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-27 20:20:07,705 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9. [2024-11-27 20:20:07,762 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 20:20:07,765 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 20:20:07,765 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:20:07,766 INFO L158 Benchmark]: Toolchain (without parser) took 13584.66ms. Allocated memory was 117.4MB in the beginning and 318.8MB in the end (delta: 201.3MB). Free memory was 89.3MB in the beginning and 190.4MB in the end (delta: -101.1MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2024-11-27 20:20:07,767 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 83.9MB. Free memory is still 40.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:20:07,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 866.94ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 66.5MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-27 20:20:07,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.21ms. Allocated memory is still 117.4MB. Free memory was 66.5MB in the beginning and 64.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:20:07,767 INFO L158 Benchmark]: Boogie Preprocessor took 54.66ms. Allocated memory is still 117.4MB. Free memory was 64.2MB in the beginning and 61.4MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:20:07,768 INFO L158 Benchmark]: RCFGBuilder took 1062.38ms. Allocated memory is still 117.4MB. Free memory was 61.4MB in the beginning and 71.7MB in the end (delta: -10.3MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2024-11-27 20:20:07,768 INFO L158 Benchmark]: TraceAbstraction took 11345.98ms. Allocated memory was 117.4MB in the beginning and 318.8MB in the end (delta: 201.3MB). Free memory was 71.1MB in the beginning and 201.6MB in the end (delta: -130.5MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2024-11-27 20:20:07,768 INFO L158 Benchmark]: Witness Printer took 166.84ms. Allocated memory is still 318.8MB. Free memory was 201.6MB in the beginning and 190.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:20:07,772 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.53ms. Allocated memory is still 83.9MB. Free memory is still 40.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 866.94ms. Allocated memory is still 117.4MB. Free memory was 89.3MB in the beginning and 66.5MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.21ms. Allocated memory is still 117.4MB. Free memory was 66.5MB in the beginning and 64.2MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.66ms. Allocated memory is still 117.4MB. Free memory was 64.2MB in the beginning and 61.4MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1062.38ms. Allocated memory is still 117.4MB. Free memory was 61.4MB in the beginning and 71.7MB in the end (delta: -10.3MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11345.98ms. Allocated memory was 117.4MB in the beginning and 318.8MB in the end (delta: 201.3MB). Free memory was 71.1MB in the beginning and 201.6MB in the end (delta: -130.5MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. * Witness Printer took 166.84ms. Allocated memory is still 318.8MB. Free memory was 201.6MB in the beginning and 190.4MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L716] 0 int y = 0; [L717] 0 _Bool y$flush_delayed; [L718] 0 int y$mem_tmp; [L719] 0 _Bool y$r_buff0_thd0; [L720] 0 _Bool y$r_buff0_thd1; [L721] 0 _Bool y$r_buff0_thd2; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$read_delayed; [L726] 0 int *y$read_delayed_var; [L727] 0 int y$w_buff0; [L728] 0 _Bool y$w_buff0_used; [L729] 0 int y$w_buff1; [L730] 0 _Bool y$w_buff1_used; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t2009; [L793] FCALL, FORK 0 pthread_create(&t2009, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L794] 0 pthread_t t2010; [L795] FCALL, FORK 0 pthread_create(&t2010, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2009=-1, t2010=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L736] 1 y$w_buff1 = y$w_buff0 [L737] 1 y$w_buff0 = 2 [L738] 1 y$w_buff1_used = y$w_buff0_used [L739] 1 y$w_buff0_used = (_Bool)1 [L740] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L740] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L741] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L747] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L767] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L770] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L750] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L751] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L752] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L753] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L754] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009=-1, t2010=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L802] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L803] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L804] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L805] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009=-1, t2010=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 y$flush_delayed = weak$$choice2 [L811] 0 y$mem_tmp = y [L812] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L813] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L814] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L815] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L816] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L818] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L820] 0 y = y$flush_delayed ? y$mem_tmp : y [L821] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2009=-1, t2010=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 795]: 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 5 procedures, 47 locations, 5 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: 11.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 137 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 542 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 21 mSDtfsCounter, 542 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=4, InterpolantAutomatonStates: 29, 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.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 20:20:07,798 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce770869-1963-4665-b700-1292336b141d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE