./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/weaver/popl20-three-array-sum.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 c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:36:43,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:36:43,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:36:43,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:36:43,886 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:36:43,927 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:36:43,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:36:43,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:36:43,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:36:43,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:36:43,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:36:43,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:36:43,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:36:43,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:36:43,935 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:36:43,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:36:43,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:36:43,936 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:36:43,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:36:43,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:36:43,939 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:36:43,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:36:43,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:36:43,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:36:43,940 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:36:43,941 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:36:43,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:36:43,941 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:36:43,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:36:43,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:36:43,942 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:36:43,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:36:43,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:36:43,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:36:43,943 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:36:43,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:36:43,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:36:43,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:36:43,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:36:43,944 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:36:43,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:36:43,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:36:43,947 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 -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e [2024-11-10 10:36:44,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:36:44,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:36:44,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:36:44,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:36:44,256 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:36:44,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2024-11-10 10:36:45,677 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:36:45,878 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:36:45,879 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2024-11-10 10:36:45,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40790cd07/e4ee016518644478a7d8dcccf34925be/FLAG1f279b844 [2024-11-10 10:36:45,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40790cd07/e4ee016518644478a7d8dcccf34925be [2024-11-10 10:36:45,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:36:45,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:36:45,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:36:45,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:36:45,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:36:45,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:36:45" (1/1) ... [2024-11-10 10:36:45,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@295b7a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:36:45, skipping insertion in model container [2024-11-10 10:36:45,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:36:45" (1/1) ... [2024-11-10 10:36:45,940 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:36:46,171 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c[2730,2743] [2024-11-10 10:36:46,185 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:36:46,200 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:36:46,229 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c[2730,2743] [2024-11-10 10:36:46,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:36:46,255 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:36:46,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:36:46 WrapperNode [2024-11-10 10:36:46,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:36:46,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:36:46,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:36:46,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:36:46,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:36:46" (1/1) ... [2024-11-10 10:36:46,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:36:46" (1/1) ... [2024-11-10 10:36:46,302 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 135 [2024-11-10 10:36:46,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:36:46,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:36:46,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:36:46,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:36:46,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:36:46" (1/1) ... [2024-11-10 10:36:46,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:36:46" (1/1) ... [2024-11-10 10:36:46,320 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:36:46" (1/1) ... [2024-11-10 10:36:46,346 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-11-10 10:36:46,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:36:46" (1/1) ... [2024-11-10 10:36:46,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:36:46" (1/1) ... [2024-11-10 10:36:46,354 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:36:46" (1/1) ... [2024-11-10 10:36:46,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:36:46" (1/1) ... [2024-11-10 10:36:46,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:36:46" (1/1) ... [2024-11-10 10:36:46,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:36:46" (1/1) ... [2024-11-10 10:36:46,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:36:46,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:36:46,369 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:36:46,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:36:46,370 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:36:46" (1/1) ... [2024-11-10 10:36:46,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:36:46,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:36:46,411 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-11-10 10:36:46,418 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-11-10 10:36:46,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:36:46,467 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 10:36:46,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 10:36:46,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 10:36:46,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 10:36:46,469 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 10:36:46,469 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 10:36:46,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:36:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 10:36:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 10:36:46,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 10:36:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 10:36:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 10:36:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 10:36:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:36:46,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:36:46,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 10:36:46,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 10:36:46,475 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:36:46,576 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:36:46,578 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:36:46,903 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:36:46,903 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:36:47,199 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:36:47,200 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:36:47,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:36:47 BoogieIcfgContainer [2024-11-10 10:36:47,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:36:47,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:36:47,206 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:36:47,212 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:36:47,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:36:45" (1/3) ... [2024-11-10 10:36:47,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470dd0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:36:47, skipping insertion in model container [2024-11-10 10:36:47,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:36:46" (2/3) ... [2024-11-10 10:36:47,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@470dd0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:36:47, skipping insertion in model container [2024-11-10 10:36:47,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:36:47" (3/3) ... [2024-11-10 10:36:47,220 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2024-11-10 10:36:47,263 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:36:47,263 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:36:47,263 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:36:47,309 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 10:36:47,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 57 transitions, 135 flow [2024-11-10 10:36:47,375 INFO L124 PetriNetUnfolderBase]: 13/54 cut-off events. [2024-11-10 10:36:47,376 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 10:36:47,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 54 events. 13/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-11-10 10:36:47,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 57 transitions, 135 flow [2024-11-10 10:36:47,385 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 53 transitions, 124 flow [2024-11-10 10:36:47,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:36:47,406 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5184f3ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:36:47,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 10:36:47,420 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:36:47,420 INFO L124 PetriNetUnfolderBase]: 13/52 cut-off events. [2024-11-10 10:36:47,420 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 10:36:47,421 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:36:47,422 INFO L204 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, 1, 1, 1] [2024-11-10 10:36:47,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:36:47,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:36:47,427 INFO L85 PathProgramCache]: Analyzing trace with hash -491636599, now seen corresponding path program 1 times [2024-11-10 10:36:47,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:36:47,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058260311] [2024-11-10 10:36:47,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:36:47,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:36:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:36:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:36:47,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:36:47,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058260311] [2024-11-10 10:36:47,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058260311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:36:47,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:36:47,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:36:47,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811530783] [2024-11-10 10:36:47,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:36:47,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:36:47,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:36:47,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:36:47,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:36:47,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 57 [2024-11-10 10:36:47,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 53 transitions, 124 flow. Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 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-11-10 10:36:47,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:36:47,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 57 [2024-11-10 10:36:47,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:36:47,893 INFO L124 PetriNetUnfolderBase]: 431/766 cut-off events. [2024-11-10 10:36:47,893 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-10 10:36:47,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 766 events. 431/766 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3691 event pairs, 284 based on Foata normal form. 124/806 useless extension candidates. Maximal degree in co-relation 1204. Up to 590 conditions per place. [2024-11-10 10:36:47,905 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 29 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2024-11-10 10:36:47,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 170 flow [2024-11-10 10:36:47,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:36:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:36:47,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2024-11-10 10:36:47,916 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6754385964912281 [2024-11-10 10:36:47,918 INFO L175 Difference]: Start difference. First operand has 50 places, 53 transitions, 124 flow. Second operand 2 states and 77 transitions. [2024-11-10 10:36:47,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 170 flow [2024-11-10 10:36:47,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 47 transitions, 158 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 10:36:47,924 INFO L231 Difference]: Finished difference. Result has 45 places, 47 transitions, 100 flow [2024-11-10 10:36:47,927 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=45, PETRI_TRANSITIONS=47} [2024-11-10 10:36:47,931 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2024-11-10 10:36:47,931 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 47 transitions, 100 flow [2024-11-10 10:36:47,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 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-11-10 10:36:47,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:36:47,932 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:36:47,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:36:47,933 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:36:47,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:36:47,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1470422724, now seen corresponding path program 1 times [2024-11-10 10:36:47,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:36:47,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229127488] [2024-11-10 10:36:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:36:47,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:36:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:36:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:36:48,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:36:48,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229127488] [2024-11-10 10:36:48,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229127488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:36:48,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:36:48,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:36:48,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481397856] [2024-11-10 10:36:48,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:36:48,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:36:48,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:36:48,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:36:48,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:36:48,670 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 57 [2024-11-10 10:36:48,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-11-10 10:36:48,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:36:48,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 57 [2024-11-10 10:36:48,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:36:48,897 INFO L124 PetriNetUnfolderBase]: 776/1380 cut-off events. [2024-11-10 10:36:48,899 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-10 10:36:48,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 1380 events. 776/1380 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 7734 event pairs, 226 based on Foata normal form. 1/1281 useless extension candidates. Maximal degree in co-relation 2460. Up to 641 conditions per place. [2024-11-10 10:36:48,912 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 44 selfloop transitions, 3 changer transitions 1/66 dead transitions. [2024-11-10 10:36:48,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 239 flow [2024-11-10 10:36:48,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:36:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:36:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-11-10 10:36:48,916 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6549707602339181 [2024-11-10 10:36:48,916 INFO L175 Difference]: Start difference. First operand has 45 places, 47 transitions, 100 flow. Second operand 3 states and 112 transitions. [2024-11-10 10:36:48,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 239 flow [2024-11-10 10:36:48,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 239 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:36:48,922 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 119 flow [2024-11-10 10:36:48,922 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2024-11-10 10:36:48,923 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2024-11-10 10:36:48,923 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 119 flow [2024-11-10 10:36:48,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-11-10 10:36:48,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:36:48,924 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 10:36:48,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:36:48,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:36:48,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:36:48,926 INFO L85 PathProgramCache]: Analyzing trace with hash 908693955, now seen corresponding path program 1 times [2024-11-10 10:36:48,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:36:48,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970428876] [2024-11-10 10:36:48,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:36:48,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:36:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:36:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:36:49,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:36:49,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970428876] [2024-11-10 10:36:49,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970428876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:36:49,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:36:49,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:36:49,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043170836] [2024-11-10 10:36:49,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:36:49,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:36:49,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:36:49,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:36:49,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:36:49,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 57 [2024-11-10 10:36:49,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-11-10 10:36:49,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:36:49,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 57 [2024-11-10 10:36:49,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:36:49,469 INFO L124 PetriNetUnfolderBase]: 1312/2432 cut-off events. [2024-11-10 10:36:49,470 INFO L125 PetriNetUnfolderBase]: For 313/313 co-relation queries the response was YES. [2024-11-10 10:36:49,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4614 conditions, 2432 events. 1312/2432 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 15355 event pairs, 695 based on Foata normal form. 74/2264 useless extension candidates. Maximal degree in co-relation 4609. Up to 1014 conditions per place. [2024-11-10 10:36:49,490 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 72 selfloop transitions, 12 changer transitions 0/99 dead transitions. [2024-11-10 10:36:49,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 99 transitions, 407 flow [2024-11-10 10:36:49,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:36:49,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:36:49,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 189 transitions. [2024-11-10 10:36:49,496 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5526315789473685 [2024-11-10 10:36:49,497 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 119 flow. Second operand 6 states and 189 transitions. [2024-11-10 10:36:49,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 99 transitions, 407 flow [2024-11-10 10:36:49,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 99 transitions, 402 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:36:49,501 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 212 flow [2024-11-10 10:36:49,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=212, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2024-11-10 10:36:49,501 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2024-11-10 10:36:49,502 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 212 flow [2024-11-10 10:36:49,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 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-11-10 10:36:49,502 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:36:49,502 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 10:36:49,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:36:49,502 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:36:49,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:36:49,503 INFO L85 PathProgramCache]: Analyzing trace with hash 670310682, now seen corresponding path program 1 times [2024-11-10 10:36:49,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:36:49,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468003753] [2024-11-10 10:36:49,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:36:49,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:36:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:36:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:36:49,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:36:49,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468003753] [2024-11-10 10:36:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468003753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:36:49,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:36:49,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:36:49,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535747530] [2024-11-10 10:36:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:36:49,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:36:49,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:36:49,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:36:49,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:36:49,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-11-10 10:36:49,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 212 flow. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:36:49,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:36:49,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-11-10 10:36:49,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:36:49,957 INFO L124 PetriNetUnfolderBase]: 1088/1904 cut-off events. [2024-11-10 10:36:49,957 INFO L125 PetriNetUnfolderBase]: For 836/836 co-relation queries the response was YES. [2024-11-10 10:36:49,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4137 conditions, 1904 events. 1088/1904 cut-off events. For 836/836 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10766 event pairs, 673 based on Foata normal form. 29/1830 useless extension candidates. Maximal degree in co-relation 4128. Up to 1210 conditions per place. [2024-11-10 10:36:49,973 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 32 selfloop transitions, 6 changer transitions 36/88 dead transitions. [2024-11-10 10:36:49,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 440 flow [2024-11-10 10:36:49,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:36:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:36:49,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2024-11-10 10:36:49,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5116959064327485 [2024-11-10 10:36:49,975 INFO L175 Difference]: Start difference. First operand has 57 places, 60 transitions, 212 flow. Second operand 6 states and 175 transitions. [2024-11-10 10:36:49,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 440 flow [2024-11-10 10:36:49,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 440 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:36:49,983 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 184 flow [2024-11-10 10:36:49,983 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2024-11-10 10:36:49,984 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 14 predicate places. [2024-11-10 10:36:49,984 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 184 flow [2024-11-10 10:36:49,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:36:49,984 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:36:49,985 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:36:49,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:36:49,985 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:36:49,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:36:49,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1721493232, now seen corresponding path program 1 times [2024-11-10 10:36:49,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:36:49,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210912537] [2024-11-10 10:36:49,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:36:49,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:36:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:36:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 10:36:50,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:36:50,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210912537] [2024-11-10 10:36:50,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210912537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:36:50,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980824581] [2024-11-10 10:36:50,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:36:50,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:36:50,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:36:50,102 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-11-10 10:36:50,118 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-11-10 10:36:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:36:50,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:36:50,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:36:50,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 10:36:50,341 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:36:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 10:36:50,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980824581] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 10:36:50,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 10:36:50,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-11-10 10:36:50,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232216678] [2024-11-10 10:36:50,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:36:50,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:36:50,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:36:50,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:36:50,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:36:50,472 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-11-10 10:36:50,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-11-10 10:36:50,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:36:50,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-11-10 10:36:50,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:36:50,737 INFO L124 PetriNetUnfolderBase]: 1290/2161 cut-off events. [2024-11-10 10:36:50,738 INFO L125 PetriNetUnfolderBase]: For 1014/1014 co-relation queries the response was YES. [2024-11-10 10:36:50,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4857 conditions, 2161 events. 1290/2161 cut-off events. For 1014/1014 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11906 event pairs, 506 based on Foata normal form. 0/1981 useless extension candidates. Maximal degree in co-relation 4845. Up to 971 conditions per place. [2024-11-10 10:36:50,756 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 49 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2024-11-10 10:36:50,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 342 flow [2024-11-10 10:36:50,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:36:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:36:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2024-11-10 10:36:50,761 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45263157894736844 [2024-11-10 10:36:50,761 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 184 flow. Second operand 5 states and 129 transitions. [2024-11-10 10:36:50,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 342 flow [2024-11-10 10:36:50,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 67 transitions, 294 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-11-10 10:36:50,766 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 169 flow [2024-11-10 10:36:50,767 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2024-11-10 10:36:50,767 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2024-11-10 10:36:50,768 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 169 flow [2024-11-10 10:36:50,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 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-11-10 10:36:50,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:36:50,768 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 10:36:50,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 10:36:50,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:36:50,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:36:50,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:36:50,974 INFO L85 PathProgramCache]: Analyzing trace with hash -207328948, now seen corresponding path program 1 times [2024-11-10 10:36:50,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:36:50,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884773217] [2024-11-10 10:36:50,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:36:50,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:36:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:36:51,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 10:36:51,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:36:51,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884773217] [2024-11-10 10:36:51,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884773217] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:36:51,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288548213] [2024-11-10 10:36:51,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:36:51,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:36:51,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:36:51,094 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-11-10 10:36:51,095 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-11-10 10:36:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:36:51,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:36:51,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:36:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 10:36:51,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:36:51,388 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 10:36:51,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288548213] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 10:36:51,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 10:36:51,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-11-10 10:36:51,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698048325] [2024-11-10 10:36:51,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:36:51,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:36:51,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:36:51,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:36:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:36:51,417 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-11-10 10:36:51,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-11-10 10:36:51,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:36:51,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-11-10 10:36:51,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:36:51,648 INFO L124 PetriNetUnfolderBase]: 1168/2030 cut-off events. [2024-11-10 10:36:51,648 INFO L125 PetriNetUnfolderBase]: For 831/831 co-relation queries the response was YES. [2024-11-10 10:36:51,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4347 conditions, 2030 events. 1168/2030 cut-off events. For 831/831 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11424 event pairs, 359 based on Foata normal form. 0/1872 useless extension candidates. Maximal degree in co-relation 4339. Up to 891 conditions per place. [2024-11-10 10:36:51,665 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 46 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2024-11-10 10:36:51,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 309 flow [2024-11-10 10:36:51,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:36:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:36:51,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2024-11-10 10:36:51,666 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4456140350877193 [2024-11-10 10:36:51,666 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 169 flow. Second operand 5 states and 127 transitions. [2024-11-10 10:36:51,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 309 flow [2024-11-10 10:36:51,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 301 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-10 10:36:51,669 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 186 flow [2024-11-10 10:36:51,670 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-11-10 10:36:51,671 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2024-11-10 10:36:51,671 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 186 flow [2024-11-10 10:36:51,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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-11-10 10:36:51,671 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:36:51,671 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 10:36:51,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 10:36:51,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 10:36:51,873 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:36:51,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:36:51,874 INFO L85 PathProgramCache]: Analyzing trace with hash -183077395, now seen corresponding path program 1 times [2024-11-10 10:36:51,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:36:51,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562072991] [2024-11-10 10:36:51,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:36:51,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:36:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:36:51,996 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 10:36:51,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:36:51,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562072991] [2024-11-10 10:36:51,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562072991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:36:51,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20415762] [2024-11-10 10:36:51,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:36:51,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:36:51,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:36:51,999 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-11-10 10:36:52,001 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-11-10 10:36:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:36:52,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:36:52,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:36:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 10:36:52,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:36:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-10 10:36:52,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20415762] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 10:36:52,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 10:36:52,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-11-10 10:36:52,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160673787] [2024-11-10 10:36:52,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:36:52,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:36:52,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:36:52,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:36:52,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:36:52,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 57 [2024-11-10 10:36:52,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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-11-10 10:36:52,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:36:52,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 57 [2024-11-10 10:36:52,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:36:52,479 INFO L124 PetriNetUnfolderBase]: 1007/1909 cut-off events. [2024-11-10 10:36:52,479 INFO L125 PetriNetUnfolderBase]: For 935/935 co-relation queries the response was YES. [2024-11-10 10:36:52,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4284 conditions, 1909 events. 1007/1909 cut-off events. For 935/935 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 11041 event pairs, 558 based on Foata normal form. 82/1883 useless extension candidates. Maximal degree in co-relation 4274. Up to 1113 conditions per place. [2024-11-10 10:36:52,494 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 49 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2024-11-10 10:36:52,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 348 flow [2024-11-10 10:36:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:36:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:36:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-11-10 10:36:52,497 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2024-11-10 10:36:52,497 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 186 flow. Second operand 5 states and 135 transitions. [2024-11-10 10:36:52,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 348 flow [2024-11-10 10:36:52,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 70 transitions, 340 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 10:36:52,500 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 201 flow [2024-11-10 10:36:52,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=201, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-11-10 10:36:52,502 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2024-11-10 10:36:52,503 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 201 flow [2024-11-10 10:36:52,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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-11-10 10:36:52,504 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:36:52,504 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 10:36:52,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 10:36:52,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:36:52,709 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:36:52,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:36:52,709 INFO L85 PathProgramCache]: Analyzing trace with hash 413957350, now seen corresponding path program 1 times [2024-11-10 10:36:52,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:36:52,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071583051] [2024-11-10 10:36:52,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:36:52,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:36:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:36:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 10:36:54,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:36:54,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071583051] [2024-11-10 10:36:54,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071583051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:36:54,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961593363] [2024-11-10 10:36:54,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:36:54,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:36:54,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:36:54,034 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:36:54,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 10:36:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:36:54,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 10:36:54,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:36:54,467 INFO L349 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2024-11-10 10:36:54,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2024-11-10 10:36:55,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 10:36:55,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 107 treesize of output 499 [2024-11-10 10:37:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 10:37:01,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:37:30,445 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 10:37:30,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 83 [2024-11-10 10:37:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 10:37:31,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961593363] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:37:31,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:37:31,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 7] total 25 [2024-11-10 10:37:31,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651901943] [2024-11-10 10:37:31,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:37:31,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 10:37:31,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:37:31,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 10:37:31,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=548, Unknown=3, NotChecked=0, Total=650 [2024-11-10 10:37:35,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 10:37:39,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 10:37:43,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 10:37:47,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 10:37:51,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 10:37:51,412 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-11-10 10:37:51,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 201 flow. Second operand has 26 states, 26 states have (on average 19.692307692307693) internal successors, (512), 26 states have internal predecessors, (512), 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-11-10 10:37:51,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:37:51,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-11-10 10:37:51,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:37:53,782 INFO L124 PetriNetUnfolderBase]: 4064/6739 cut-off events. [2024-11-10 10:37:53,783 INFO L125 PetriNetUnfolderBase]: For 5921/5921 co-relation queries the response was YES. [2024-11-10 10:37:53,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16842 conditions, 6739 events. 4064/6739 cut-off events. For 5921/5921 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 41668 event pairs, 140 based on Foata normal form. 1/6555 useless extension candidates. Maximal degree in co-relation 16831. Up to 2629 conditions per place. [2024-11-10 10:37:53,832 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 182 selfloop transitions, 47 changer transitions 1/243 dead transitions. [2024-11-10 10:37:53,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 243 transitions, 1320 flow [2024-11-10 10:37:53,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 10:37:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-10 10:37:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 507 transitions. [2024-11-10 10:37:53,835 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49415204678362573 [2024-11-10 10:37:53,835 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 201 flow. Second operand 18 states and 507 transitions. [2024-11-10 10:37:53,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 243 transitions, 1320 flow [2024-11-10 10:37:53,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 243 transitions, 1308 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 10:37:53,846 INFO L231 Difference]: Finished difference. Result has 87 places, 100 transitions, 601 flow [2024-11-10 10:37:53,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=601, PETRI_PLACES=87, PETRI_TRANSITIONS=100} [2024-11-10 10:37:53,847 INFO L277 CegarLoopForPetriNet]: 50 programPoint places, 37 predicate places. [2024-11-10 10:37:53,848 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 100 transitions, 601 flow [2024-11-10 10:37:53,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 19.692307692307693) internal successors, (512), 26 states have internal predecessors, (512), 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-11-10 10:37:53,849 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:37:53,849 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 10:37:53,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 10:37:54,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:37:54,050 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-10 10:37:54,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:37:54,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1392773498, now seen corresponding path program 2 times [2024-11-10 10:37:54,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:37:54,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129600265] [2024-11-10 10:37:54,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:37:54,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:37:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:37:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 10:37:55,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:37:55,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129600265] [2024-11-10 10:37:55,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129600265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:37:55,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622406167] [2024-11-10 10:37:55,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:37:55,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:37:55,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:37:55,387 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:37:55,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 10:37:55,497 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:37:55,497 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:37:55,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-10 10:37:55,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:37:55,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-10 10:37:55,583 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 10:37:55,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 10:37:55,661 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-10 10:37:55,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-10 10:37:56,007 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-10 10:37:56,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-10 10:37:56,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 10:37:56,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 23 [2024-11-10 10:37:56,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-10 10:37:56,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:37:56,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 10:37:56,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 356 treesize of output 336 [2024-11-10 10:37:56,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 75 treesize of output 73 [2024-11-10 10:37:57,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 10:37:57,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 438 treesize of output 374 [2024-11-10 10:38:00,154 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-10 10:38:00,320 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-10 10:38:04,210 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-11-10 10:38:11,905 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts.