./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/stack_longest-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread/stack_longest-1.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 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:07:02,570 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:07:02,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:07:02,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:07:02,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:07:02,646 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:07:02,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:07:02,647 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:07:02,647 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:07:02,647 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:07:02,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:07:02,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:07:02,648 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:07:02,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:07:02,649 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:07:02,649 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:07:02,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:07:02,649 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:07:02,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:07:02,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:07:02,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:07:02,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:07:02,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:07:02,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:07:02,655 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:07:02,655 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:07:02,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:07:02,655 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:07:02,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:07:02,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:07:02,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:07:02,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:07:02,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:07:02,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:07:02,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:07:02,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:07:02,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:07:02,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:07:02,658 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:07:02,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:07:02,658 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:07:02,659 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:07:02,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:07:02,659 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 -> 529fe0895c01c52d9b18b51c32204a307faf547c0c07b22bc1a431308affcf90 [2024-01-27 16:07:02,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:07:02,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:07:02,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:07:02,838 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:07:02,838 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:07:02,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-1.i [2024-01-27 16:07:03,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:07:04,146 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:07:04,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-1.i [2024-01-27 16:07:04,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c839e74a8/fdd5abb9fa6846669cc1b4157784af48/FLAG23a985528 [2024-01-27 16:07:04,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c839e74a8/fdd5abb9fa6846669cc1b4157784af48 [2024-01-27 16:07:04,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:07:04,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:07:04,180 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:07:04,180 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:07:04,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:07:04,184 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:07:04" (1/1) ... [2024-01-27 16:07:04,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55fa63be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:04, skipping insertion in model container [2024-01-27 16:07:04,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:07:04" (1/1) ... [2024-01-27 16:07:04,232 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:07:04,528 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-1.i[41530,41543] [2024-01-27 16:07:04,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:07:04,588 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:07:04,636 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-1.i[41530,41543] [2024-01-27 16:07:04,643 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:07:04,696 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:07:04,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:04 WrapperNode [2024-01-27 16:07:04,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:07:04,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:07:04,698 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:07:04,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:07:04,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:04" (1/1) ... [2024-01-27 16:07:04,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:04" (1/1) ... [2024-01-27 16:07:04,810 INFO L138 Inliner]: procedures = 278, calls = 41, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 163 [2024-01-27 16:07:04,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:07:04,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:07:04,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:07:04,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:07:04,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:04" (1/1) ... [2024-01-27 16:07:04,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:04" (1/1) ... [2024-01-27 16:07:04,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:04" (1/1) ... [2024-01-27 16:07:04,856 INFO L175 MemorySlicer]: Split 14 memory accesses to 5 slices as follows [2, 5, 2, 3, 2]. 36 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0, 0]. The 4 writes are split as follows [0, 0, 1, 2, 1]. [2024-01-27 16:07:04,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:04" (1/1) ... [2024-01-27 16:07:04,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:04" (1/1) ... [2024-01-27 16:07:04,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:04" (1/1) ... [2024-01-27 16:07:04,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:04" (1/1) ... [2024-01-27 16:07:04,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:04" (1/1) ... [2024-01-27 16:07:04,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:04" (1/1) ... [2024-01-27 16:07:04,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:07:04,893 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:07:04,893 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:07:04,893 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:07:04,894 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:04" (1/1) ... [2024-01-27 16:07:04,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:07:04,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:04,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 16:07:04,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 16:07:04,972 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-01-27 16:07:04,973 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-01-27 16:07:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-01-27 16:07:04,973 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-01-27 16:07:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:07:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:07:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-27 16:07:04,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:07:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:07:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 16:07:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 16:07:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 16:07:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:07:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:07:04,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:07:04,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:07:04,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:07:04,975 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-27 16:07:04,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:07:04,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:07:04,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:07:04,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:07:04,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:07:04,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:07:04,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:07:04,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:07:04,977 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 16:07:05,107 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:07:05,120 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:07:05,334 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:07:05,335 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:07:05,505 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:07:05,505 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-27 16:07:05,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:07:05 BoogieIcfgContainer [2024-01-27 16:07:05,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:07:05,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:07:05,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:07:05,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:07:05,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:07:04" (1/3) ... [2024-01-27 16:07:05,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c91af6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:07:05, skipping insertion in model container [2024-01-27 16:07:05,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:04" (2/3) ... [2024-01-27 16:07:05,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c91af6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:07:05, skipping insertion in model container [2024-01-27 16:07:05,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:07:05" (3/3) ... [2024-01-27 16:07:05,513 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2024-01-27 16:07:05,520 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:07:05,527 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:07:05,527 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-01-27 16:07:05,528 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:07:05,576 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 16:07:05,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 86 flow [2024-01-27 16:07:05,647 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2024-01-27 16:07:05,647 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 16:07:05,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 34 events. 5/34 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 3 conditions per place. [2024-01-27 16:07:05,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 36 transitions, 86 flow [2024-01-27 16:07:05,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 32 transitions, 73 flow [2024-01-27 16:07:05,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:07:05,675 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@20b6acca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:07:05,675 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-01-27 16:07:05,683 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:07:05,684 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2024-01-27 16:07:05,684 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 16:07:05,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:05,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:05,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:05,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:05,691 INFO L85 PathProgramCache]: Analyzing trace with hash 359551845, now seen corresponding path program 1 times [2024-01-27 16:07:05,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:05,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594181484] [2024-01-27 16:07:05,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:05,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:06,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:06,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594181484] [2024-01-27 16:07:06,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594181484] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:06,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:06,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:07:06,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478873013] [2024-01-27 16:07:06,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:06,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:07:06,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:06,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:07:06,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:07:06,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-01-27 16:07:06,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 73 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-01-27 16:07:06,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:06,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-01-27 16:07:06,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:06,375 INFO L124 PetriNetUnfolderBase]: 360/691 cut-off events. [2024-01-27 16:07:06,375 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-01-27 16:07:06,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 691 events. 360/691 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3223 event pairs, 82 based on Foata normal form. 46/687 useless extension candidates. Maximal degree in co-relation 1176. Up to 375 conditions per place. [2024-01-27 16:07:06,384 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-01-27 16:07:06,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 58 transitions, 236 flow [2024-01-27 16:07:06,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:07:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:07:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-01-27 16:07:06,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-01-27 16:07:06,397 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 73 flow. Second operand 4 states and 92 transitions. [2024-01-27 16:07:06,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 58 transitions, 236 flow [2024-01-27 16:07:06,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 58 transitions, 227 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:07:06,404 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2024-01-27 16:07:06,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2024-01-27 16:07:06,409 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2024-01-27 16:07:06,409 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2024-01-27 16:07:06,409 INFO L496 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-01-27 16:07:06,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:06,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:06,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:07:06,410 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:06,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:06,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1331876366, now seen corresponding path program 1 times [2024-01-27 16:07:06,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:06,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186083554] [2024-01-27 16:07:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:06,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:06,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:06,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186083554] [2024-01-27 16:07:06,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186083554] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:06,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:06,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:07:06,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475047399] [2024-01-27 16:07:06,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:06,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:07:06,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:06,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:07:06,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:07:06,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-01-27 16:07:06,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 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-01-27 16:07:06,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:06,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-01-27 16:07:06,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:06,628 INFO L124 PetriNetUnfolderBase]: 355/668 cut-off events. [2024-01-27 16:07:06,629 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-01-27 16:07:06,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 668 events. 355/668 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2975 event pairs, 135 based on Foata normal form. 11/636 useless extension candidates. Maximal degree in co-relation 1024. Up to 415 conditions per place. [2024-01-27 16:07:06,632 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 34 selfloop transitions, 2 changer transitions 3/45 dead transitions. [2024-01-27 16:07:06,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 191 flow [2024-01-27 16:07:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:07:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:07:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2024-01-27 16:07:06,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-01-27 16:07:06,635 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 3 states and 64 transitions. [2024-01-27 16:07:06,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 191 flow [2024-01-27 16:07:06,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:07:06,639 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 94 flow [2024-01-27 16:07:06,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2024-01-27 16:07:06,642 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2024-01-27 16:07:06,642 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 94 flow [2024-01-27 16:07:06,643 INFO L496 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-01-27 16:07:06,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:06,643 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:06,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:07:06,644 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:06,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:06,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1211614066, now seen corresponding path program 1 times [2024-01-27 16:07:06,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:06,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573382060] [2024-01-27 16:07:06,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:06,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:06,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:06,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573382060] [2024-01-27 16:07:06,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573382060] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:06,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673726099] [2024-01-27 16:07:06,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:06,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:06,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:06,928 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-01-27 16:07:06,931 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-01-27 16:07:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:07,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-27 16:07:07,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:07,094 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-01-27 16:07:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:07,159 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:07,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673726099] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:07,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:07,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-01-27 16:07:07,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018923023] [2024-01-27 16:07:07,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:07,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-01-27 16:07:07,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:07,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-01-27 16:07:07,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-01-27 16:07:07,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-01-27 16:07:07,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 94 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-01-27 16:07:07,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:07,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-01-27 16:07:07,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:07,588 INFO L124 PetriNetUnfolderBase]: 1079/2074 cut-off events. [2024-01-27 16:07:07,588 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2024-01-27 16:07:07,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4315 conditions, 2074 events. 1079/2074 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 10916 event pairs, 83 based on Foata normal form. 0/1973 useless extension candidates. Maximal degree in co-relation 3740. Up to 408 conditions per place. [2024-01-27 16:07:07,597 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 142 selfloop transitions, 18 changer transitions 3/171 dead transitions. [2024-01-27 16:07:07,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 171 transitions, 753 flow [2024-01-27 16:07:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-27 16:07:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-27 16:07:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 275 transitions. [2024-01-27 16:07:07,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6365740740740741 [2024-01-27 16:07:07,599 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 94 flow. Second operand 12 states and 275 transitions. [2024-01-27 16:07:07,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 171 transitions, 753 flow [2024-01-27 16:07:07,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 171 transitions, 751 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:07:07,602 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 239 flow [2024-01-27 16:07:07,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=239, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2024-01-27 16:07:07,603 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2024-01-27 16:07:07,603 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 239 flow [2024-01-27 16:07:07,603 INFO L496 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-01-27 16:07:07,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:07,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:07,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-27 16:07:07,826 WARN L477 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-01-27 16:07:07,827 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:07,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:07,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1937202353, now seen corresponding path program 1 times [2024-01-27 16:07:07,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:07,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770782700] [2024-01-27 16:07:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:07,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:07,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:07,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:07,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770782700] [2024-01-27 16:07:07,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770782700] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:07,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:07,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:07:07,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810933621] [2024-01-27 16:07:07,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:07,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:07:07,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:07,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:07:07,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:07:07,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-01-27 16:07:07,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 239 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-01-27 16:07:07,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:07,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-01-27 16:07:07,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:08,034 INFO L124 PetriNetUnfolderBase]: 633/1322 cut-off events. [2024-01-27 16:07:08,034 INFO L125 PetriNetUnfolderBase]: For 467/467 co-relation queries the response was YES. [2024-01-27 16:07:08,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2953 conditions, 1322 events. 633/1322 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6455 event pairs, 222 based on Foata normal form. 60/1365 useless extension candidates. Maximal degree in co-relation 2826. Up to 607 conditions per place. [2024-01-27 16:07:08,039 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 44 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2024-01-27 16:07:08,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 317 flow [2024-01-27 16:07:08,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:07:08,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:07:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2024-01-27 16:07:08,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-01-27 16:07:08,040 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 239 flow. Second operand 3 states and 63 transitions. [2024-01-27 16:07:08,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 317 flow [2024-01-27 16:07:08,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 293 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-01-27 16:07:08,048 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 180 flow [2024-01-27 16:07:08,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-01-27 16:07:08,049 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2024-01-27 16:07:08,049 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 180 flow [2024-01-27 16:07:08,050 INFO L496 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-01-27 16:07:08,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:08,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:08,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:07:08,050 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:08,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:08,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1492323094, now seen corresponding path program 1 times [2024-01-27 16:07:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:08,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008503187] [2024-01-27 16:07:08,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:08,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:08,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:08,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008503187] [2024-01-27 16:07:08,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008503187] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:08,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:08,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:07:08,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649938483] [2024-01-27 16:07:08,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:08,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:07:08,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:08,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:07:08,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:07:08,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-01-27 16:07:08,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 180 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-01-27 16:07:08,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:08,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-01-27 16:07:08,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:08,613 INFO L124 PetriNetUnfolderBase]: 699/1438 cut-off events. [2024-01-27 16:07:08,613 INFO L125 PetriNetUnfolderBase]: For 531/531 co-relation queries the response was YES. [2024-01-27 16:07:08,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1438 events. 699/1438 cut-off events. For 531/531 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7225 event pairs, 162 based on Foata normal form. 0/1415 useless extension candidates. Maximal degree in co-relation 2923. Up to 902 conditions per place. [2024-01-27 16:07:08,619 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 63 selfloop transitions, 5 changer transitions 3/79 dead transitions. [2024-01-27 16:07:08,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 79 transitions, 418 flow [2024-01-27 16:07:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:07:08,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:07:08,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-01-27 16:07:08,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-01-27 16:07:08,621 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 180 flow. Second operand 5 states and 105 transitions. [2024-01-27 16:07:08,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 79 transitions, 418 flow [2024-01-27 16:07:08,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 79 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:07:08,624 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 212 flow [2024-01-27 16:07:08,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2024-01-27 16:07:08,625 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2024-01-27 16:07:08,625 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 212 flow [2024-01-27 16:07:08,626 INFO L496 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-01-27 16:07:08,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:08,626 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:08,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:07:08,626 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:08,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:08,627 INFO L85 PathProgramCache]: Analyzing trace with hash -536815719, now seen corresponding path program 1 times [2024-01-27 16:07:08,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:08,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577163613] [2024-01-27 16:07:08,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:08,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:09,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:09,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:09,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577163613] [2024-01-27 16:07:09,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577163613] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:09,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950973548] [2024-01-27 16:07:09,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:09,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:09,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:09,064 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-01-27 16:07:09,071 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-01-27 16:07:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:09,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-27 16:07:09,182 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:09,202 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-01-27 16:07:09,243 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-01-27 16:07:09,303 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-01-27 16:07:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:09,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:09,660 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-01-27 16:07:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:07:09,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950973548] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:09,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:09,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-01-27 16:07:09,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989387275] [2024-01-27 16:07:09,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:09,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-27 16:07:09,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:09,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-27 16:07:09,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-01-27 16:07:09,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-01-27 16:07:09,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 212 flow. Second operand has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:09,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:09,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-01-27 16:07:09,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:10,229 INFO L124 PetriNetUnfolderBase]: 1012/2083 cut-off events. [2024-01-27 16:07:10,229 INFO L125 PetriNetUnfolderBase]: For 936/936 co-relation queries the response was YES. [2024-01-27 16:07:10,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4799 conditions, 2083 events. 1012/2083 cut-off events. For 936/936 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10623 event pairs, 160 based on Foata normal form. 0/2058 useless extension candidates. Maximal degree in co-relation 3742. Up to 284 conditions per place. [2024-01-27 16:07:10,237 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 142 selfloop transitions, 21 changer transitions 0/171 dead transitions. [2024-01-27 16:07:10,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 171 transitions, 888 flow [2024-01-27 16:07:10,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-27 16:07:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-27 16:07:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 268 transitions. [2024-01-27 16:07:10,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6203703703703703 [2024-01-27 16:07:10,239 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 212 flow. Second operand 12 states and 268 transitions. [2024-01-27 16:07:10,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 171 transitions, 888 flow [2024-01-27 16:07:10,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 171 transitions, 883 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:07:10,242 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 319 flow [2024-01-27 16:07:10,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=319, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2024-01-27 16:07:10,243 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2024-01-27 16:07:10,243 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 319 flow [2024-01-27 16:07:10,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.615384615384615) internal successors, (164), 13 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 16:07:10,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:10,243 INFO L208 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-01-27 16:07:10,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 16:07:10,454 WARN L477 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-01-27 16:07:10,454 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 16:07:10,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:10,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2073443491, now seen corresponding path program 1 times [2024-01-27 16:07:10,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:10,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381388784] [2024-01-27 16:07:10,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:10,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:07:10,481 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:07:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:07:10,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:07:10,516 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:07:10,517 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-01-27 16:07:10,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2024-01-27 16:07:10,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-01-27 16:07:10,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-01-27 16:07:10,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-01-27 16:07:10,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-01-27 16:07:10,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:07:10,519 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:10,523 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:07:10,523 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:07:10,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:07:10 BasicIcfg [2024-01-27 16:07:10,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:07:10,553 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:07:10,553 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:07:10,553 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:07:10,553 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:07:05" (3/4) ... [2024-01-27 16:07:10,554 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:07:10,593 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:07:10,593 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:07:10,593 INFO L158 Benchmark]: Toolchain (without parser) took 6415.33ms. Allocated memory was 159.4MB in the beginning and 325.1MB in the end (delta: 165.7MB). Free memory was 83.8MB in the beginning and 150.0MB in the end (delta: -66.2MB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. [2024-01-27 16:07:10,593 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 159.4MB. Free memory is still 109.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:07:10,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.10ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 53.5MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-01-27 16:07:10,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.48ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 53.5MB in the beginning and 194.2MB in the end (delta: -140.8MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-01-27 16:07:10,594 INFO L158 Benchmark]: Boogie Preprocessor took 80.98ms. Allocated memory is still 224.4MB. Free memory was 194.2MB in the beginning and 191.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:07:10,594 INFO L158 Benchmark]: RCFGBuilder took 612.98ms. Allocated memory is still 224.4MB. Free memory was 191.1MB in the beginning and 146.0MB in the end (delta: 45.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-01-27 16:07:10,594 INFO L158 Benchmark]: TraceAbstraction took 5045.67ms. Allocated memory was 224.4MB in the beginning and 325.1MB in the end (delta: 100.7MB). Free memory was 144.9MB in the beginning and 157.3MB in the end (delta: -12.4MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. [2024-01-27 16:07:10,594 INFO L158 Benchmark]: Witness Printer took 39.71ms. Allocated memory is still 325.1MB. Free memory was 157.3MB in the beginning and 150.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-01-27 16:07:10,595 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.10ms. Allocated memory is still 159.4MB. Free memory is still 109.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 517.10ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 53.5MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.48ms. Allocated memory was 159.4MB in the beginning and 224.4MB in the end (delta: 65.0MB). Free memory was 53.5MB in the beginning and 194.2MB in the end (delta: -140.8MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.98ms. Allocated memory is still 224.4MB. Free memory was 194.2MB in the beginning and 191.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 612.98ms. Allocated memory is still 224.4MB. Free memory was 191.1MB in the beginning and 146.0MB in the end (delta: 45.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5045.67ms. Allocated memory was 224.4MB in the beginning and 325.1MB in the end (delta: 100.7MB). Free memory was 144.9MB in the beginning and 157.3MB in the end (delta: -12.4MB). Peak memory consumption was 89.3MB. Max. memory is 16.1GB. * Witness Printer took 39.71ms. Allocated memory is still 325.1MB. Free memory was 157.3MB in the beginning and 150.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. 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[(800)]; [L936] 0 static unsigned int arr[(800)]; [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); [L1020] 0 pthread_t id1, id2; [L1022] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={5:0}, id2={6:0}, m={4:0}, top=0] [L989] 1 int i; [L990] 1 unsigned int tmp; [L991] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L991] COND TRUE 1 i<(800) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={5:0}, id2={6:0}, m={4:0}, top=0] [L1005] 2 int i; [L1006] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L994] 1 tmp = __VERIFIER_nondet_uint() [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L23] COND FALSE 1 !(!cond) [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) [L968] CALL, EXPR 1 get_top() [L953] 1 return top; [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x [L969] CALL 1 inc_top() [L945] 1 top++ [L969] RET 1 inc_top() [L971] 1 return 0; [L996] RET, EXPR 1 push(arr,tmp) [L996] COND FALSE 1 !(push(arr,tmp)==(-1)) [L998] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L1006] COND TRUE 2 i<(800) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND FALSE 2 !(get_top()==0) [L982] CALL 2 dec_top() [L949] 2 top-- [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; [L983] RET, EXPR 2 get_top() [L983] EXPR 2 stack[get_top()] [L983] 2 return stack[get_top()]; [L1011] RET, EXPR 2 pop(arr) [L1011] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1006] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND TRUE 2 get_top()==0 [L978] 2 return (-2); [L1011] RET, EXPR 2 pop(arr) [L1011] COND TRUE 2 !(pop(arr)!=(-2)) [L1012] 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: 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: 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, 56 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 511 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 509 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1024 IncrementalHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 0 mSDtfsCounter, 1024 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=319occurred 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 164 ConstructedInterpolants, 7 QuantifiedInterpolants, 1762 SizeOfPredicates, 21 NumberOfNonLiveVariables, 345 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-01-27 16:07:10,631 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