./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/mix046.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 f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:27:35,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:27:36,050 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:27:36,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:27:36,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:27:36,089 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:27:36,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:27:36,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:27:36,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:27:36,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:27:36,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:27:36,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:27:36,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:27:36,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:27:36,101 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:27:36,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:27:36,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:27:36,102 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:27:36,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:27:36,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:27:36,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:27:36,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:27:36,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:27:36,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:27:36,104 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:27:36,104 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:27:36,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:27:36,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:27:36,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:27:36,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:27:36,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:27:36,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:27:36,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:27:36,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:27:36,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:27:36,107 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:27:36,107 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:27:36,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:27:36,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:27:36,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:27:36,108 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:27:36,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:27:36,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:27:36,109 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 -> f69f777f524a62a415fc7cacc9442c44e05883e29c36815b4e0d58199826b331 [2024-06-27 17:27:36,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:27:36,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:27:36,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:27:36,412 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:27:36,412 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:27:36,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2024-06-27 17:27:37,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:27:37,748 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:27:37,748 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.opt.i [2024-06-27 17:27:37,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/405c72220/167b81917dfa464b9371e895026a0ed0/FLAG49872df83 [2024-06-27 17:27:37,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/405c72220/167b81917dfa464b9371e895026a0ed0 [2024-06-27 17:27:37,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:27:37,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:27:37,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:27:37,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:27:37,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:27:37,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:27:37" (1/1) ... [2024-06-27 17:27:37,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a4c324 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:27:37, skipping insertion in model container [2024-06-27 17:27:37,794 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:27:37" (1/1) ... [2024-06-27 17:27:37,831 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:27:37,969 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.opt.i[944,957] [2024-06-27 17:27:38,208 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:27:38,220 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:27:38,233 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046.opt.i[944,957] [2024-06-27 17:27:38,279 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:27:38,315 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:27:38,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:27:38 WrapperNode [2024-06-27 17:27:38,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:27:38,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:27:38,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:27:38,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:27:38,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:27:38" (1/1) ... [2024-06-27 17:27:38,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:27:38" (1/1) ... [2024-06-27 17:27:38,356 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 153 [2024-06-27 17:27:38,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:27:38,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:27:38,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:27:38,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:27:38,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:27:38" (1/1) ... [2024-06-27 17:27:38,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:27:38" (1/1) ... [2024-06-27 17:27:38,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:27:38" (1/1) ... [2024-06-27 17:27:38,402 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 17:27:38,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:27:38" (1/1) ... [2024-06-27 17:27:38,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:27:38" (1/1) ... [2024-06-27 17:27:38,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:27:38" (1/1) ... [2024-06-27 17:27:38,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:27:38" (1/1) ... [2024-06-27 17:27:38,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:27:38" (1/1) ... [2024-06-27 17:27:38,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:27:38" (1/1) ... [2024-06-27 17:27:38,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:27:38,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:27:38,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:27:38,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:27:38,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:27:38" (1/1) ... [2024-06-27 17:27:38,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:27:38,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:27:38,462 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-06-27 17:27:38,479 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-06-27 17:27:38,518 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:27:38,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:27:38,518 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 17:27:38,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 17:27:38,518 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 17:27:38,518 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 17:27:38,520 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 17:27:38,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 17:27:38,520 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 17:27:38,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 17:27:38,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:27:38,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:27:38,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:27:38,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:27:38,523 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:27:38,667 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:27:38,669 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:27:38,886 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:27:38,886 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:27:39,000 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:27:39,001 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 17:27:39,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:27:39 BoogieIcfgContainer [2024-06-27 17:27:39,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:27:39,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:27:39,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:27:39,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:27:39,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:27:37" (1/3) ... [2024-06-27 17:27:39,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a1651c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:27:39, skipping insertion in model container [2024-06-27 17:27:39,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:27:38" (2/3) ... [2024-06-27 17:27:39,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63a1651c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:27:39, skipping insertion in model container [2024-06-27 17:27:39,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:27:39" (3/3) ... [2024-06-27 17:27:39,010 INFO L112 eAbstractionObserver]: Analyzing ICFG mix046.opt.i [2024-06-27 17:27:39,016 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:27:39,022 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:27:39,023 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-27 17:27:39,023 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:27:39,083 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 17:27:39,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 50 transitions, 116 flow [2024-06-27 17:27:39,153 INFO L124 PetriNetUnfolderBase]: 1/46 cut-off events. [2024-06-27 17:27:39,154 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:27:39,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 46 events. 1/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2024-06-27 17:27:39,160 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 50 transitions, 116 flow [2024-06-27 17:27:39,163 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 46 transitions, 104 flow [2024-06-27 17:27:39,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:27:39,179 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;@68b3125a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:27:39,179 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 17:27:39,208 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:27:39,208 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-06-27 17:27:39,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:27:39,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:27:39,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:27:39,210 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:27:39,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:27:39,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1408845310, now seen corresponding path program 1 times [2024-06-27 17:27:39,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:27:39,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422291891] [2024-06-27 17:27:39,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:27:39,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:27:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:27:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:27:39,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:27:39,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422291891] [2024-06-27 17:27:39,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422291891] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:27:39,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:27:39,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 17:27:39,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826805353] [2024-06-27 17:27:39,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:27:39,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:27:39,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:27:39,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:27:39,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:27:39,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 50 [2024-06-27 17:27:39,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:27:39,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:27:39,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 50 [2024-06-27 17:27:39,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:27:40,026 INFO L124 PetriNetUnfolderBase]: 815/1615 cut-off events. [2024-06-27 17:27:40,026 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:27:40,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2847 conditions, 1615 events. 815/1615 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11808 event pairs, 179 based on Foata normal form. 48/1609 useless extension candidates. Maximal degree in co-relation 2835. Up to 889 conditions per place. [2024-06-27 17:27:40,043 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 27 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2024-06-27 17:27:40,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 54 transitions, 182 flow [2024-06-27 17:27:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:27:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:27:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-06-27 17:27:40,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-06-27 17:27:40,056 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 115 transitions. [2024-06-27 17:27:40,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 54 transitions, 182 flow [2024-06-27 17:27:40,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 178 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 17:27:40,064 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 98 flow [2024-06-27 17:27:40,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-06-27 17:27:40,069 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2024-06-27 17:27:40,069 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 98 flow [2024-06-27 17:27:40,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:27:40,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:27:40,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:27:40,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:27:40,070 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:27:40,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:27:40,072 INFO L85 PathProgramCache]: Analyzing trace with hash 931124390, now seen corresponding path program 1 times [2024-06-27 17:27:40,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:27:40,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809775611] [2024-06-27 17:27:40,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:27:40,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:27:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:27:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:27:40,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:27:40,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809775611] [2024-06-27 17:27:40,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809775611] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:27:40,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:27:40,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:27:40,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799459506] [2024-06-27 17:27:40,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:27:40,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:27:40,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:27:40,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:27:40,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:27:40,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-06-27 17:27:40,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-06-27 17:27:40,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:27:40,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-06-27 17:27:40,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:27:40,923 INFO L124 PetriNetUnfolderBase]: 3857/5905 cut-off events. [2024-06-27 17:27:40,924 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2024-06-27 17:27:40,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11649 conditions, 5905 events. 3857/5905 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 39444 event pairs, 536 based on Foata normal form. 180/5891 useless extension candidates. Maximal degree in co-relation 11639. Up to 3346 conditions per place. [2024-06-27 17:27:40,956 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 44 selfloop transitions, 6 changer transitions 1/69 dead transitions. [2024-06-27 17:27:40,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 69 transitions, 262 flow [2024-06-27 17:27:40,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:27:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:27:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2024-06-27 17:27:40,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.705 [2024-06-27 17:27:40,958 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 98 flow. Second operand 4 states and 141 transitions. [2024-06-27 17:27:40,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 69 transitions, 262 flow [2024-06-27 17:27:40,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 69 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:27:40,960 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 136 flow [2024-06-27 17:27:40,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-06-27 17:27:40,961 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, -1 predicate places. [2024-06-27 17:27:40,961 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 136 flow [2024-06-27 17:27:40,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-06-27 17:27:40,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:27:40,962 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] [2024-06-27 17:27:40,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:27:40,962 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:27:40,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:27:40,963 INFO L85 PathProgramCache]: Analyzing trace with hash 674539450, now seen corresponding path program 1 times [2024-06-27 17:27:40,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:27:40,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000371705] [2024-06-27 17:27:40,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:27:40,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:27:40,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:27:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:27:41,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:27:41,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000371705] [2024-06-27 17:27:41,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000371705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:27:41,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:27:41,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:27:41,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116903946] [2024-06-27 17:27:41,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:27:41,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:27:41,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:27:41,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:27:41,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:27:41,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-06-27 17:27:41,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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-06-27 17:27:41,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:27:41,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-06-27 17:27:41,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:27:41,529 INFO L124 PetriNetUnfolderBase]: 3272/5042 cut-off events. [2024-06-27 17:27:41,529 INFO L125 PetriNetUnfolderBase]: For 1393/1393 co-relation queries the response was YES. [2024-06-27 17:27:41,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11673 conditions, 5042 events. 3272/5042 cut-off events. For 1393/1393 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 32835 event pairs, 192 based on Foata normal form. 174/5058 useless extension candidates. Maximal degree in co-relation 11661. Up to 2581 conditions per place. [2024-06-27 17:27:41,554 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 56 selfloop transitions, 10 changer transitions 1/85 dead transitions. [2024-06-27 17:27:41,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 375 flow [2024-06-27 17:27:41,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:27:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:27:41,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2024-06-27 17:27:41,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.716 [2024-06-27 17:27:41,557 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 136 flow. Second operand 5 states and 179 transitions. [2024-06-27 17:27:41,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 375 flow [2024-06-27 17:27:41,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 364 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 17:27:41,560 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 188 flow [2024-06-27 17:27:41,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-06-27 17:27:41,560 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 3 predicate places. [2024-06-27 17:27:41,561 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 188 flow [2024-06-27 17:27:41,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 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-06-27 17:27:41,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:27:41,561 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] [2024-06-27 17:27:41,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:27:41,562 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:27:41,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:27:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1017175972, now seen corresponding path program 1 times [2024-06-27 17:27:41,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:27:41,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127867181] [2024-06-27 17:27:41,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:27:41,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:27:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:27:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:27:41,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:27:41,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127867181] [2024-06-27 17:27:41,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127867181] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:27:41,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:27:41,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:27:41,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648984982] [2024-06-27 17:27:41,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:27:41,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:27:41,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:27:41,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:27:41,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:27:41,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-06-27 17:27:41,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:27:41,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:27:41,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-06-27 17:27:41,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:27:42,103 INFO L124 PetriNetUnfolderBase]: 2201/3393 cut-off events. [2024-06-27 17:27:42,103 INFO L125 PetriNetUnfolderBase]: For 2769/2769 co-relation queries the response was YES. [2024-06-27 17:27:42,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8895 conditions, 3393 events. 2201/3393 cut-off events. For 2769/2769 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19590 event pairs, 69 based on Foata normal form. 140/3444 useless extension candidates. Maximal degree in co-relation 8881. Up to 1221 conditions per place. [2024-06-27 17:27:42,118 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 66 selfloop transitions, 14 changer transitions 1/99 dead transitions. [2024-06-27 17:27:42,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 99 transitions, 494 flow [2024-06-27 17:27:42,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:27:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:27:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 215 transitions. [2024-06-27 17:27:42,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2024-06-27 17:27:42,120 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 188 flow. Second operand 6 states and 215 transitions. [2024-06-27 17:27:42,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 99 transitions, 494 flow [2024-06-27 17:27:42,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 99 transitions, 464 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 17:27:42,126 INFO L231 Difference]: Finished difference. Result has 64 places, 55 transitions, 238 flow [2024-06-27 17:27:42,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=64, PETRI_TRANSITIONS=55} [2024-06-27 17:27:42,127 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2024-06-27 17:27:42,127 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 55 transitions, 238 flow [2024-06-27 17:27:42,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:27:42,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:27:42,128 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, 1] [2024-06-27 17:27:42,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:27:42,128 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:27:42,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:27:42,128 INFO L85 PathProgramCache]: Analyzing trace with hash 910395632, now seen corresponding path program 1 times [2024-06-27 17:27:42,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:27:42,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531720398] [2024-06-27 17:27:42,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:27:42,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:27:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:27:42,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:27:42,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:27:42,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531720398] [2024-06-27 17:27:42,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531720398] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:27:42,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:27:42,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:27:42,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927987096] [2024-06-27 17:27:42,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:27:42,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:27:42,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:27:42,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:27:42,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:27:42,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2024-06-27 17:27:42,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 55 transitions, 238 flow. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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-06-27 17:27:42,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:27:42,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2024-06-27 17:27:42,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:27:42,502 INFO L124 PetriNetUnfolderBase]: 1353/2029 cut-off events. [2024-06-27 17:27:42,502 INFO L125 PetriNetUnfolderBase]: For 3115/3115 co-relation queries the response was YES. [2024-06-27 17:27:42,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6040 conditions, 2029 events. 1353/2029 cut-off events. For 3115/3115 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9823 event pairs, 39 based on Foata normal form. 72/2068 useless extension candidates. Maximal degree in co-relation 6025. Up to 668 conditions per place. [2024-06-27 17:27:42,513 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 60 selfloop transitions, 18 changer transitions 1/97 dead transitions. [2024-06-27 17:27:42,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 97 transitions, 496 flow [2024-06-27 17:27:42,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:27:42,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:27:42,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 235 transitions. [2024-06-27 17:27:42,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714 [2024-06-27 17:27:42,515 INFO L175 Difference]: Start difference. First operand has 64 places, 55 transitions, 238 flow. Second operand 7 states and 235 transitions. [2024-06-27 17:27:42,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 97 transitions, 496 flow [2024-06-27 17:27:42,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 97 transitions, 450 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 17:27:42,525 INFO L231 Difference]: Finished difference. Result has 67 places, 55 transitions, 248 flow [2024-06-27 17:27:42,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=248, PETRI_PLACES=67, PETRI_TRANSITIONS=55} [2024-06-27 17:27:42,525 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 9 predicate places. [2024-06-27 17:27:42,526 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 55 transitions, 248 flow [2024-06-27 17:27:42,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 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-06-27 17:27:42,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:27:42,526 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:27:42,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:27:42,527 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:27:42,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:27:42,527 INFO L85 PathProgramCache]: Analyzing trace with hash 2076356925, now seen corresponding path program 1 times [2024-06-27 17:27:42,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:27:42,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360537713] [2024-06-27 17:27:42,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:27:42,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:27:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:27:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:27:42,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:27:42,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360537713] [2024-06-27 17:27:42,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360537713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:27:42,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:27:42,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:27:42,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386298900] [2024-06-27 17:27:42,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:27:42,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:27:42,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:27:42,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:27:42,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:27:43,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2024-06-27 17:27:43,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 55 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:27:43,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:27:43,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2024-06-27 17:27:43,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:27:43,441 INFO L124 PetriNetUnfolderBase]: 3063/5194 cut-off events. [2024-06-27 17:27:43,442 INFO L125 PetriNetUnfolderBase]: For 2710/2906 co-relation queries the response was YES. [2024-06-27 17:27:43,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12138 conditions, 5194 events. 3063/5194 cut-off events. For 2710/2906 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 34900 event pairs, 782 based on Foata normal form. 16/4974 useless extension candidates. Maximal degree in co-relation 12122. Up to 2079 conditions per place. [2024-06-27 17:27:43,461 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 44 selfloop transitions, 7 changer transitions 14/94 dead transitions. [2024-06-27 17:27:43,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 94 transitions, 476 flow [2024-06-27 17:27:43,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:27:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:27:43,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2024-06-27 17:27:43,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-06-27 17:27:43,463 INFO L175 Difference]: Start difference. First operand has 67 places, 55 transitions, 248 flow. Second operand 6 states and 192 transitions. [2024-06-27 17:27:43,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 94 transitions, 476 flow [2024-06-27 17:27:43,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 94 transitions, 370 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-06-27 17:27:43,485 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 196 flow [2024-06-27 17:27:43,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-06-27 17:27:43,486 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 8 predicate places. [2024-06-27 17:27:43,486 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 196 flow [2024-06-27 17:27:43,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:27:43,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:27:43,487 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:27:43,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:27:43,487 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:27:43,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:27:43,488 INFO L85 PathProgramCache]: Analyzing trace with hash 617572247, now seen corresponding path program 2 times [2024-06-27 17:27:43,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:27:43,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623222663] [2024-06-27 17:27:43,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:27:43,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:27:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:27:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:27:43,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:27:43,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623222663] [2024-06-27 17:27:43,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623222663] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:27:43,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:27:43,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 17:27:43,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967576854] [2024-06-27 17:27:43,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:27:43,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:27:43,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:27:43,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:27:43,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:27:43,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 50 [2024-06-27 17:27:43,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:27:43,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:27:43,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 50 [2024-06-27 17:27:43,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:27:44,659 INFO L124 PetriNetUnfolderBase]: 6650/11126 cut-off events. [2024-06-27 17:27:44,659 INFO L125 PetriNetUnfolderBase]: For 1756/1756 co-relation queries the response was YES. [2024-06-27 17:27:44,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23866 conditions, 11126 events. 6650/11126 cut-off events. For 1756/1756 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 83969 event pairs, 1660 based on Foata normal form. 16/10657 useless extension candidates. Maximal degree in co-relation 23851. Up to 3837 conditions per place. [2024-06-27 17:27:44,770 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 52 selfloop transitions, 11 changer transitions 42/133 dead transitions. [2024-06-27 17:27:44,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 133 transitions, 606 flow [2024-06-27 17:27:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:27:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:27:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 261 transitions. [2024-06-27 17:27:44,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6525 [2024-06-27 17:27:44,772 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 196 flow. Second operand 8 states and 261 transitions. [2024-06-27 17:27:44,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 133 transitions, 606 flow [2024-06-27 17:27:44,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 133 transitions, 600 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 17:27:44,795 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 260 flow [2024-06-27 17:27:44,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=260, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2024-06-27 17:27:44,796 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 16 predicate places. [2024-06-27 17:27:44,796 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 260 flow [2024-06-27 17:27:44,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.285714285714285) internal successors, (163), 7 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:27:44,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:27:44,796 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:27:44,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:27:44,797 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:27:44,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:27:44,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2009926253, now seen corresponding path program 3 times [2024-06-27 17:27:44,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:27:44,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344669487] [2024-06-27 17:27:44,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:27:44,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:27:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:27:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:27:44,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:27:44,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344669487] [2024-06-27 17:27:44,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344669487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:27:44,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:27:44,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:27:44,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51695927] [2024-06-27 17:27:44,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:27:44,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:27:44,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:27:44,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:27:44,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:27:44,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2024-06-27 17:27:44,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:27:44,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:27:44,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2024-06-27 17:27:44,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:27:45,645 INFO L124 PetriNetUnfolderBase]: 4837/8671 cut-off events. [2024-06-27 17:27:45,645 INFO L125 PetriNetUnfolderBase]: For 3026/3177 co-relation queries the response was YES. [2024-06-27 17:27:45,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19872 conditions, 8671 events. 4837/8671 cut-off events. For 3026/3177 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 68472 event pairs, 1396 based on Foata normal form. 66/8017 useless extension candidates. Maximal degree in co-relation 19852. Up to 3272 conditions per place. [2024-06-27 17:27:45,673 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 46 selfloop transitions, 3 changer transitions 16/102 dead transitions. [2024-06-27 17:27:45,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 102 transitions, 517 flow [2024-06-27 17:27:45,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:27:45,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:27:45,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2024-06-27 17:27:45,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.67 [2024-06-27 17:27:45,675 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 260 flow. Second operand 6 states and 201 transitions. [2024-06-27 17:27:45,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 102 transitions, 517 flow [2024-06-27 17:27:45,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 102 transitions, 487 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 17:27:45,680 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 271 flow [2024-06-27 17:27:45,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2024-06-27 17:27:45,681 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 17 predicate places. [2024-06-27 17:27:45,681 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 271 flow [2024-06-27 17:27:45,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:27:45,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:27:45,682 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:27:45,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:27:45,682 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:27:45,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:27:45,683 INFO L85 PathProgramCache]: Analyzing trace with hash -751447587, now seen corresponding path program 4 times [2024-06-27 17:27:45,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:27:45,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297653308] [2024-06-27 17:27:45,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:27:45,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:27:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:27:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:27:46,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:27:46,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297653308] [2024-06-27 17:27:46,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297653308] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:27:46,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:27:46,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 17:27:46,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200253940] [2024-06-27 17:27:46,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:27:46,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:27:46,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:27:46,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:27:46,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:27:46,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2024-06-27 17:27:46,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 271 flow. Second operand has 10 states, 10 states have (on average 26.8) internal successors, (268), 10 states have internal predecessors, (268), 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-06-27 17:27:46,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:27:46,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2024-06-27 17:27:46,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:27:47,558 INFO L124 PetriNetUnfolderBase]: 8980/16764 cut-off events. [2024-06-27 17:27:47,559 INFO L125 PetriNetUnfolderBase]: For 3109/3255 co-relation queries the response was YES. [2024-06-27 17:27:47,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36251 conditions, 16764 events. 8980/16764 cut-off events. For 3109/3255 co-relation queries the response was YES. Maximal size of possible extension queue 1259. Compared 152716 event pairs, 1638 based on Foata normal form. 35/15607 useless extension candidates. Maximal degree in co-relation 36230. Up to 3850 conditions per place. [2024-06-27 17:27:47,637 INFO L140 encePairwiseOnDemand]: 42/50 looper letters, 40 selfloop transitions, 6 changer transitions 30/115 dead transitions. [2024-06-27 17:27:47,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 115 transitions, 555 flow [2024-06-27 17:27:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:27:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:27:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 295 transitions. [2024-06-27 17:27:47,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2024-06-27 17:27:47,639 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 271 flow. Second operand 9 states and 295 transitions. [2024-06-27 17:27:47,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 115 transitions, 555 flow [2024-06-27 17:27:47,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 115 transitions, 544 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-27 17:27:47,654 INFO L231 Difference]: Finished difference. Result has 84 places, 65 transitions, 289 flow [2024-06-27 17:27:47,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=289, PETRI_PLACES=84, PETRI_TRANSITIONS=65} [2024-06-27 17:27:47,655 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 26 predicate places. [2024-06-27 17:27:47,655 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 65 transitions, 289 flow [2024-06-27 17:27:47,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.8) internal successors, (268), 10 states have internal predecessors, (268), 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-06-27 17:27:47,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:27:47,656 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:27:47,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:27:47,656 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:27:47,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:27:47,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1480352913, now seen corresponding path program 5 times [2024-06-27 17:27:47,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:27:47,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678798337] [2024-06-27 17:27:47,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:27:47,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:27:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:27:47,683 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:27:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:27:47,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:27:47,749 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:27:47,749 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 17:27:47,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 17:27:47,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-06-27 17:27:47,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-06-27 17:27:47,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 17:27:47,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 17:27:47,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 17:27:47,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 17:27:47,755 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-06-27 17:27:47,759 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:27:47,760 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:27:47,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:27:47 BasicIcfg [2024-06-27 17:27:47,852 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:27:47,852 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:27:47,853 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:27:47,853 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:27:47,853 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:27:39" (3/4) ... [2024-06-27 17:27:47,854 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:27:47,948 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:27:47,948 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:27:47,948 INFO L158 Benchmark]: Toolchain (without parser) took 10160.76ms. Allocated memory was 192.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 121.6MB in the beginning and 539.0MB in the end (delta: -417.4MB). Peak memory consumption was 624.9MB. Max. memory is 16.1GB. [2024-06-27 17:27:47,949 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 192.9MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:27:47,949 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.87ms. Allocated memory is still 192.9MB. Free memory was 121.4MB in the beginning and 152.2MB in the end (delta: -30.8MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-06-27 17:27:47,949 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.36ms. Allocated memory is still 192.9MB. Free memory was 152.2MB in the beginning and 149.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:27:47,949 INFO L158 Benchmark]: Boogie Preprocessor took 64.12ms. Allocated memory is still 192.9MB. Free memory was 149.6MB in the beginning and 146.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:27:47,950 INFO L158 Benchmark]: RCFGBuilder took 580.19ms. Allocated memory is still 192.9MB. Free memory was 146.0MB in the beginning and 99.3MB in the end (delta: 46.7MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-06-27 17:27:47,950 INFO L158 Benchmark]: TraceAbstraction took 8849.08ms. Allocated memory was 192.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 98.5MB in the beginning and 557.8MB in the end (delta: -459.3MB). Peak memory consumption was 580.6MB. Max. memory is 16.1GB. [2024-06-27 17:27:47,950 INFO L158 Benchmark]: Witness Printer took 95.53ms. Allocated memory is still 1.2GB. Free memory was 556.8MB in the beginning and 539.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-06-27 17:27:47,951 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 192.9MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.87ms. Allocated memory is still 192.9MB. Free memory was 121.4MB in the beginning and 152.2MB in the end (delta: -30.8MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.36ms. Allocated memory is still 192.9MB. Free memory was 152.2MB in the beginning and 149.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.12ms. Allocated memory is still 192.9MB. Free memory was 149.6MB in the beginning and 146.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 580.19ms. Allocated memory is still 192.9MB. Free memory was 146.0MB in the beginning and 99.3MB in the end (delta: 46.7MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8849.08ms. Allocated memory was 192.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 98.5MB in the beginning and 557.8MB in the end (delta: -459.3MB). Peak memory consumption was 580.6MB. Max. memory is 16.1GB. * Witness Printer took 95.53ms. Allocated memory is still 1.2GB. Free memory was 556.8MB in the beginning and 539.0MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1221; [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1222; [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=-1, t1222=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1223; [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=-1, t1222=0, t1223=1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L852] 0 pthread_t t1224; [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1221=-1, t1222=0, t1223=1, t1224=2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L806] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L806] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L815] 4 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 4 __unbuffered_p3_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L821] 4 __unbuffered_p3_EBX = b VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221=-1, t1222=0, t1223=1, t1224=2, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221=-1, t1222=0, t1223=1, t1224=2, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1221=-1, t1222=0, t1223=1, t1224=2, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 614 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 591 mSDsluCounter, 211 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1253 IncrementalHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 18 mSDtfsCounter, 1253 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=289occurred in iteration=9, InterpolantAutomatonStates: 54, 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, 2.2s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 247 ConstructedInterpolants, 0 QuantifiedInterpolants, 1199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 17:27:47,995 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