./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_longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:09:37,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:09:37,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:09:37,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:09:37,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:09:38,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:09:38,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:09:38,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:09:38,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:09:38,011 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:09:38,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:09:38,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:09:38,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:09:38,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:09:38,013 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:09:38,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:09:38,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:09:38,014 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:09:38,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:09:38,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:09:38,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:09:38,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:09:38,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:09:38,019 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:09:38,019 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:09:38,019 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:09:38,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:09:38,020 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:09:38,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:09:38,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:09:38,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:09:38,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:09:38,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:09:38,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:09:38,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:09:38,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:09:38,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:09:38,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:09:38,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:09:38,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:09:38,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:09:38,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:09:38,026 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-clean/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-clean/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 -> 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 [2024-10-11 14:09:38,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:09:38,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:09:38,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:09:38,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:09:38,355 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:09:38,356 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2024-10-11 14:09:39,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:09:40,060 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:09:40,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack_longer-1.i [2024-10-11 14:09:40,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ccb780e6/f1b134696015435bbad865144bbccbbd/FLAGe582e1249 [2024-10-11 14:09:40,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ccb780e6/f1b134696015435bbad865144bbccbbd [2024-10-11 14:09:40,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:09:40,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:09:40,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:09:40,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:09:40,379 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:09:40,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:09:40" (1/1) ... [2024-10-11 14:09:40,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c0b85b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:40, skipping insertion in model container [2024-10-11 14:09:40,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:09:40" (1/1) ... [2024-10-11 14:09:40,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:09:40,831 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_longer-1.i[41527,41540] [2024-10-11 14:09:40,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:09:40,884 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:09:40,930 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_longer-1.i[41527,41540] [2024-10-11 14:09:40,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:09:41,005 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:09:41,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:41 WrapperNode [2024-10-11 14:09:41,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:09:41,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:09:41,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:09:41,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:09:41,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:41" (1/1) ... [2024-10-11 14:09:41,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:41" (1/1) ... [2024-10-11 14:09:41,078 INFO L138 Inliner]: procedures = 277, calls = 31, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 153 [2024-10-11 14:09:41,078 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:09:41,079 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:09:41,079 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:09:41,079 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:09:41,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:41" (1/1) ... [2024-10-11 14:09:41,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:41" (1/1) ... [2024-10-11 14:09:41,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:41" (1/1) ... [2024-10-11 14:09:41,130 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 3, 5]. 50 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 2 writes are split as follows [0, 2, 0]. [2024-10-11 14:09:41,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:41" (1/1) ... [2024-10-11 14:09:41,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:41" (1/1) ... [2024-10-11 14:09:41,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:41" (1/1) ... [2024-10-11 14:09:41,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:41" (1/1) ... [2024-10-11 14:09:41,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:41" (1/1) ... [2024-10-11 14:09:41,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:41" (1/1) ... [2024-10-11 14:09:41,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:09:41,160 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:09:41,160 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:09:41,160 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:09:41,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:41" (1/1) ... [2024-10-11 14:09:41,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:09:41,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:09:41,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:09:41,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:09:41,255 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-10-11 14:09:41,255 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-10-11 14:09:41,256 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-10-11 14:09:41,256 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-10-11 14:09:41,256 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 14:09:41,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:09:41,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:09:41,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 14:09:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:09:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:09:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 14:09:41,258 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 14:09:41,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:09:41,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:09:41,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:09:41,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 14:09:41,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:09:41,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:09:41,261 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:09:41,415 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:09:41,418 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:09:41,702 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:09:41,703 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:09:41,930 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:09:41,930 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 14:09:41,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:09:41 BoogieIcfgContainer [2024-10-11 14:09:41,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:09:41,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:09:41,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:09:41,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:09:41,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:09:40" (1/3) ... [2024-10-11 14:09:41,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1046901b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:09:41, skipping insertion in model container [2024-10-11 14:09:41,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:09:41" (2/3) ... [2024-10-11 14:09:41,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1046901b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:09:41, skipping insertion in model container [2024-10-11 14:09:41,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:09:41" (3/3) ... [2024-10-11 14:09:41,941 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2024-10-11 14:09:41,962 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:09:41,962 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 14:09:41,963 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:09:42,025 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 14:09:42,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 35 transitions, 84 flow [2024-10-11 14:09:42,098 INFO L124 PetriNetUnfolderBase]: 5/33 cut-off events. [2024-10-11 14:09:42,099 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:09:42,102 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 67 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-11 14:09:42,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 35 transitions, 84 flow [2024-10-11 14:09:42,106 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 31 transitions, 71 flow [2024-10-11 14:09:42,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:09:42,120 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;@225efcdf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:09:42,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 14:09:42,130 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:09:42,131 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2024-10-11 14:09:42,131 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:09:42,131 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:42,132 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:09:42,132 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:09:42,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:42,138 INFO L85 PathProgramCache]: Analyzing trace with hash 248363588, now seen corresponding path program 1 times [2024-10-11 14:09:42,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:42,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853062512] [2024-10-11 14:09:42,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:42,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:42,601 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-11 14:09:42,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:42,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853062512] [2024-10-11 14:09:42,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853062512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:42,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:42,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:09:42,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855415999] [2024-10-11 14:09:42,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:42,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:09:42,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:42,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:09:42,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:09:42,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-10-11 14:09:42,659 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-11 14:09:42,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:42,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-10-11 14:09:42,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:42,927 INFO L124 PetriNetUnfolderBase]: 347/653 cut-off events. [2024-10-11 14:09:42,928 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-10-11 14:09:42,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 653 events. 347/653 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2975 event pairs, 79 based on Foata normal form. 44/638 useless extension candidates. Maximal degree in co-relation 1180. Up to 358 conditions per place. [2024-10-11 14:09:42,940 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 46 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2024-10-11 14:09:42,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 56 transitions, 228 flow [2024-10-11 14:09:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:09:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:09:42,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-10-11 14:09:42,957 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-10-11 14:09:42,959 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 71 flow. Second operand 4 states and 90 transitions. [2024-10-11 14:09:42,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 56 transitions, 228 flow [2024-10-11 14:09:42,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 56 transitions, 219 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 14:09:42,969 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 82 flow [2024-10-11 14:09:42,971 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-11 14:09:42,977 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2024-10-11 14:09:42,978 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 82 flow [2024-10-11 14:09:42,978 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-11 14:09:42,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:42,978 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:09:42,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:09:42,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:09:42,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:42,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1856026059, now seen corresponding path program 1 times [2024-10-11 14:09:42,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:42,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872506565] [2024-10-11 14:09:42,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:42,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:43,126 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-11 14:09:43,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:43,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872506565] [2024-10-11 14:09:43,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872506565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:43,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:43,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:09:43,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935069475] [2024-10-11 14:09:43,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:43,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:09:43,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:43,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:09:43,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:09:43,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-10-11 14:09:43,136 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-11 14:09:43,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:43,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-10-11 14:09:43,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:43,275 INFO L124 PetriNetUnfolderBase]: 341/628 cut-off events. [2024-10-11 14:09:43,276 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-11 14:09:43,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 628 events. 341/628 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2684 event pairs, 128 based on Foata normal form. 8/588 useless extension candidates. Maximal degree in co-relation 986. Up to 398 conditions per place. [2024-10-11 14:09:43,284 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 33 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-10-11 14:09:43,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 183 flow [2024-10-11 14:09:43,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:09:43,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:09:43,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-10-11 14:09:43,286 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2024-10-11 14:09:43,286 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 82 flow. Second operand 3 states and 62 transitions. [2024-10-11 14:09:43,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 183 flow [2024-10-11 14:09:43,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:09:43,288 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 92 flow [2024-10-11 14:09:43,288 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-11 14:09:43,289 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2024-10-11 14:09:43,289 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 92 flow [2024-10-11 14:09:43,289 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-11 14:09:43,290 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:43,290 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:09:43,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:09:43,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:09:43,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:43,291 INFO L85 PathProgramCache]: Analyzing trace with hash -358842045, now seen corresponding path program 1 times [2024-10-11 14:09:43,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:43,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282001394] [2024-10-11 14:09:43,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:43,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:43,501 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-11 14:09:43,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:43,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282001394] [2024-10-11 14:09:43,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282001394] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:09:43,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775832623] [2024-10-11 14:09:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:43,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:09:43,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:09:43,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:09:43,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:09:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:43,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 14:09:43,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:09:43,685 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-11 14:09:43,818 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-11 14:09:43,819 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:09:43,913 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-11 14:09:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775832623] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:09:43,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:09:43,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-10-11 14:09:43,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050200971] [2024-10-11 14:09:43,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:09:43,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:09:43,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:43,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:09:43,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:09:43,918 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-10-11 14:09:43,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 92 flow. Second operand has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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-11 14:09:43,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:43,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-10-11 14:09:43,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:44,461 INFO L124 PetriNetUnfolderBase]: 1030/1961 cut-off events. [2024-10-11 14:09:44,461 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2024-10-11 14:09:44,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4106 conditions, 1961 events. 1030/1961 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 10122 event pairs, 79 based on Foata normal form. 0/1859 useless extension candidates. Maximal degree in co-relation 3560. Up to 390 conditions per place. [2024-10-11 14:09:44,476 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 137 selfloop transitions, 18 changer transitions 2/165 dead transitions. [2024-10-11 14:09:44,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 165 transitions, 729 flow [2024-10-11 14:09:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 14:09:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 14:09:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 269 transitions. [2024-10-11 14:09:44,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6404761904761904 [2024-10-11 14:09:44,480 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 92 flow. Second operand 12 states and 269 transitions. [2024-10-11 14:09:44,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 165 transitions, 729 flow [2024-10-11 14:09:44,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 165 transitions, 727 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:09:44,487 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 237 flow [2024-10-11 14:09:44,488 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-11 14:09:44,489 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2024-10-11 14:09:44,489 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 237 flow [2024-10-11 14:09:44,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.0) internal successors, (132), 11 states have internal predecessors, (132), 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-11 14:09:44,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:44,490 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:09:44,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 14:09:44,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:09:44,692 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:09:44,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:44,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1170068160, now seen corresponding path program 1 times [2024-10-11 14:09:44,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:44,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887224400] [2024-10-11 14:09:44,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:44,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:44,805 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-11 14:09:44,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:44,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887224400] [2024-10-11 14:09:44,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887224400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:44,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:44,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:09:44,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86543462] [2024-10-11 14:09:44,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:44,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:09:44,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:44,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:09:44,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:09:44,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-10-11 14:09:44,811 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-11 14:09:44,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:44,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-10-11 14:09:44,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:44,989 INFO L124 PetriNetUnfolderBase]: 593/1229 cut-off events. [2024-10-11 14:09:44,989 INFO L125 PetriNetUnfolderBase]: For 450/450 co-relation queries the response was YES. [2024-10-11 14:09:44,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2777 conditions, 1229 events. 593/1229 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5843 event pairs, 204 based on Foata normal form. 60/1270 useless extension candidates. Maximal degree in co-relation 2650. Up to 580 conditions per place. [2024-10-11 14:09:44,999 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 42 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2024-10-11 14:09:44,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 54 transitions, 309 flow [2024-10-11 14:09:45,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:09:45,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:09:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-10-11 14:09:45,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.580952380952381 [2024-10-11 14:09:45,001 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 237 flow. Second operand 3 states and 61 transitions. [2024-10-11 14:09:45,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 54 transitions, 309 flow [2024-10-11 14:09:45,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 54 transitions, 285 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-10-11 14:09:45,008 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 178 flow [2024-10-11 14:09:45,009 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-11 14:09:45,010 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2024-10-11 14:09:45,010 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 178 flow [2024-10-11 14:09:45,010 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-11 14:09:45,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:45,010 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-11 14:09:45,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:09:45,011 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:09:45,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:45,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1160478233, now seen corresponding path program 1 times [2024-10-11 14:09:45,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:45,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022150350] [2024-10-11 14:09:45,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:45,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:45,441 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-11 14:09:45,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:45,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022150350] [2024-10-11 14:09:45,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022150350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:09:45,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:09:45,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:09:45,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34433908] [2024-10-11 14:09:45,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:09:45,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:09:45,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:45,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:09:45,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:09:45,447 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-10-11 14:09:45,447 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-11 14:09:45,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:45,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-10-11 14:09:45,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:45,726 INFO L124 PetriNetUnfolderBase]: 653/1336 cut-off events. [2024-10-11 14:09:45,727 INFO L125 PetriNetUnfolderBase]: For 501/501 co-relation queries the response was YES. [2024-10-11 14:09:45,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3112 conditions, 1336 events. 653/1336 cut-off events. For 501/501 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6495 event pairs, 145 based on Foata normal form. 0/1310 useless extension candidates. Maximal degree in co-relation 2716. Up to 840 conditions per place. [2024-10-11 14:09:45,740 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 60 selfloop transitions, 5 changer transitions 2/75 dead transitions. [2024-10-11 14:09:45,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 402 flow [2024-10-11 14:09:45,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:09:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:09:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-10-11 14:09:45,743 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5771428571428572 [2024-10-11 14:09:45,743 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 178 flow. Second operand 5 states and 101 transitions. [2024-10-11 14:09:45,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 402 flow [2024-10-11 14:09:45,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 391 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:09:45,751 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 210 flow [2024-10-11 14:09:45,751 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-11 14:09:45,753 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 22 predicate places. [2024-10-11 14:09:45,754 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 210 flow [2024-10-11 14:09:45,754 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-11 14:09:45,755 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:45,755 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-11 14:09:45,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:09:45,755 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:09:45,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash 251797340, now seen corresponding path program 1 times [2024-10-11 14:09:45,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:45,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980998825] [2024-10-11 14:09:45,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:45,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:46,725 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-11 14:09:46,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:09:46,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980998825] [2024-10-11 14:09:46,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980998825] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:09:46,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119324398] [2024-10-11 14:09:46,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:46,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:09:46,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:09:46,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:09:46,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:09:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:09:46,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 14:09:46,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:09:46,873 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-11 14:09:46,935 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-11 14:09:47,029 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-11 14:09:47,103 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-11 14:09:47,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:09:47,580 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-11 14:09:47,653 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-11 14:09:47,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119324398] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:09:47,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:09:47,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-10-11 14:09:47,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518487402] [2024-10-11 14:09:47,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:09:47,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 14:09:47,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:09:47,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 14:09:47,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:09:47,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-10-11 14:09:47,657 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-11 14:09:47,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:09:47,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-10-11 14:09:47,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:09:48,758 INFO L124 PetriNetUnfolderBase]: 1011/2066 cut-off events. [2024-10-11 14:09:48,758 INFO L125 PetriNetUnfolderBase]: For 923/923 co-relation queries the response was YES. [2024-10-11 14:09:48,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4784 conditions, 2066 events. 1011/2066 cut-off events. For 923/923 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10479 event pairs, 107 based on Foata normal form. 0/2035 useless extension candidates. Maximal degree in co-relation 3769. Up to 300 conditions per place. [2024-10-11 14:09:48,769 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 162 selfloop transitions, 23 changer transitions 2/195 dead transitions. [2024-10-11 14:09:48,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 195 transitions, 1009 flow [2024-10-11 14:09:48,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 14:09:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-11 14:09:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 333 transitions. [2024-10-11 14:09:48,771 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5946428571428571 [2024-10-11 14:09:48,772 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 210 flow. Second operand 16 states and 333 transitions. [2024-10-11 14:09:48,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 195 transitions, 1009 flow [2024-10-11 14:09:48,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 195 transitions, 1004 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:09:48,780 INFO L231 Difference]: Finished difference. Result has 71 places, 59 transitions, 331 flow [2024-10-11 14:09:48,781 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=16, PETRI_FLOW=331, PETRI_PLACES=71, PETRI_TRANSITIONS=59} [2024-10-11 14:09:48,783 INFO L277 CegarLoopForPetriNet]: 33 programPoint places, 38 predicate places. [2024-10-11 14:09:48,784 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 59 transitions, 331 flow [2024-10-11 14:09:48,784 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-11 14:09:48,784 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:09:48,784 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-11 14:09:48,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 14:09:48,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:09:48,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:09:48,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:09:48,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2096727008, now seen corresponding path program 1 times [2024-10-11 14:09:48,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:09:48,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369797705] [2024-10-11 14:09:48,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:09:48,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:09:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:09:49,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:09:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:09:49,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:09:49,088 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:09:49,089 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-10-11 14:09:49,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2024-10-11 14:09:49,091 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-10-11 14:09:49,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-10-11 14:09:49,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-10-11 14:09:49,092 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-10-11 14:09:49,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:09:49,092 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:09:49,148 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 14:09:49,148 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:09:49,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:09:49 BasicIcfg [2024-10-11 14:09:49,156 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:09:49,157 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:09:49,157 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:09:49,157 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:09:49,158 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:09:41" (3/4) ... [2024-10-11 14:09:49,158 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 14:09:49,236 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:09:49,238 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:09:49,239 INFO L158 Benchmark]: Toolchain (without parser) took 8870.73ms. Allocated memory was 148.9MB in the beginning and 224.4MB in the end (delta: 75.5MB). Free memory was 114.9MB in the beginning and 130.5MB in the end (delta: -15.6MB). Peak memory consumption was 63.0MB. Max. memory is 16.1GB. [2024-10-11 14:09:49,239 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 104.9MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:09:49,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.24ms. Allocated memory is still 148.9MB. Free memory was 114.9MB in the beginning and 82.8MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 14:09:49,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.88ms. Allocated memory is still 148.9MB. Free memory was 82.8MB in the beginning and 80.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:09:49,240 INFO L158 Benchmark]: Boogie Preprocessor took 80.98ms. Allocated memory is still 148.9MB. Free memory was 80.0MB in the beginning and 77.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:09:49,241 INFO L158 Benchmark]: RCFGBuilder took 770.72ms. Allocated memory is still 148.9MB. Free memory was 77.3MB in the beginning and 111.5MB in the end (delta: -34.1MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2024-10-11 14:09:49,241 INFO L158 Benchmark]: TraceAbstraction took 7223.47ms. Allocated memory was 148.9MB in the beginning and 224.4MB in the end (delta: 75.5MB). Free memory was 111.1MB in the beginning and 137.8MB in the end (delta: -26.8MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2024-10-11 14:09:49,241 INFO L158 Benchmark]: Witness Printer took 81.95ms. Allocated memory is still 224.4MB. Free memory was 137.8MB in the beginning and 130.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 14:09:49,243 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.23ms. Allocated memory is still 104.9MB. Free memory is still 78.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 636.24ms. Allocated memory is still 148.9MB. Free memory was 114.9MB in the beginning and 82.8MB in the end (delta: 32.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.88ms. Allocated memory is still 148.9MB. Free memory was 82.8MB in the beginning and 80.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.98ms. Allocated memory is still 148.9MB. Free memory was 80.0MB in the beginning and 77.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 770.72ms. Allocated memory is still 148.9MB. Free memory was 77.3MB in the beginning and 111.5MB in the end (delta: -34.1MB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7223.47ms. Allocated memory was 148.9MB in the beginning and 224.4MB in the end (delta: 75.5MB). Free memory was 111.1MB in the beginning and 137.8MB in the end (delta: -26.8MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. * Witness Printer took 81.95ms. Allocated memory is still 224.4MB. Free memory was 137.8MB in the beginning and 130.5MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 940]: 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[(400)]; [L936] 0 static unsigned int arr[(400)]; [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); [L1019] 0 pthread_t id1, id2; [L1021] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L988] 1 int i; [L989] 1 unsigned int tmp; [L990] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L990] COND TRUE 1 i<(400) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1022] 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] [L1004] 2 int i; [L1005] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L993] 1 tmp = __VERIFIER_nondet_uint() [L994] CALL 1 assume_abort_if_not(tmp < (400)) [L23] COND FALSE 1 !(!cond) [L994] RET 1 assume_abort_if_not(tmp < (400)) [L995] CALL, EXPR 1 push(arr,tmp) [L960] COND FALSE 1 !(top==(400)) [L967] CALL, EXPR 1 get_top() [L952] 1 return top; [L967] RET, EXPR 1 get_top() [L967] 1 stack[get_top()] = x [L968] CALL 1 inc_top() [L944] 1 top++ [L968] RET 1 inc_top() [L970] 1 return 0; [L995] RET, EXPR 1 push(arr,tmp) [L995] COND FALSE 1 !(push(arr,tmp)==(-1)) [L997] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=399, top=1] [L1005] COND TRUE 2 i<(400) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND FALSE 2 !(get_top()==0) [L981] CALL 2 dec_top() [L948] 2 top-- [L981] RET 2 dec_top() [L982] CALL, EXPR 2 get_top() [L952] 2 return top; [L982] RET, EXPR 2 get_top() [L982] EXPR 2 stack[get_top()] [L982] 2 return stack[get_top()]; [L1010] RET, EXPR 2 pop(arr) [L1010] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1005] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1005] COND TRUE 2 i<(400) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND TRUE 2 get_top()==0 [L977] 2 return (-2); [L1010] RET, EXPR 2 pop(arr) [L1010] COND TRUE 2 !(pop(arr)!=(-2)) [L1011] CALL 2 error() [L940] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1022]: 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: 1021]: 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: 940]: 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: 7.0s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 534 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 530 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 972 IncrementalHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 2 mSDtfsCounter, 972 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=6, InterpolantAutomatonStates: 43, 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, 3.1s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 164 ConstructedInterpolants, 7 QuantifiedInterpolants, 3067 SizeOfPredicates, 21 NumberOfNonLiveVariables, 295 ConjunctsInSsa, 20 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-11 14:09:49,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE