./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.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 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:17:22,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:17:22,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:17:22,583 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:17:22,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:17:22,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:17:22,617 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:17:22,617 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:17:22,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:17:22,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:17:22,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:17:22,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:17:22,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:17:22,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:17:22,623 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:17:22,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:17:22,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:17:22,624 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:17:22,624 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:17:22,625 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:17:22,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:17:22,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:17:22,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:17:22,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:17:22,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:17:22,629 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:17:22,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:17:22,629 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:17:22,629 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:17:22,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:17:22,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:17:22,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:17:22,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:17:22,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:17:22,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:17:22,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:17:22,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:17:22,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:17:22,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:17:22,633 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:17:22,633 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:17:22,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:17:22,634 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 [2024-10-14 14:17:22,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:17:22,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:17:22,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:17:22,918 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:17:22,918 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:17:22,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2024-10-14 14:17:24,284 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:17:24,540 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:17:24,540 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2024-10-14 14:17:24,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/902a56813/4cc35353e23e4632a0012760d44a2e57/FLAG20e05462f [2024-10-14 14:17:24,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/902a56813/4cc35353e23e4632a0012760d44a2e57 [2024-10-14 14:17:24,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:17:24,845 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:17:24,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:17:24,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:17:24,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:17:24,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:17:24" (1/1) ... [2024-10-14 14:17:24,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314d4c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:24, skipping insertion in model container [2024-10-14 14:17:24,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:17:24" (1/1) ... [2024-10-14 14:17:24,905 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:17:25,266 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i[41520,41533] [2024-10-14 14:17:25,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:17:25,310 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:17:25,375 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i[41520,41533] [2024-10-14 14:17:25,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:17:25,444 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:17:25,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:25 WrapperNode [2024-10-14 14:17:25,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:17:25,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:17:25,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:17:25,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:17:25,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:25" (1/1) ... [2024-10-14 14:17:25,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:25" (1/1) ... [2024-10-14 14:17:25,501 INFO L138 Inliner]: procedures = 277, calls = 36, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 157 [2024-10-14 14:17:25,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:17:25,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:17:25,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:17:25,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:17:25,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:25" (1/1) ... [2024-10-14 14:17:25,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:25" (1/1) ... [2024-10-14 14:17:25,520 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:25" (1/1) ... [2024-10-14 14:17:25,557 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5]. The 1 writes are split as follows [0, 0, 1]. [2024-10-14 14:17:25,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:25" (1/1) ... [2024-10-14 14:17:25,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:25" (1/1) ... [2024-10-14 14:17:25,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:25" (1/1) ... [2024-10-14 14:17:25,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:25" (1/1) ... [2024-10-14 14:17:25,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:25" (1/1) ... [2024-10-14 14:17:25,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:25" (1/1) ... [2024-10-14 14:17:25,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:17:25,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:17:25,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:17:25,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:17:25,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:25" (1/1) ... [2024-10-14 14:17:25,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:17:25,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:17:25,632 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-10-14 14:17:25,635 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-10-14 14:17:25,683 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-14 14:17:25,684 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-14 14:17:25,684 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-14 14:17:25,684 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-14 14:17:25,684 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-14 14:17:25,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 14:17:25,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 14:17:25,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 14:17:25,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 14:17:25,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 14:17:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 14:17:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-14 14:17:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:17:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:17:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 14:17:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 14:17:25,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:17:25,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:17:25,689 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 14:17:25,863 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:17:25,866 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:17:26,124 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 14:17:26,124 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:17:26,388 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:17:26,388 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 14:17:26,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:17:26 BoogieIcfgContainer [2024-10-14 14:17:26,389 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:17:26,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:17:26,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:17:26,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:17:26,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:17:24" (1/3) ... [2024-10-14 14:17:26,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce90bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:17:26, skipping insertion in model container [2024-10-14 14:17:26,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:17:25" (2/3) ... [2024-10-14 14:17:26,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce90bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:17:26, skipping insertion in model container [2024-10-14 14:17:26,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:17:26" (3/3) ... [2024-10-14 14:17:26,395 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2024-10-14 14:17:26,408 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:17:26,409 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 14:17:26,409 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 14:17:26,467 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-14 14:17:26,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 35 transitions, 84 flow [2024-10-14 14:17:26,530 INFO L124 PetriNetUnfolderBase]: 5/33 cut-off events. [2024-10-14 14:17:26,530 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 14:17:26,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 5/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 30. Up to 3 conditions per place. [2024-10-14 14:17:26,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 35 transitions, 84 flow [2024-10-14 14:17:26,540 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 31 transitions, 71 flow [2024-10-14 14:17:26,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:17:26,557 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c76c560, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:17:26,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-14 14:17:26,565 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 14:17:26,565 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2024-10-14 14:17:26,565 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 14:17:26,566 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:26,566 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:26,567 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:17:26,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:26,572 INFO L85 PathProgramCache]: Analyzing trace with hash -71410199, now seen corresponding path program 1 times [2024-10-14 14:17:26,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:26,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838725622] [2024-10-14 14:17:26,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:26,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:27,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:27,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838725622] [2024-10-14 14:17:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838725622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:17:27,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:17:27,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 14:17:27,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870796030] [2024-10-14 14:17:27,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:17:27,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:17:27,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:27,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:17:27,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:17:27,070 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-10-14 14:17:27,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 71 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:27,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:27,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-10-14 14:17:27,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:27,358 INFO L124 PetriNetUnfolderBase]: 342/655 cut-off events. [2024-10-14 14:17:27,359 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-10-14 14:17:27,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1267 conditions, 655 events. 342/655 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3003 event pairs, 75 based on Foata normal form. 44/652 useless extension candidates. Maximal degree in co-relation 1175. Up to 358 conditions per place. [2024-10-14 14:17:27,368 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 46 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2024-10-14 14:17:27,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 56 transitions, 228 flow [2024-10-14 14:17:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:17:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 14:17:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-10-14 14:17:27,382 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-10-14 14:17:27,384 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 71 flow. Second operand 4 states and 90 transitions. [2024-10-14 14:17:27,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 56 transitions, 228 flow [2024-10-14 14:17:27,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 56 transitions, 219 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 14:17:27,391 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 82 flow [2024-10-14 14:17:27,393 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2024-10-14 14:17:27,398 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2024-10-14 14:17:27,401 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 82 flow [2024-10-14 14:17:27,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:27,402 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:27,402 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:27,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:17:27,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:17:27,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:27,403 INFO L85 PathProgramCache]: Analyzing trace with hash -872048011, now seen corresponding path program 1 times [2024-10-14 14:17:27,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:27,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720805246] [2024-10-14 14:17:27,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:27,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:27,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:27,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720805246] [2024-10-14 14:17:27,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720805246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:17:27,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:17:27,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:17:27,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862400846] [2024-10-14 14:17:27,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:17:27,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:17:27,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:27,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:17:27,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:17:27,546 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-10-14 14:17:27,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-10-14 14:17:27,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:27,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-10-14 14:17:27,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:27,696 INFO L124 PetriNetUnfolderBase]: 341/639 cut-off events. [2024-10-14 14:17:27,696 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-10-14 14:17:27,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1347 conditions, 639 events. 341/639 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2799 event pairs, 128 based on Foata normal form. 10/606 useless extension candidates. Maximal degree in co-relation 989. Up to 398 conditions per place. [2024-10-14 14:17:27,704 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 33 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-10-14 14:17:27,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 183 flow [2024-10-14 14:17:27,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:17:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 14:17:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-10-14 14:17:27,706 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2024-10-14 14:17:27,706 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 82 flow. Second operand 3 states and 62 transitions. [2024-10-14 14:17:27,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 183 flow [2024-10-14 14:17:27,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 14:17:27,707 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 92 flow [2024-10-14 14:17:27,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2024-10-14 14:17:27,710 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2024-10-14 14:17:27,711 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 92 flow [2024-10-14 14:17:27,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-10-14 14:17:27,712 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:27,712 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:27,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:17:27,713 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:17:27,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:27,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1733458170, now seen corresponding path program 1 times [2024-10-14 14:17:27,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:27,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688593074] [2024-10-14 14:17:27,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:27,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:27,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:27,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:27,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688593074] [2024-10-14 14:17:27,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688593074] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:17:27,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117117164] [2024-10-14 14:17:27,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:27,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:17:27,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:17:27,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:17:27,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 14:17:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:28,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 14:17:28,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:17:28,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 14:17:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:28,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:17:28,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:28,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117117164] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:17:28,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:17:28,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-10-14 14:17:28,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318955798] [2024-10-14 14:17:28,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:17:28,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:17:28,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:28,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:17:28,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:17:28,350 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-10-14 14:17:28,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 92 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:28,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:28,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-10-14 14:17:28,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:28,833 INFO L124 PetriNetUnfolderBase]: 1030/1974 cut-off events. [2024-10-14 14:17:28,833 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2024-10-14 14:17:28,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4119 conditions, 1974 events. 1030/1974 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 10241 event pairs, 79 based on Foata normal form. 0/1879 useless extension candidates. Maximal degree in co-relation 3565. Up to 390 conditions per place. [2024-10-14 14:17:28,844 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 137 selfloop transitions, 18 changer transitions 2/165 dead transitions. [2024-10-14 14:17:28,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 165 transitions, 729 flow [2024-10-14 14:17:28,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 14:17:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-14 14:17:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 269 transitions. [2024-10-14 14:17:28,847 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6404761904761904 [2024-10-14 14:17:28,847 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 92 flow. Second operand 12 states and 269 transitions. [2024-10-14 14:17:28,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 165 transitions, 729 flow [2024-10-14 14:17:28,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 165 transitions, 727 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 14:17:28,851 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 237 flow [2024-10-14 14:17:28,851 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=237, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2024-10-14 14:17:28,852 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2024-10-14 14:17:28,852 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 237 flow [2024-10-14 14:17:28,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 14:17:28,852 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:28,853 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:28,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 14:17:29,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:17:29,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:17:29,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:29,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1632992800, now seen corresponding path program 1 times [2024-10-14 14:17:29,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:29,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636035363] [2024-10-14 14:17:29,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:29,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:29,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:29,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636035363] [2024-10-14 14:17:29,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636035363] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:17:29,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:17:29,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 14:17:29,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086119733] [2024-10-14 14:17:29,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:17:29,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 14:17:29,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:29,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 14:17:29,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 14:17:29,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-10-14 14:17:29,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 237 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-10-14 14:17:29,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:29,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-10-14 14:17:29,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:29,312 INFO L124 PetriNetUnfolderBase]: 593/1232 cut-off events. [2024-10-14 14:17:29,313 INFO L125 PetriNetUnfolderBase]: For 452/452 co-relation queries the response was YES. [2024-10-14 14:17:29,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2780 conditions, 1232 events. 593/1232 cut-off events. For 452/452 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5916 event pairs, 204 based on Foata normal form. 60/1277 useless extension candidates. Maximal degree in co-relation 2653. Up to 580 conditions per place. [2024-10-14 14:17:29,320 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 42 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2024-10-14 14:17:29,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 54 transitions, 309 flow [2024-10-14 14:17:29,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 14:17:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 14:17:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-10-14 14:17:29,322 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2024-10-14 14:17:29,322 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 237 flow. Second operand 3 states and 61 transitions. [2024-10-14 14:17:29,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 54 transitions, 309 flow [2024-10-14 14:17:29,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 54 transitions, 285 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-10-14 14:17:29,353 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 178 flow [2024-10-14 14:17:29,354 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2024-10-14 14:17:29,355 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2024-10-14 14:17:29,355 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 178 flow [2024-10-14 14:17:29,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-10-14 14:17:29,356 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:29,356 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:29,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:17:29,356 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:17:29,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:29,357 INFO L85 PathProgramCache]: Analyzing trace with hash 141966125, now seen corresponding path program 1 times [2024-10-14 14:17:29,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:29,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504306479] [2024-10-14 14:17:29,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:29,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:29,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:29,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504306479] [2024-10-14 14:17:29,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504306479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:17:29,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:17:29,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:17:29,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595587797] [2024-10-14 14:17:29,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:17:29,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 14:17:29,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:29,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 14:17:29,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 14:17:29,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-10-14 14:17:29,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 178 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-10-14 14:17:29,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:29,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-10-14 14:17:29,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:30,094 INFO L124 PetriNetUnfolderBase]: 653/1345 cut-off events. [2024-10-14 14:17:30,094 INFO L125 PetriNetUnfolderBase]: For 506/506 co-relation queries the response was YES. [2024-10-14 14:17:30,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3121 conditions, 1345 events. 653/1345 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6555 event pairs, 145 based on Foata normal form. 0/1325 useless extension candidates. Maximal degree in co-relation 2725. Up to 840 conditions per place. [2024-10-14 14:17:30,105 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 60 selfloop transitions, 5 changer transitions 2/75 dead transitions. [2024-10-14 14:17:30,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 402 flow [2024-10-14 14:17:30,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 14:17:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 14:17:30,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-10-14 14:17:30,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5771428571428572 [2024-10-14 14:17:30,107 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 178 flow. Second operand 5 states and 101 transitions. [2024-10-14 14:17:30,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 402 flow [2024-10-14 14:17:30,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 391 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 14:17:30,114 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 210 flow [2024-10-14 14:17:30,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-10-14 14:17:30,117 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2024-10-14 14:17:30,117 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 210 flow [2024-10-14 14:17:30,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-10-14 14:17:30,117 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:30,117 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:30,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:17:30,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:17:30,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:30,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1462533000, now seen corresponding path program 1 times [2024-10-14 14:17:30,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:30,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792142373] [2024-10-14 14:17:30,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:30,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:30,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:17:30,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792142373] [2024-10-14 14:17:30,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792142373] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 14:17:30,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885216572] [2024-10-14 14:17:30,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:30,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 14:17:30,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:17:30,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 14:17:30,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 14:17:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:17:30,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 14:17:30,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 14:17:30,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 14:17:30,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 14:17:30,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-10-14 14:17:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:30,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 14:17:31,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-10-14 14:17:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 14:17:31,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885216572] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 14:17:31,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 14:17:31,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-10-14 14:17:31,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617876457] [2024-10-14 14:17:31,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 14:17:31,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 14:17:31,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:17:31,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 14:17:31,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-14 14:17:31,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-10-14 14:17:31,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 210 flow. Second operand has 14 states, 14 states have (on average 12.857142857142858) internal successors, (180), 14 states have internal predecessors, (180), 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-10-14 14:17:31,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 14:17:31,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-10-14 14:17:31,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 14:17:32,249 INFO L124 PetriNetUnfolderBase]: 1248/2585 cut-off events. [2024-10-14 14:17:32,249 INFO L125 PetriNetUnfolderBase]: For 1253/1253 co-relation queries the response was YES. [2024-10-14 14:17:32,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5945 conditions, 2585 events. 1248/2585 cut-off events. For 1253/1253 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 14148 event pairs, 231 based on Foata normal form. 0/2553 useless extension candidates. Maximal degree in co-relation 4758. Up to 384 conditions per place. [2024-10-14 14:17:32,267 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 138 selfloop transitions, 28 changer transitions 0/174 dead transitions. [2024-10-14 14:17:32,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 174 transitions, 966 flow [2024-10-14 14:17:32,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 14:17:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-14 14:17:32,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 260 transitions. [2024-10-14 14:17:32,269 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-10-14 14:17:32,269 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 210 flow. Second operand 12 states and 260 transitions. [2024-10-14 14:17:32,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 174 transitions, 966 flow [2024-10-14 14:17:32,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 174 transitions, 961 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 14:17:32,276 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 376 flow [2024-10-14 14:17:32,277 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=376, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2024-10-14 14:17:32,277 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 34 predicate places. [2024-10-14 14:17:32,277 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 376 flow [2024-10-14 14:17:32,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.857142857142858) internal successors, (180), 14 states have internal predecessors, (180), 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-10-14 14:17:32,278 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 14:17:32,278 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:32,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 14:17:32,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 14:17:32,479 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-14 14:17:32,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:17:32,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1295806524, now seen corresponding path program 1 times [2024-10-14 14:17:32,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:17:32,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956067835] [2024-10-14 14:17:32,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:17:32,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:17:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:17:32,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 14:17:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 14:17:32,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 14:17:32,572 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 14:17:32,573 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-10-14 14:17:32,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2024-10-14 14:17:32,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-10-14 14:17:32,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-10-14 14:17:32,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-10-14 14:17:32,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-10-14 14:17:32,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:17:32,576 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-14 14:17:32,630 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 14:17:32,631 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 14:17:32,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:17:32 BasicIcfg [2024-10-14 14:17:32,640 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 14:17:32,641 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 14:17:32,641 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 14:17:32,641 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 14:17:32,642 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:17:26" (3/4) ... [2024-10-14 14:17:32,642 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 14:17:32,731 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 14:17:32,731 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 14:17:32,732 INFO L158 Benchmark]: Toolchain (without parser) took 7886.03ms. Allocated memory was 159.4MB in the beginning and 234.9MB in the end (delta: 75.5MB). Free memory was 103.2MB in the beginning and 193.9MB in the end (delta: -90.7MB). Peak memory consumption was 119.6MB. Max. memory is 16.1GB. [2024-10-14 14:17:32,734 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 14:17:32,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.91ms. Allocated memory is still 159.4MB. Free memory was 103.2MB in the beginning and 70.9MB in the end (delta: 32.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 14:17:32,735 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.07ms. Allocated memory is still 159.4MB. Free memory was 70.9MB in the beginning and 68.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 14:17:32,735 INFO L158 Benchmark]: Boogie Preprocessor took 73.39ms. Allocated memory is still 159.4MB. Free memory was 68.4MB in the beginning and 128.1MB in the end (delta: -59.7MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-14 14:17:32,735 INFO L158 Benchmark]: RCFGBuilder took 810.51ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 128.0MB in the beginning and 122.2MB in the end (delta: 5.9MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2024-10-14 14:17:32,736 INFO L158 Benchmark]: TraceAbstraction took 6249.71ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 121.1MB in the beginning and 64.1MB in the end (delta: 57.0MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2024-10-14 14:17:32,736 INFO L158 Benchmark]: Witness Printer took 90.05ms. Allocated memory is still 234.9MB. Free memory was 64.1MB in the beginning and 193.9MB in the end (delta: -129.8MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-10-14 14:17:32,737 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.17ms. Allocated memory is still 159.4MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 597.91ms. Allocated memory is still 159.4MB. Free memory was 103.2MB in the beginning and 70.9MB in the end (delta: 32.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.07ms. Allocated memory is still 159.4MB. Free memory was 70.9MB in the beginning and 68.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.39ms. Allocated memory is still 159.4MB. Free memory was 68.4MB in the beginning and 128.1MB in the end (delta: -59.7MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * RCFGBuilder took 810.51ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 128.0MB in the beginning and 122.2MB in the end (delta: 5.9MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6249.71ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 121.1MB in the beginning and 64.1MB in the end (delta: 57.0MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. * Witness Printer took 90.05ms. Allocated memory is still 234.9MB. Free memory was 64.1MB in the beginning and 193.9MB in the end (delta: -129.8MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, id2=0, m={4:0}, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=4, top=1] [L1007] COND TRUE 2 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1023]: 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: 1024]: 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: 941]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 55 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.1s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 500 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 967 IncrementalHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 2 mSDtfsCounter, 967 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=376occurred in iteration=6, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 164 ConstructedInterpolants, 7 QuantifiedInterpolants, 1588 SizeOfPredicates, 21 NumberOfNonLiveVariables, 311 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 0/30 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-10-14 14:17:32,771 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