./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe013_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 a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:15:51,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:15:51,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:15:51,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:15:51,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:15:51,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:15:51,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:15:51,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:15:51,821 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:15:51,825 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:15:51,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:15:51,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:15:51,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:15:51,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:15:51,828 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:15:51,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:15:51,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:15:51,829 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:15:51,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:15:51,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:15:51,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:15:51,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:15:51,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:15:51,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:15:51,831 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:15:51,831 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:15:51,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:15:51,832 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:15:51,833 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:15:51,833 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:15:51,834 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:15:51,834 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:15:51,834 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:15:51,834 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:15:51,835 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:15:51,835 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:15:51,835 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:15:51,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:15:51,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:15:51,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:15:51,836 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:15:51,836 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:15:51,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:15:51,837 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 7b294c1ec1607d3ab81534ceeb65193cc4f28ccd9d1a1422b3183b94b9b567c9 [2024-01-27 16:15:52,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:15:52,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:15:52,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:15:52,092 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:15:52,092 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:15:52,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-01-27 16:15:53,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:15:53,454 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:15:53,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-01-27 16:15:53,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9284efd/254f9774b6ca4e94adad19e9c6c14536/FLAG86e36fde5 [2024-01-27 16:15:53,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d9284efd/254f9774b6ca4e94adad19e9c6c14536 [2024-01-27 16:15:53,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:15:53,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:15:53,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:15:53,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:15:53,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:15:53,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dee8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53, skipping insertion in model container [2024-01-27 16:15:53,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,533 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:15:53,635 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-01-27 16:15:53,799 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:15:53,807 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:15:53,815 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-01-27 16:15:53,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:15:53,886 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:15:53,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53 WrapperNode [2024-01-27 16:15:53,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:15:53,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:15:53,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:15:53,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:15:53,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,959 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-01-27 16:15:53,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:15:53,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:15:53,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:15:53,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:15:53,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,983 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-27 16:15:53,983 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,992 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:53,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:15:53,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:15:53,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:15:53,996 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:15:53,997 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (1/1) ... [2024-01-27 16:15:54,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:15:54,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:15:54,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 16:15:54,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 16:15:54,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:15:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:15:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:15:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:15:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:15:54,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:15:54,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:15:54,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:15:54,120 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-01-27 16:15:54,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-01-27 16:15:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-01-27 16:15:54,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-01-27 16:15:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-01-27 16:15:54,121 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-01-27 16:15:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:15:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:15:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:15:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:15:54,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:15:54,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:15:54,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:15:54,128 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:15:54,247 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:15:54,249 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:15:54,453 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:15:54,454 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:15:54,680 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:15:54,680 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-27 16:15:54,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:15:54 BoogieIcfgContainer [2024-01-27 16:15:54,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:15:54,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:15:54,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:15:54,685 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:15:54,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:15:53" (1/3) ... [2024-01-27 16:15:54,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6397e18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:15:54, skipping insertion in model container [2024-01-27 16:15:54,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:15:53" (2/3) ... [2024-01-27 16:15:54,686 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6397e18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:15:54, skipping insertion in model container [2024-01-27 16:15:54,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:15:54" (3/3) ... [2024-01-27 16:15:54,687 INFO L112 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-01-27 16:15:54,693 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:15:54,700 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:15:54,700 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-01-27 16:15:54,701 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:15:54,736 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-01-27 16:15:54,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 40 transitions, 92 flow [2024-01-27 16:15:54,792 INFO L124 PetriNetUnfolderBase]: 1/37 cut-off events. [2024-01-27 16:15:54,792 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:15:54,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 37 events. 1/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 74 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-01-27 16:15:54,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 40 transitions, 92 flow [2024-01-27 16:15:54,800 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 37 transitions, 83 flow [2024-01-27 16:15:54,812 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:15:54,818 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@a913161, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:15:54,819 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-01-27 16:15:54,825 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:15:54,825 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2024-01-27 16:15:54,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-27 16:15:54,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:54,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-27 16:15:54,826 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:54,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:54,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1967837457, now seen corresponding path program 1 times [2024-01-27 16:15:54,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:54,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525428046] [2024-01-27 16:15:54,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:54,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:15:55,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:55,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525428046] [2024-01-27 16:15:55,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525428046] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:55,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:55,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-27 16:15:55,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778728896] [2024-01-27 16:15:55,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:55,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:15:55,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:55,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:15:55,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:15:55,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 40 [2024-01-27 16:15:55,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-01-27 16:15:55,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:55,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 40 [2024-01-27 16:15:55,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:55,484 INFO L124 PetriNetUnfolderBase]: 453/885 cut-off events. [2024-01-27 16:15:55,484 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-01-27 16:15:55,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 885 events. 453/885 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5476 event pairs, 72 based on Foata normal form. 36/896 useless extension candidates. Maximal degree in co-relation 1611. Up to 562 conditions per place. [2024-01-27 16:15:55,495 INFO L140 encePairwiseOnDemand]: 36/40 looper letters, 25 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2024-01-27 16:15:55,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 162 flow [2024-01-27 16:15:55,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:15:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:15:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-01-27 16:15:55,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-01-27 16:15:55,506 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 83 flow. Second operand 3 states and 92 transitions. [2024-01-27 16:15:55,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 162 flow [2024-01-27 16:15:55,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:15:55,511 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 78 flow [2024-01-27 16:15:55,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2024-01-27 16:15:55,517 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2024-01-27 16:15:55,517 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 78 flow [2024-01-27 16:15:55,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-01-27 16:15:55,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:55,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:15:55,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:15:55,519 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:55,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1481936323, now seen corresponding path program 1 times [2024-01-27 16:15:55,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:55,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294608301] [2024-01-27 16:15:55,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:55,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:15:55,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:55,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294608301] [2024-01-27 16:15:55,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294608301] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:55,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:55,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:15:55,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616040837] [2024-01-27 16:15:55,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:55,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:15:55,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:55,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:15:55,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:15:55,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-01-27 16:15:55,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-01-27 16:15:55,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:55,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-01-27 16:15:55,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:56,001 INFO L124 PetriNetUnfolderBase]: 1065/1924 cut-off events. [2024-01-27 16:15:56,001 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-01-27 16:15:56,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3708 conditions, 1924 events. 1065/1924 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 12279 event pairs, 147 based on Foata normal form. 80/1905 useless extension candidates. Maximal degree in co-relation 3698. Up to 865 conditions per place. [2024-01-27 16:15:56,009 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 38 selfloop transitions, 5 changer transitions 1/57 dead transitions. [2024-01-27 16:15:56,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 220 flow [2024-01-27 16:15:56,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:15:56,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:15:56,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-01-27 16:15:56,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-01-27 16:15:56,011 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 78 flow. Second operand 4 states and 110 transitions. [2024-01-27 16:15:56,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 220 flow [2024-01-27 16:15:56,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:15:56,013 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 108 flow [2024-01-27 16:15:56,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2024-01-27 16:15:56,014 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2024-01-27 16:15:56,014 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 108 flow [2024-01-27 16:15:56,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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-01-27 16:15:56,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:56,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:15:56,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:15:56,015 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:56,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:56,015 INFO L85 PathProgramCache]: Analyzing trace with hash -259339184, now seen corresponding path program 1 times [2024-01-27 16:15:56,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:56,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119153884] [2024-01-27 16:15:56,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:56,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:15:56,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:56,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119153884] [2024-01-27 16:15:56,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119153884] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:56,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:56,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:15:56,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558915862] [2024-01-27 16:15:56,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:56,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:15:56,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:56,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:15:56,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:15:56,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-01-27 16:15:56,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:56,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:56,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-01-27 16:15:56,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:56,440 INFO L124 PetriNetUnfolderBase]: 741/1332 cut-off events. [2024-01-27 16:15:56,443 INFO L125 PetriNetUnfolderBase]: For 354/354 co-relation queries the response was YES. [2024-01-27 16:15:56,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3022 conditions, 1332 events. 741/1332 cut-off events. For 354/354 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7545 event pairs, 73 based on Foata normal form. 68/1340 useless extension candidates. Maximal degree in co-relation 3010. Up to 417 conditions per place. [2024-01-27 16:15:56,448 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 48 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-01-27 16:15:56,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 70 transitions, 309 flow [2024-01-27 16:15:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:15:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:15:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2024-01-27 16:15:56,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.695 [2024-01-27 16:15:56,452 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 108 flow. Second operand 5 states and 139 transitions. [2024-01-27 16:15:56,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 70 transitions, 309 flow [2024-01-27 16:15:56,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 299 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-27 16:15:56,455 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 148 flow [2024-01-27 16:15:56,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2024-01-27 16:15:56,456 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2024-01-27 16:15:56,457 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 148 flow [2024-01-27 16:15:56,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:56,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:56,457 INFO L208 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] [2024-01-27 16:15:56,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:15:56,457 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:56,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:56,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1104549284, now seen corresponding path program 1 times [2024-01-27 16:15:56,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:56,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725906255] [2024-01-27 16:15:56,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:56,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:56,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:15:56,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:56,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725906255] [2024-01-27 16:15:56,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725906255] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:56,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:56,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:15:56,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870801984] [2024-01-27 16:15:56,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:56,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:15:56,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:56,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:15:56,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:15:56,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2024-01-27 16:15:56,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-01-27 16:15:56,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:56,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2024-01-27 16:15:56,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:56,773 INFO L124 PetriNetUnfolderBase]: 465/800 cut-off events. [2024-01-27 16:15:56,774 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES. [2024-01-27 16:15:56,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2092 conditions, 800 events. 465/800 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3700 event pairs, 59 based on Foata normal form. 36/804 useless extension candidates. Maximal degree in co-relation 2078. Up to 268 conditions per place. [2024-01-27 16:15:56,777 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 42 selfloop transitions, 11 changer transitions 1/67 dead transitions. [2024-01-27 16:15:56,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 67 transitions, 320 flow [2024-01-27 16:15:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:15:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:15:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-01-27 16:15:56,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6333333333333333 [2024-01-27 16:15:56,779 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 148 flow. Second operand 6 states and 152 transitions. [2024-01-27 16:15:56,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 67 transitions, 320 flow [2024-01-27 16:15:56,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 295 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-01-27 16:15:56,782 INFO L231 Difference]: Finished difference. Result has 53 places, 40 transitions, 162 flow [2024-01-27 16:15:56,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2024-01-27 16:15:56,783 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2024-01-27 16:15:56,783 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 162 flow [2024-01-27 16:15:56,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-01-27 16:15:56,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:56,784 INFO L208 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] [2024-01-27 16:15:56,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:15:56,784 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:56,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:56,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1717568643, now seen corresponding path program 1 times [2024-01-27 16:15:56,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:56,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11329117] [2024-01-27 16:15:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:56,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:15:56,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:56,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11329117] [2024-01-27 16:15:56,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11329117] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:56,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:56,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 16:15:56,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224371810] [2024-01-27 16:15:56,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:56,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:15:56,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:56,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:15:56,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:15:56,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-01-27 16:15:56,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:56,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:56,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-01-27 16:15:56,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:57,122 INFO L124 PetriNetUnfolderBase]: 683/1292 cut-off events. [2024-01-27 16:15:57,122 INFO L125 PetriNetUnfolderBase]: For 569/593 co-relation queries the response was YES. [2024-01-27 16:15:57,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2918 conditions, 1292 events. 683/1292 cut-off events. For 569/593 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7290 event pairs, 264 based on Foata normal form. 8/1254 useless extension candidates. Maximal degree in co-relation 2903. Up to 628 conditions per place. [2024-01-27 16:15:57,127 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 30 selfloop transitions, 5 changer transitions 11/64 dead transitions. [2024-01-27 16:15:57,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 314 flow [2024-01-27 16:15:57,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:15:57,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:15:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-01-27 16:15:57,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.61 [2024-01-27 16:15:57,129 INFO L175 Difference]: Start difference. First operand has 53 places, 40 transitions, 162 flow. Second operand 5 states and 122 transitions. [2024-01-27 16:15:57,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 314 flow [2024-01-27 16:15:57,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 64 transitions, 250 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-01-27 16:15:57,133 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 139 flow [2024-01-27 16:15:57,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-01-27 16:15:57,133 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2024-01-27 16:15:57,133 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 139 flow [2024-01-27 16:15:57,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:57,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:57,134 INFO L208 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] [2024-01-27 16:15:57,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:15:57,134 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:57,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:57,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1001895919, now seen corresponding path program 2 times [2024-01-27 16:15:57,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:57,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351056070] [2024-01-27 16:15:57,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:57,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:15:57,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:57,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351056070] [2024-01-27 16:15:57,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351056070] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:57,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:57,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-01-27 16:15:57,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095547916] [2024-01-27 16:15:57,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:57,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-01-27 16:15:57,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:57,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-01-27 16:15:57,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:15:57,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-01-27 16:15:57,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 139 flow. Second operand has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 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-01-27 16:15:57,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:57,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-01-27 16:15:57,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:58,187 INFO L124 PetriNetUnfolderBase]: 1167/2229 cut-off events. [2024-01-27 16:15:58,187 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2024-01-27 16:15:58,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4833 conditions, 2229 events. 1167/2229 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14349 event pairs, 242 based on Foata normal form. 8/2163 useless extension candidates. Maximal degree in co-relation 4819. Up to 487 conditions per place. [2024-01-27 16:15:58,196 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 51 selfloop transitions, 18 changer transitions 40/127 dead transitions. [2024-01-27 16:15:58,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 127 transitions, 599 flow [2024-01-27 16:15:58,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-27 16:15:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-01-27 16:15:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 274 transitions. [2024-01-27 16:15:58,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6227272727272727 [2024-01-27 16:15:58,197 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 139 flow. Second operand 11 states and 274 transitions. [2024-01-27 16:15:58,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 127 transitions, 599 flow [2024-01-27 16:15:58,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 576 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-01-27 16:15:58,200 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 263 flow [2024-01-27 16:15:58,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=263, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2024-01-27 16:15:58,201 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2024-01-27 16:15:58,201 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 263 flow [2024-01-27 16:15:58,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.11111111111111) internal successors, (154), 9 states have internal predecessors, (154), 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-01-27 16:15:58,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:58,201 INFO L208 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] [2024-01-27 16:15:58,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 16:15:58,201 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:58,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:58,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1152055839, now seen corresponding path program 3 times [2024-01-27 16:15:58,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:58,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033514186] [2024-01-27 16:15:58,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:58,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:15:58,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:58,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033514186] [2024-01-27 16:15:58,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033514186] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:58,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:58,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:15:58,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425435066] [2024-01-27 16:15:58,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:58,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 16:15:58,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:58,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 16:15:58,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-27 16:15:58,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2024-01-27 16:15:58,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:58,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:58,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2024-01-27 16:15:58,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:58,627 INFO L124 PetriNetUnfolderBase]: 1056/2013 cut-off events. [2024-01-27 16:15:58,628 INFO L125 PetriNetUnfolderBase]: For 1525/1525 co-relation queries the response was YES. [2024-01-27 16:15:58,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5367 conditions, 2013 events. 1056/2013 cut-off events. For 1525/1525 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 12896 event pairs, 267 based on Foata normal form. 8/1950 useless extension candidates. Maximal degree in co-relation 5345. Up to 812 conditions per place. [2024-01-27 16:15:58,638 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 30 selfloop transitions, 7 changer transitions 43/97 dead transitions. [2024-01-27 16:15:58,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 97 transitions, 608 flow [2024-01-27 16:15:58,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 16:15:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 16:15:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2024-01-27 16:15:58,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5607142857142857 [2024-01-27 16:15:58,639 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 263 flow. Second operand 7 states and 157 transitions. [2024-01-27 16:15:58,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 97 transitions, 608 flow [2024-01-27 16:15:58,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 97 transitions, 553 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-01-27 16:15:58,646 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 207 flow [2024-01-27 16:15:58,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2024-01-27 16:15:58,648 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2024-01-27 16:15:58,648 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 207 flow [2024-01-27 16:15:58,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:15:58,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:58,648 INFO L208 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] [2024-01-27 16:15:58,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:15:58,649 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:58,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:58,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1165122203, now seen corresponding path program 4 times [2024-01-27 16:15:58,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:58,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165872378] [2024-01-27 16:15:58,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:58,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:15:58,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:15:58,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:15:58,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165872378] [2024-01-27 16:15:58,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165872378] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:15:58,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:15:58,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-27 16:15:58,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352371717] [2024-01-27 16:15:58,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:15:58,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 16:15:58,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:15:58,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 16:15:58,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-01-27 16:15:58,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 40 [2024-01-27 16:15:58,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-01-27 16:15:58,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:15:58,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 40 [2024-01-27 16:15:58,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:15:58,968 INFO L124 PetriNetUnfolderBase]: 452/908 cut-off events. [2024-01-27 16:15:58,969 INFO L125 PetriNetUnfolderBase]: For 520/520 co-relation queries the response was YES. [2024-01-27 16:15:58,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 908 events. 452/908 cut-off events. For 520/520 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4660 event pairs, 189 based on Foata normal form. 8/857 useless extension candidates. Maximal degree in co-relation 2274. Up to 432 conditions per place. [2024-01-27 16:15:58,972 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 22 selfloop transitions, 4 changer transitions 23/67 dead transitions. [2024-01-27 16:15:58,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 365 flow [2024-01-27 16:15:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 16:15:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 16:15:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-01-27 16:15:58,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5791666666666667 [2024-01-27 16:15:58,976 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 207 flow. Second operand 6 states and 139 transitions. [2024-01-27 16:15:58,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 365 flow [2024-01-27 16:15:58,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 67 transitions, 319 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-01-27 16:15:58,978 INFO L231 Difference]: Finished difference. Result has 63 places, 40 transitions, 152 flow [2024-01-27 16:15:58,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=63, PETRI_TRANSITIONS=40} [2024-01-27 16:15:58,982 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2024-01-27 16:15:58,982 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 40 transitions, 152 flow [2024-01-27 16:15:58,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 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-01-27 16:15:58,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:15:58,982 INFO L208 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] [2024-01-27 16:15:58,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 16:15:58,983 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-01-27 16:15:58,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:15:58,984 INFO L85 PathProgramCache]: Analyzing trace with hash -45270099, now seen corresponding path program 5 times [2024-01-27 16:15:58,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:15:58,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108698937] [2024-01-27 16:15:58,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:15:58,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:15:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:15:59,027 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:15:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:15:59,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:15:59,093 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:15:59,094 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-01-27 16:15:59,095 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-01-27 16:15:59,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-01-27 16:15:59,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-01-27 16:15:59,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-01-27 16:15:59,096 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-01-27 16:15:59,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 16:15:59,097 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2024-01-27 16:15:59,101 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:15:59,101 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:15:59,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:15:59 BasicIcfg [2024-01-27 16:15:59,155 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:15:59,155 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:15:59,156 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:15:59,156 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:15:59,156 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:15:54" (3/4) ... [2024-01-27 16:15:59,157 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:15:59,226 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:15:59,227 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:15:59,227 INFO L158 Benchmark]: Toolchain (without parser) took 5736.94ms. Allocated memory was 163.6MB in the beginning and 371.2MB in the end (delta: 207.6MB). Free memory was 106.3MB in the beginning and 305.0MB in the end (delta: -198.8MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-01-27 16:15:59,227 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:15:59,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.26ms. Allocated memory is still 163.6MB. Free memory was 106.1MB in the beginning and 82.4MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-01-27 16:15:59,228 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.28ms. Allocated memory is still 163.6MB. Free memory was 82.4MB in the beginning and 79.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:15:59,228 INFO L158 Benchmark]: Boogie Preprocessor took 35.09ms. Allocated memory is still 163.6MB. Free memory was 79.7MB in the beginning and 76.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:15:59,228 INFO L158 Benchmark]: RCFGBuilder took 685.78ms. Allocated memory is still 163.6MB. Free memory was 76.8MB in the beginning and 116.5MB in the end (delta: -39.8MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2024-01-27 16:15:59,228 INFO L158 Benchmark]: TraceAbstraction took 4472.38ms. Allocated memory was 163.6MB in the beginning and 371.2MB in the end (delta: 207.6MB). Free memory was 116.5MB in the beginning and 316.6MB in the end (delta: -200.1MB). Peak memory consumption was 206.5MB. Max. memory is 16.1GB. [2024-01-27 16:15:59,229 INFO L158 Benchmark]: Witness Printer took 71.32ms. Allocated memory is still 371.2MB. Free memory was 316.6MB in the beginning and 305.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-01-27 16:15:59,230 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.16ms. Allocated memory is still 163.6MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.26ms. Allocated memory is still 163.6MB. Free memory was 106.1MB in the beginning and 82.4MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.28ms. Allocated memory is still 163.6MB. Free memory was 82.4MB in the beginning and 79.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.09ms. Allocated memory is still 163.6MB. Free memory was 79.7MB in the beginning and 76.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 685.78ms. Allocated memory is still 163.6MB. Free memory was 76.8MB in the beginning and 116.5MB in the end (delta: -39.8MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4472.38ms. Allocated memory was 163.6MB in the beginning and 371.2MB in the end (delta: 207.6MB). Free memory was 116.5MB in the beginning and 316.6MB in the end (delta: -200.1MB). Peak memory consumption was 206.5MB. Max. memory is 16.1GB. * Witness Printer took 71.32ms. Allocated memory is still 371.2MB. Free memory was 316.6MB in the beginning and 305.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: 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_p2_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L738] 0 int z = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2073; [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2074; [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2075; [L836] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L744] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2073={5:0}, t2074={6:0}, t2075={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L19] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] - UnprovableResult [Line: 19]: 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: 836]: 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: 834]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 66 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 394 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 369 mSDsluCounter, 189 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 908 IncrementalHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 27 mSDtfsCounter, 908 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=6, InterpolantAutomatonStates: 47, 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.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 1096 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-27 16:15:59,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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