./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c --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/weaver/popl20-bad-counter-queue.wvr.c -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 ebdf94362dc31684fc6d7640230484df679da941d20fe978f9edfe1d75c48a51 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 16:19:08,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 16:19:08,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 16:19:08,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 16:19:08,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 16:19:08,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 16:19:08,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 16:19:08,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 16:19:08,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 16:19:08,119 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 16:19:08,119 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 16:19:08,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 16:19:08,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 16:19:08,120 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 16:19:08,121 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 16:19:08,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 16:19:08,121 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 16:19:08,122 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 16:19:08,122 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 16:19:08,122 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 16:19:08,123 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 16:19:08,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 16:19:08,123 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 16:19:08,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 16:19:08,124 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 16:19:08,124 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 16:19:08,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 16:19:08,125 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 16:19:08,125 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 16:19:08,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 16:19:08,126 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 16:19:08,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 16:19:08,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:19:08,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 16:19:08,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 16:19:08,128 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 16:19:08,128 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 16:19:08,128 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 16:19:08,129 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 16:19:08,129 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 16:19:08,129 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 16:19:08,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 16:19:08,130 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 16:19:08,130 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 -> ebdf94362dc31684fc6d7640230484df679da941d20fe978f9edfe1d75c48a51 [2024-01-27 16:19:08,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 16:19:08,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 16:19:08,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 16:19:08,314 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 16:19:08,314 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 16:19:08,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-01-27 16:19:09,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 16:19:09,577 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 16:19:09,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-01-27 16:19:09,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f643e52b/46040efd78694e76b53ca8a37d357213/FLAG8759448ce [2024-01-27 16:19:09,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f643e52b/46040efd78694e76b53ca8a37d357213 [2024-01-27 16:19:09,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 16:19:09,598 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 16:19:09,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 16:19:09,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 16:19:09,603 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 16:19:09,604 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:19:09" (1/1) ... [2024-01-27 16:19:09,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157e9ac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:09, skipping insertion in model container [2024-01-27 16:19:09,605 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 04:19:09" (1/1) ... [2024-01-27 16:19:09,622 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 16:19:09,821 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2454,2467] [2024-01-27 16:19:09,839 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:19:09,847 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 16:19:09,860 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2454,2467] [2024-01-27 16:19:09,878 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 16:19:09,892 INFO L206 MainTranslator]: Completed translation [2024-01-27 16:19:09,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:09 WrapperNode [2024-01-27 16:19:09,896 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 16:19:09,897 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 16:19:09,897 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 16:19:09,897 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 16:19:09,902 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:19:09" (1/1) ... [2024-01-27 16:19:09,908 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:19:09" (1/1) ... [2024-01-27 16:19:09,933 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 150 [2024-01-27 16:19:09,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 16:19:09,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 16:19:09,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 16:19:09,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 16:19:09,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:09" (1/1) ... [2024-01-27 16:19:09,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:09" (1/1) ... [2024-01-27 16:19:09,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:09" (1/1) ... [2024-01-27 16:19:09,981 INFO L175 MemorySlicer]: Split 9 memory accesses to 4 slices as follows [2, 2, 3, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-27 16:19:09,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:09" (1/1) ... [2024-01-27 16:19:09,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:09" (1/1) ... [2024-01-27 16:19:09,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:09" (1/1) ... [2024-01-27 16:19:09,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:09" (1/1) ... [2024-01-27 16:19:09,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:09" (1/1) ... [2024-01-27 16:19:09,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:09" (1/1) ... [2024-01-27 16:19:09,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 16:19:09,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 16:19:09,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 16:19:09,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 16:19:09,995 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:09" (1/1) ... [2024-01-27 16:19:10,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 16:19:10,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:10,027 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:19:10,037 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:19:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 16:19:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 16:19:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 16:19:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 16:19:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 16:19:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 16:19:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 16:19:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 16:19:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 16:19:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 16:19:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 16:19:10,076 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 16:19:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 16:19:10,076 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 16:19:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 16:19:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 16:19:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 16:19:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 16:19:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 16:19:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 16:19:10,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 16:19:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 16:19:10,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 16:19:10,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 16:19:10,081 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:19:10,171 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 16:19:10,173 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 16:19:10,348 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 16:19:10,350 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 16:19:10,505 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 16:19:10,507 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-27 16:19:10,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:19:10 BoogieIcfgContainer [2024-01-27 16:19:10,508 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 16:19:10,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 16:19:10,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 16:19:10,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 16:19:10,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 04:19:09" (1/3) ... [2024-01-27 16:19:10,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42bdd978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:19:10, skipping insertion in model container [2024-01-27 16:19:10,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 04:19:09" (2/3) ... [2024-01-27 16:19:10,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42bdd978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 04:19:10, skipping insertion in model container [2024-01-27 16:19:10,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:19:10" (3/3) ... [2024-01-27 16:19:10,517 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-01-27 16:19:10,523 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 16:19:10,530 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 16:19:10,530 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 16:19:10,530 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 16:19:10,586 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 16:19:10,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 27 transitions, 68 flow [2024-01-27 16:19:10,634 INFO L124 PetriNetUnfolderBase]: 3/25 cut-off events. [2024-01-27 16:19:10,634 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 16:19:10,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 3/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2024-01-27 16:19:10,641 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 27 transitions, 68 flow [2024-01-27 16:19:10,643 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 24 transitions, 60 flow [2024-01-27 16:19:10,650 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 16:19:10,656 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;@56bdb4b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 16:19:10,656 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-01-27 16:19:10,664 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 16:19:10,664 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2024-01-27 16:19:10,664 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 16:19:10,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:10,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:10,666 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:19:10,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:10,673 INFO L85 PathProgramCache]: Analyzing trace with hash 745609022, now seen corresponding path program 1 times [2024-01-27 16:19:10,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:10,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576044732] [2024-01-27 16:19:10,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:10,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:11,046 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:19:11,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:11,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576044732] [2024-01-27 16:19:11,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576044732] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:19:11,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:19:11,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 16:19:11,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859957362] [2024-01-27 16:19:11,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:11,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 16:19:11,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:11,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 16:19:11,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 16:19:11,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2024-01-27 16:19:11,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 24 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:19:11,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:11,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2024-01-27 16:19:11,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:11,284 INFO L124 PetriNetUnfolderBase]: 156/298 cut-off events. [2024-01-27 16:19:11,285 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-01-27 16:19:11,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 298 events. 156/298 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1132 event pairs, 45 based on Foata normal form. 1/297 useless extension candidates. Maximal degree in co-relation 502. Up to 179 conditions per place. [2024-01-27 16:19:11,291 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 31 selfloop transitions, 3 changer transitions 1/38 dead transitions. [2024-01-27 16:19:11,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 167 flow [2024-01-27 16:19:11,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 16:19:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 16:19:11,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2024-01-27 16:19:11,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-01-27 16:19:11,304 INFO L175 Difference]: Start difference. First operand has 28 places, 24 transitions, 60 flow. Second operand 3 states and 51 transitions. [2024-01-27 16:19:11,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 38 transitions, 167 flow [2024-01-27 16:19:11,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 38 transitions, 153 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 16:19:11,311 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 71 flow [2024-01-27 16:19:11,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=27, PETRI_TRANSITIONS=26} [2024-01-27 16:19:11,315 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2024-01-27 16:19:11,316 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 26 transitions, 71 flow [2024-01-27 16:19:11,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:19:11,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:11,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:11,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 16:19:11,317 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:19:11,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:11,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1361035497, now seen corresponding path program 1 times [2024-01-27 16:19:11,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:11,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446700637] [2024-01-27 16:19:11,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:11,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:11,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:11,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446700637] [2024-01-27 16:19:11,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446700637] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:19:11,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:19:11,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:19:11,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300254727] [2024-01-27 16:19:11,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:11,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:19:11,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:11,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:19:11,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:19:11,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2024-01-27 16:19:11,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:19:11,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:11,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2024-01-27 16:19:11,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:11,653 INFO L124 PetriNetUnfolderBase]: 221/451 cut-off events. [2024-01-27 16:19:11,653 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-01-27 16:19:11,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 451 events. 221/451 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2073 event pairs, 141 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 406. Up to 261 conditions per place. [2024-01-27 16:19:11,657 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 38 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-01-27 16:19:11,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 49 transitions, 210 flow [2024-01-27 16:19:11,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:19:11,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:19:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-01-27 16:19:11,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5481481481481482 [2024-01-27 16:19:11,658 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 71 flow. Second operand 5 states and 74 transitions. [2024-01-27 16:19:11,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 49 transitions, 210 flow [2024-01-27 16:19:11,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 49 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 16:19:11,660 INFO L231 Difference]: Finished difference. Result has 33 places, 30 transitions, 104 flow [2024-01-27 16:19:11,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=104, PETRI_PLACES=33, PETRI_TRANSITIONS=30} [2024-01-27 16:19:11,661 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 5 predicate places. [2024-01-27 16:19:11,661 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 104 flow [2024-01-27 16:19:11,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:19:11,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:11,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:11,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 16:19:11,662 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:19:11,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:11,663 INFO L85 PathProgramCache]: Analyzing trace with hash -991576211, now seen corresponding path program 1 times [2024-01-27 16:19:11,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:11,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900141484] [2024-01-27 16:19:11,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:11,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:11,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:11,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900141484] [2024-01-27 16:19:11,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900141484] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 16:19:11,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 16:19:11,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 16:19:11,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081704071] [2024-01-27 16:19:11,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:11,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:19:11,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:11,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:19:11,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 16:19:11,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2024-01-27 16:19:11,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:19:11,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:11,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2024-01-27 16:19:11,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:11,847 INFO L124 PetriNetUnfolderBase]: 181/356 cut-off events. [2024-01-27 16:19:11,847 INFO L125 PetriNetUnfolderBase]: For 89/107 co-relation queries the response was YES. [2024-01-27 16:19:11,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 356 events. 181/356 cut-off events. For 89/107 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1440 event pairs, 133 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 650. Up to 269 conditions per place. [2024-01-27 16:19:11,850 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 19 selfloop transitions, 2 changer transitions 17/44 dead transitions. [2024-01-27 16:19:11,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 221 flow [2024-01-27 16:19:11,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:19:11,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:19:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2024-01-27 16:19:11,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-01-27 16:19:11,853 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 104 flow. Second operand 5 states and 69 transitions. [2024-01-27 16:19:11,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 221 flow [2024-01-27 16:19:11,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 217 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 16:19:11,857 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 92 flow [2024-01-27 16:19:11,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2024-01-27 16:19:11,858 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 10 predicate places. [2024-01-27 16:19:11,858 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 92 flow [2024-01-27 16:19:11,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:19:11,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:11,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:11,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 16:19:11,859 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:19:11,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:11,860 INFO L85 PathProgramCache]: Analyzing trace with hash -286812489, now seen corresponding path program 1 times [2024-01-27 16:19:11,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:11,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422785373] [2024-01-27 16:19:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:11,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:11,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422785373] [2024-01-27 16:19:11,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422785373] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:11,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295388478] [2024-01-27 16:19:11,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:11,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:11,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:11,958 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:19:11,961 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:19:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:12,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 16:19:12,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:12,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:19:12,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:12,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295388478] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:12,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 16:19:12,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-01-27 16:19:12,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331146836] [2024-01-27 16:19:12,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:12,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:19:12,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:12,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:19:12,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:19:12,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2024-01-27 16:19:12,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:19:12,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:12,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2024-01-27 16:19:12,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:12,214 INFO L124 PetriNetUnfolderBase]: 154/296 cut-off events. [2024-01-27 16:19:12,215 INFO L125 PetriNetUnfolderBase]: For 64/82 co-relation queries the response was YES. [2024-01-27 16:19:12,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 717 conditions, 296 events. 154/296 cut-off events. For 64/82 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1175 event pairs, 44 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 700. Up to 151 conditions per place. [2024-01-27 16:19:12,217 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 24 selfloop transitions, 5 changer transitions 0/35 dead transitions. [2024-01-27 16:19:12,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 173 flow [2024-01-27 16:19:12,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:19:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:19:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2024-01-27 16:19:12,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-01-27 16:19:12,218 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 92 flow. Second operand 5 states and 60 transitions. [2024-01-27 16:19:12,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 173 flow [2024-01-27 16:19:12,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 149 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-01-27 16:19:12,220 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 97 flow [2024-01-27 16:19:12,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=97, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2024-01-27 16:19:12,220 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places. [2024-01-27 16:19:12,221 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 97 flow [2024-01-27 16:19:12,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:19:12,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:12,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:12,249 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:19:12,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:12,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:19:12,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:12,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2110500781, now seen corresponding path program 1 times [2024-01-27 16:19:12,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:12,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245718055] [2024-01-27 16:19:12,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:12,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:12,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:12,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245718055] [2024-01-27 16:19:12,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245718055] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:12,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549011203] [2024-01-27 16:19:12,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:12,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:12,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:12,531 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:19:12,555 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:19:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:12,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 16:19:12,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:12,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:19:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:12,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549011203] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:12,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 16:19:12,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-01-27 16:19:12,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787267695] [2024-01-27 16:19:12,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 16:19:12,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 16:19:12,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:12,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 16:19:12,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-01-27 16:19:12,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2024-01-27 16:19:12,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:19:12,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:12,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2024-01-27 16:19:12,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:12,768 INFO L124 PetriNetUnfolderBase]: 146/275 cut-off events. [2024-01-27 16:19:12,768 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-01-27 16:19:12,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 275 events. 146/275 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1034 event pairs, 39 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 646. Up to 142 conditions per place. [2024-01-27 16:19:12,770 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 24 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2024-01-27 16:19:12,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 182 flow [2024-01-27 16:19:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 16:19:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 16:19:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2024-01-27 16:19:12,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-01-27 16:19:12,773 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 97 flow. Second operand 5 states and 60 transitions. [2024-01-27 16:19:12,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 182 flow [2024-01-27 16:19:12,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 174 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:19:12,776 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 114 flow [2024-01-27 16:19:12,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-01-27 16:19:12,778 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2024-01-27 16:19:12,778 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 114 flow [2024-01-27 16:19:12,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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:19:12,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:12,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:12,795 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:19:12,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:12,991 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:19:12,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:12,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1067280986, now seen corresponding path program 1 times [2024-01-27 16:19:12,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:12,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357976524] [2024-01-27 16:19:12,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:12,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 16:19:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 16:19:13,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357976524] [2024-01-27 16:19:13,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357976524] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 16:19:13,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113996641] [2024-01-27 16:19:13,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:13,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:13,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 16:19:13,424 INFO L229 MonitoredProcess]: Starting monitored process 4 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:19:13,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-27 16:19:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 16:19:13,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 19 conjunts are in the unsatisfiable core [2024-01-27 16:19:13,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 16:19:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:13,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 16:19:13,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 16:19:13,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2024-01-27 16:19:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 16:19:13,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113996641] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 16:19:13,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 16:19:13,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2024-01-27 16:19:13,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199893036] [2024-01-27 16:19:13,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 16:19:13,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-27 16:19:13,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 16:19:13,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-27 16:19:13,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-01-27 16:19:13,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2024-01-27 16:19:13,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 114 flow. Second operand has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 19 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:19:13,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 16:19:13,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2024-01-27 16:19:13,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 16:19:14,408 INFO L124 PetriNetUnfolderBase]: 479/910 cut-off events. [2024-01-27 16:19:14,408 INFO L125 PetriNetUnfolderBase]: For 406/406 co-relation queries the response was YES. [2024-01-27 16:19:14,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 910 events. 479/910 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4485 event pairs, 32 based on Foata normal form. 2/911 useless extension candidates. Maximal degree in co-relation 2432. Up to 293 conditions per place. [2024-01-27 16:19:14,413 INFO L140 encePairwiseOnDemand]: 13/27 looper letters, 121 selfloop transitions, 81 changer transitions 2/209 dead transitions. [2024-01-27 16:19:14,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 209 transitions, 1112 flow [2024-01-27 16:19:14,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-01-27 16:19:14,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-01-27 16:19:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 371 transitions. [2024-01-27 16:19:14,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4163860830527497 [2024-01-27 16:19:14,415 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 114 flow. Second operand 33 states and 371 transitions. [2024-01-27 16:19:14,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 209 transitions, 1112 flow [2024-01-27 16:19:14,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 209 transitions, 1092 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-01-27 16:19:14,419 INFO L231 Difference]: Finished difference. Result has 81 places, 124 transitions, 799 flow [2024-01-27 16:19:14,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=799, PETRI_PLACES=81, PETRI_TRANSITIONS=124} [2024-01-27 16:19:14,419 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 53 predicate places. [2024-01-27 16:19:14,419 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 124 transitions, 799 flow [2024-01-27 16:19:14,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 19 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:19:14,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 16:19:14,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 16:19:14,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-27 16:19:14,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 16:19:14,632 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 16:19:14,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 16:19:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1913404626, now seen corresponding path program 2 times [2024-01-27 16:19:14,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 16:19:14,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932980464] [2024-01-27 16:19:14,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 16:19:14,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 16:19:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:19:14,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-27 16:19:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-27 16:19:14,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-27 16:19:14,706 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-27 16:19:14,707 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-01-27 16:19:14,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-01-27 16:19:14,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-01-27 16:19:14,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 16:19:14,708 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-01-27 16:19:14,712 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-27 16:19:14,712 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-27 16:19:14,733 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-27 16:19:14,735 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-27 16:19:14,735 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-27 16:19:14,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 04:19:14 BasicIcfg [2024-01-27 16:19:14,742 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-27 16:19:14,743 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-01-27 16:19:14,743 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-01-27 16:19:14,743 INFO L274 PluginConnector]: Witness Printer initialized [2024-01-27 16:19:14,743 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 04:19:10" (3/4) ... [2024-01-27 16:19:14,744 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-01-27 16:19:14,752 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-27 16:19:14,753 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-27 16:19:14,753 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-01-27 16:19:14,782 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-01-27 16:19:14,782 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-01-27 16:19:14,783 INFO L158 Benchmark]: Toolchain (without parser) took 5184.58ms. Allocated memory was 184.5MB in the beginning and 270.5MB in the end (delta: 86.0MB). Free memory was 112.4MB in the beginning and 176.7MB in the end (delta: -64.3MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-01-27 16:19:14,783 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 16:19:14,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.37ms. Allocated memory is still 184.5MB. Free memory was 112.2MB in the beginning and 154.5MB in the end (delta: -42.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-01-27 16:19:14,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.08ms. Allocated memory is still 184.5MB. Free memory was 153.4MB in the beginning and 152.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:19:14,783 INFO L158 Benchmark]: Boogie Preprocessor took 57.29ms. Allocated memory is still 184.5MB. Free memory was 152.3MB in the beginning and 149.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 16:19:14,783 INFO L158 Benchmark]: RCFGBuilder took 514.81ms. Allocated memory is still 184.5MB. Free memory was 149.2MB in the beginning and 104.1MB in the end (delta: 45.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-01-27 16:19:14,784 INFO L158 Benchmark]: TraceAbstraction took 4230.93ms. Allocated memory was 184.5MB in the beginning and 270.5MB in the end (delta: 86.0MB). Free memory was 103.1MB in the beginning and 184.1MB in the end (delta: -81.0MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-01-27 16:19:14,784 INFO L158 Benchmark]: Witness Printer took 39.66ms. Allocated memory is still 270.5MB. Free memory was 184.1MB in the beginning and 176.7MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-01-27 16:19:14,785 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.37ms. Allocated memory is still 184.5MB. Free memory was 112.2MB in the beginning and 154.5MB in the end (delta: -42.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.08ms. Allocated memory is still 184.5MB. Free memory was 153.4MB in the beginning and 152.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.29ms. Allocated memory is still 184.5MB. Free memory was 152.3MB in the beginning and 149.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 514.81ms. Allocated memory is still 184.5MB. Free memory was 149.2MB in the beginning and 104.1MB in the end (delta: 45.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4230.93ms. Allocated memory was 184.5MB in the beginning and 270.5MB in the end (delta: 86.0MB). Free memory was 103.1MB in the beginning and 184.1MB in the end (delta: -81.0MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Witness Printer took 39.66ms. Allocated memory is still 270.5MB. Free memory was 184.1MB in the beginning and 176.7MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; [L42] 0 int counter, N; [L75] 0 pthread_t t1, t2; [L77] 0 N = __VERIFIER_nondet_int() [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L97] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=0, size=1] [L97] COND TRUE 0 i < size [L98] 0 arr[i] = __VERIFIER_nondet_int() [L97] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={-2:0}, counter=0, i=1, size=1] [L97] COND FALSE 0 !(i < size) [L100] 0 return arr; [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-2:0}, N=1, counter=0, t1={3:0}, t2={5:0}] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-2:0}, N=1, counter=0, t1={3:0}, t2={5:0}] [L83] 0 \read(t1) VAL [A={-2:0}, N=1, counter=0] [L49] 1 int i=0; VAL [A={-2:0}, N=1, _argptr={0:0}, _argptr={0:0}, counter=0, i=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L62] 2 int i=0; VAL [A={-2:0}, N=1, _argptr={0:0}, _argptr={0:0}, counter=0, i=0] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={-2:0}, N=1, _argptr={0:0}, _argptr={0:0}, counter=4, i=0, tmp=4] [L62] 2 i++ VAL [A={-2:0}, N=1, _argptr={0:0}, _argptr={0:0}, counter=4, i=1, tmp=4] [L62] COND FALSE 2 !(i