./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/stack_longer-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_longer-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 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:07:02,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:07:02,338 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,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:07:02,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:07:02,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:07:02,374 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:07:02,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:07:02,375 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:07:02,378 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:07:02,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:07:02,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:07:02,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:07:02,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:07:02,381 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:07:02,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:07:02,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:07:02,381 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:07:02,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:07:02,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:07:02,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:07:02,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:07:02,383 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:07:02,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:07:02,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:07:02,384 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:07:02,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:07:02,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:07:02,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:07:02,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:07:02,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:07:02,393 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:07:02,393 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:07:02,393 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:07:02,393 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:07:02,394 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:07:02,394 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:07:02,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:07:02,394 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:07:02,394 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:07:02,395 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:07:02,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:07:02,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:07:02,395 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 -> 4351dece6a672e511bbcb86915e62fc8a7361763ad7ab88f2e640b2d00ea50a7 [2024-01-27 16:07:02,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:07:02,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:07:02,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:07:02,641 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:07:02,642 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:07:02,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-1.i [2024-01-27 16:07:03,644 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:07:03,896 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:07:03,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i [2024-01-27 16:07:03,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f26fb20/0fa7233486c1437990c245bd168f318f/FLAG0bf393fdc [2024-01-27 16:07:03,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7f26fb20/0fa7233486c1437990c245bd168f318f [2024-01-27 16:07:03,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:07:03,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:07:03,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:07:03,924 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:07:03,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:07:03,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:07:03" (1/1) ... [2024-01-27 16:07:03,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f41fc5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:07:03, skipping insertion in model container [2024-01-27 16:07:03,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:07:03" (1/1) ... [2024-01-27 16:07:03,956 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:07:04,319 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_longer-1.i[41527,41540] [2024-01-27 16:07:04,350 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:07:04,361 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:07:04,388 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_longer-1.i[41527,41540] [2024-01-27 16:07:04,397 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:07:04,440 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:07:04,440 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,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:07:04,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:07:04,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:07:04,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:07:04,447 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,474 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,506 INFO L138 Inliner]: procedures = 278, calls = 41, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 163 [2024-01-27 16:07:04,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:07:04,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:07:04,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:07:04,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:07:04,515 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,516 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,530 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,547 INFO L175 MemorySlicer]: Split 14 memory accesses to 5 slices as follows [2, 2, 2, 5, 3]. 36 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 0, 5, 0]. The 4 writes are split as follows [0, 1, 1, 0, 2]. [2024-01-27 16:07:04,551 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,551 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,567 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,570 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,571 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,578 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,581 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:07:04,584 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:07:04,584 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:07:04,584 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:07:04,585 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,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:07:04,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:04,611 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,627 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,649 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-01-27 16:07:04,650 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-01-27 16:07:04,650 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-01-27 16:07:04,650 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-01-27 16:07:04,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:07:04,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:07:04,650 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-01-27 16:07:04,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:07:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:07:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 16:07:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 16:07:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 16:07:04,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:07:04,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:07:04,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:07:04,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:07:04,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 16:07:04,653 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-01-27 16:07:04,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:07:04,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:07:04,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:07:04,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:07:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:07:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 16:07:04,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:07:04,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:07:04,657 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:04,790 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:07:04,791 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:07:04,984 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:07:04,984 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:07:05,213 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:07:05,214 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-27 16:07:05,214 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,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:07:05,216 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:07:05,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:07:05,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:07:05,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:07:03" (1/3) ... [2024-01-27 16:07:05,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29784242 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,219 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,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29784242 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,220 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,221 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2024-01-27 16:07:05,227 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:07:05,235 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:07:05,235 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-01-27 16:07:05,235 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:07:05,285 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 16:07:05,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 86 flow [2024-01-27 16:07:05,339 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2024-01-27 16:07:05,340 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 16:07:05,342 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 70 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,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 36 transitions, 86 flow [2024-01-27 16:07:05,346 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 32 transitions, 73 flow [2024-01-27 16:07:05,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:07:05,366 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;@38549597, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:07:05,366 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-01-27 16:07:05,372 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:07:05,372 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2024-01-27 16:07:05,372 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-01-27 16:07:05,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:05,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:05,374 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,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:05,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2102362180, now seen corresponding path program 1 times [2024-01-27 16:07:05,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:05,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293733352] [2024-01-27 16:07:05,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:05,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:05,728 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:05,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:05,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293733352] [2024-01-27 16:07:05,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293733352] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:05,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:05,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:07:05,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942842842] [2024-01-27 16:07:05,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:05,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 16:07:05,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:05,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 16:07:05,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 16:07:05,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-01-27 16:07:05,768 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:05,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:05,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-01-27 16:07:05,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:05,969 INFO L124 PetriNetUnfolderBase]: 360/690 cut-off events. [2024-01-27 16:07:05,970 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-01-27 16:07:05,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 690 events. 360/690 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3236 event pairs, 82 based on Foata normal form. 46/686 useless extension candidates. Maximal degree in co-relation 1175. Up to 375 conditions per place. [2024-01-27 16:07:05,981 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 48 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2024-01-27 16:07:05,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 58 transitions, 236 flow [2024-01-27 16:07:05,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 16:07:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 16:07:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2024-01-27 16:07:05,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-01-27 16:07:05,996 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:05,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 58 transitions, 236 flow [2024-01-27 16:07:05,999 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,002 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2024-01-27 16:07:06,004 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,007 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2024-01-27 16:07:06,008 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2024-01-27 16:07:06,008 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,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:06,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:06,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:07:06,008 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,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash -175873598, now seen corresponding path program 1 times [2024-01-27 16:07:06,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:06,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244856108] [2024-01-27 16:07:06,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:06,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:06,164 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,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:06,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244856108] [2024-01-27 16:07:06,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244856108] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:06,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:06,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:07:06,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068502763] [2024-01-27 16:07:06,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:06,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:07:06,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:06,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:07:06,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:07:06,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-01-27 16:07:06,171 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,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:06,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-01-27 16:07:06,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:06,296 INFO L124 PetriNetUnfolderBase]: 355/667 cut-off events. [2024-01-27 16:07:06,297 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-01-27 16:07:06,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 667 events. 355/667 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2979 event pairs, 135 based on Foata normal form. 11/633 useless extension candidates. Maximal degree in co-relation 1024. Up to 415 conditions per place. [2024-01-27 16:07:06,302 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 34 selfloop transitions, 2 changer transitions 3/45 dead transitions. [2024-01-27 16:07:06,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 45 transitions, 191 flow [2024-01-27 16:07:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:07:06,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:07:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2024-01-27 16:07:06,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-01-27 16:07:06,306 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,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 45 transitions, 191 flow [2024-01-27 16:07:06,309 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,311 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 94 flow [2024-01-27 16:07:06,312 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,314 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2024-01-27 16:07:06,315 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 94 flow [2024-01-27 16:07:06,315 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,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:06,316 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:06,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:07:06,316 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,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:06,317 INFO L85 PathProgramCache]: Analyzing trace with hash 295937743, now seen corresponding path program 1 times [2024-01-27 16:07:06,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:06,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495636857] [2024-01-27 16:07:06,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:06,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:06,496 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,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:06,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495636857] [2024-01-27 16:07:06,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495636857] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:06,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164390126] [2024-01-27 16:07:06,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:06,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:06,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:06,501 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,502 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:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:06,602 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-27 16:07:06,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:06,665 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:06,746 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,746 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:06,801 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,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164390126] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:06,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:06,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-01-27 16:07:06,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393367238] [2024-01-27 16:07:06,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:06,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-27 16:07:06,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:06,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-27 16:07:06,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-01-27 16:07:06,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-01-27 16:07:06,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 94 flow. Second operand has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:06,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-01-27 16:07:06,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:07,150 INFO L124 PetriNetUnfolderBase]: 1079/2073 cut-off events. [2024-01-27 16:07:07,150 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-01-27 16:07:07,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4314 conditions, 2073 events. 1079/2073 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 10900 event pairs, 83 based on Foata normal form. 0/1972 useless extension candidates. Maximal degree in co-relation 3740. Up to 408 conditions per place. [2024-01-27 16:07:07,161 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 142 selfloop transitions, 18 changer transitions 3/171 dead transitions. [2024-01-27 16:07:07,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 171 transitions, 753 flow [2024-01-27 16:07:07,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-27 16:07:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-27 16:07:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 275 transitions. [2024-01-27 16:07:07,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6365740740740741 [2024-01-27 16:07:07,164 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,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 171 transitions, 753 flow [2024-01-27 16:07:07,166 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,167 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 239 flow [2024-01-27 16:07:07,168 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,168 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2024-01-27 16:07:07,168 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 239 flow [2024-01-27 16:07:07,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.9) internal successors, (119), 10 states have internal predecessors, (119), 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,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:07,169 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,182 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,380 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,381 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,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:07,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1512753331, now seen corresponding path program 1 times [2024-01-27 16:07:07,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:07,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533444017] [2024-01-27 16:07:07,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:07,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:07,432 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,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:07,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533444017] [2024-01-27 16:07:07,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533444017] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:07,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:07,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 16:07:07,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497022181] [2024-01-27 16:07:07,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:07,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:07:07,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:07,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:07:07,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:07:07,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-01-27 16:07:07,438 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,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:07,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-01-27 16:07:07,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:07,593 INFO L124 PetriNetUnfolderBase]: 633/1321 cut-off events. [2024-01-27 16:07:07,593 INFO L125 PetriNetUnfolderBase]: For 467/467 co-relation queries the response was YES. [2024-01-27 16:07:07,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2952 conditions, 1321 events. 633/1321 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 6515 event pairs, 222 based on Foata normal form. 60/1364 useless extension candidates. Maximal degree in co-relation 2825. Up to 607 conditions per place. [2024-01-27 16:07:07,599 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 44 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2024-01-27 16:07:07,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 317 flow [2024-01-27 16:07:07,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:07:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:07:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2024-01-27 16:07:07,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-01-27 16:07:07,600 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:07,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 317 flow [2024-01-27 16:07:07,606 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:07,609 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 180 flow [2024-01-27 16:07:07,609 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:07,610 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2024-01-27 16:07:07,611 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 180 flow [2024-01-27 16:07:07,611 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:07,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:07,611 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:07,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 16:07:07,611 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:07,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:07,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1018894772, now seen corresponding path program 1 times [2024-01-27 16:07:07,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:07,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016799261] [2024-01-27 16:07:07,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:07,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:07,932 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,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:07,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016799261] [2024-01-27 16:07:07,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016799261] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:07:07,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:07:07,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:07:07,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698694901] [2024-01-27 16:07:07,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:07:07,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:07:07,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:07,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:07:07,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:07:07,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-01-27 16:07:07,938 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:07,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:07,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-01-27 16:07:07,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:08,140 INFO L124 PetriNetUnfolderBase]: 699/1437 cut-off events. [2024-01-27 16:07:08,140 INFO L125 PetriNetUnfolderBase]: For 534/534 co-relation queries the response was YES. [2024-01-27 16:07:08,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3322 conditions, 1437 events. 699/1437 cut-off events. For 534/534 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 7219 event pairs, 162 based on Foata normal form. 0/1414 useless extension candidates. Maximal degree in co-relation 2922. Up to 902 conditions per place. [2024-01-27 16:07:08,147 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 63 selfloop transitions, 5 changer transitions 3/79 dead transitions. [2024-01-27 16:07:08,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 79 transitions, 418 flow [2024-01-27 16:07:08,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:07:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:07:08,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-01-27 16:07:08,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-01-27 16:07:08,150 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,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 79 transitions, 418 flow [2024-01-27 16:07:08,153 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,153 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 212 flow [2024-01-27 16:07:08,154 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,156 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2024-01-27 16:07:08,156 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 212 flow [2024-01-27 16:07:08,156 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,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:08,156 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,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 16:07:08,157 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,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:08,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1972434909, now seen corresponding path program 1 times [2024-01-27 16:07:08,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:08,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693482381] [2024-01-27 16:07:08,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:08,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:08,646 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:08,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:07:08,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693482381] [2024-01-27 16:07:08,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693482381] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:07:08,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637128233] [2024-01-27 16:07:08,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:08,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:07:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:07:08,648 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:08,649 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:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:07:08,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-27 16:07:08,751 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:07:08,766 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:08,803 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:08,884 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:08,937 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:08,938 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:07:09,296 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,345 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,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637128233] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:07:09,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:07:09,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-01-27 16:07:09,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17726429] [2024-01-27 16:07:09,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:07:09,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-01-27 16:07:09,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:07:09,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-01-27 16:07:09,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-01-27 16:07:09,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-01-27 16:07:09,348 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,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:07:09,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-01-27 16:07:09,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:07:09,863 INFO L124 PetriNetUnfolderBase]: 975/2003 cut-off events. [2024-01-27 16:07:09,863 INFO L125 PetriNetUnfolderBase]: For 897/897 co-relation queries the response was YES. [2024-01-27 16:07:09,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4598 conditions, 2003 events. 975/2003 cut-off events. For 897/897 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10302 event pairs, 160 based on Foata normal form. 0/1978 useless extension candidates. Maximal degree in co-relation 3638. Up to 284 conditions per place. [2024-01-27 16:07:09,872 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 140 selfloop transitions, 20 changer transitions 0/168 dead transitions. [2024-01-27 16:07:09,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 168 transitions, 874 flow [2024-01-27 16:07:09,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-27 16:07:09,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-27 16:07:09,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 265 transitions. [2024-01-27 16:07:09,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6134259259259259 [2024-01-27 16:07:09,874 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 212 flow. Second operand 12 states and 265 transitions. [2024-01-27 16:07:09,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 168 transitions, 874 flow [2024-01-27 16:07:09,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 168 transitions, 869 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 16:07:09,879 INFO L231 Difference]: Finished difference. Result has 70 places, 57 transitions, 322 flow [2024-01-27 16:07:09,879 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=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=322, PETRI_PLACES=70, PETRI_TRANSITIONS=57} [2024-01-27 16:07:09,879 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places. [2024-01-27 16:07:09,879 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 57 transitions, 322 flow [2024-01-27 16:07:09,880 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:09,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:07:09,880 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:09,893 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,092 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,093 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,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:07:10,093 INFO L85 PathProgramCache]: Analyzing trace with hash 954371611, now seen corresponding path program 1 times [2024-01-27 16:07:10,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:07:10,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271776179] [2024-01-27 16:07:10,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:07:10,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:07:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:07:10,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:07:10,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:07:10,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:07:10,174 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:07:10,174 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-01-27 16:07:10,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2024-01-27 16:07:10,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-01-27 16:07:10,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-01-27 16:07:10,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-01-27 16:07:10,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-01-27 16:07:10,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:07:10,177 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:07:10,182 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:07:10,183 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:07:10,249 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,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:07:10,251 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:07:10,251 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:07:10,252 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:07:10,252 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,253 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:07:10,312 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:07:10,312 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:07:10,313 INFO L158 Benchmark]: Toolchain (without parser) took 6392.91ms. Allocated memory was 176.2MB in the beginning and 281.0MB in the end (delta: 104.9MB). Free memory was 140.1MB in the beginning and 132.8MB in the end (delta: 7.3MB). Peak memory consumption was 115.1MB. Max. memory is 16.1GB. [2024-01-27 16:07:10,313 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:07:10,313 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.98ms. Allocated memory is still 176.2MB. Free memory was 140.1MB in the beginning and 109.4MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-01-27 16:07:10,314 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.23ms. Allocated memory is still 176.2MB. Free memory was 109.4MB in the beginning and 106.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:07:10,314 INFO L158 Benchmark]: Boogie Preprocessor took 75.62ms. Allocated memory is still 176.2MB. Free memory was 106.7MB in the beginning and 104.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:07:10,314 INFO L158 Benchmark]: RCFGBuilder took 630.76ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 104.3MB in the beginning and 190.6MB in the end (delta: -86.3MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2024-01-27 16:07:10,314 INFO L158 Benchmark]: TraceAbstraction took 5035.02ms. Allocated memory was 232.8MB in the beginning and 281.0MB in the end (delta: 48.2MB). Free memory was 189.5MB in the beginning and 140.2MB in the end (delta: 49.4MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-01-27 16:07:10,314 INFO L158 Benchmark]: Witness Printer took 61.04ms. Allocated memory is still 281.0MB. Free memory was 140.2MB in the beginning and 132.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-01-27 16:07:10,316 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.98ms. Allocated memory is still 176.2MB. Free memory was 140.1MB in the beginning and 109.4MB in the end (delta: 30.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.23ms. Allocated memory is still 176.2MB. Free memory was 109.4MB in the beginning and 106.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.62ms. Allocated memory is still 176.2MB. Free memory was 106.7MB in the beginning and 104.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 630.76ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 104.3MB in the beginning and 190.6MB in the end (delta: -86.3MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5035.02ms. Allocated memory was 232.8MB in the beginning and 281.0MB in the end (delta: 48.2MB). Free memory was 189.5MB in the beginning and 140.2MB in the end (delta: 49.4MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * Witness Printer took 61.04ms. Allocated memory is still 281.0MB. Free memory was 140.2MB in the beginning and 132.8MB 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={6:0}, id2={5:0}, m={4:0}, top=0] [L988] 1 int i; [L989] 1 unsigned int tmp; [L990] 1 i=0 VAL [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 [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={6:0}, id2={5:0}, m={4:0}, top=0] [L1004] 2 int i; [L1005] 2 i=0 VAL [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 [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L1005] COND TRUE 2 i<(400) VAL [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 [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 [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: 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: 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: 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, 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, 536 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 534 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 930 IncrementalHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 0 mSDtfsCounter, 930 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=6, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 164 ConstructedInterpolants, 7 QuantifiedInterpolants, 1859 SizeOfPredicates, 21 NumberOfNonLiveVariables, 345 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-01-27 16:07:10,340 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