./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.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 ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 12:18:20,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 12:18:20,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 12:18:20,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 12:18:20,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 12:18:20,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 12:18:20,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 12:18:20,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 12:18:20,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 12:18:20,491 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 12:18:20,491 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 12:18:20,491 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 12:18:20,492 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 12:18:20,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 12:18:20,493 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 12:18:20,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 12:18:20,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 12:18:20,494 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 12:18:20,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 12:18:20,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 12:18:20,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 12:18:20,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 12:18:20,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 12:18:20,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 12:18:20,496 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 12:18:20,496 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 12:18:20,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 12:18:20,496 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 12:18:20,497 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 12:18:20,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 12:18:20,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 12:18:20,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 12:18:20,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:18:20,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 12:18:20,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 12:18:20,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 12:18:20,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 12:18:20,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 12:18:20,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 12:18:20,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 12:18:20,500 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 12:18:20,500 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 12:18:20,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 12:18:20,500 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 -> ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 12:18:20,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 12:18:20,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 12:18:20,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 12:18:20,826 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 12:18:20,826 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 12:18:20,827 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-02-20 12:18:22,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 12:18:22,258 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 12:18:22,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-02-20 12:18:22,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e42a652f/b51693ce6d974a97b7e39edac7a266d8/FLAG5ca9e5044 [2024-02-20 12:18:22,287 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e42a652f/b51693ce6d974a97b7e39edac7a266d8 [2024-02-20 12:18:22,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 12:18:22,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 12:18:22,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 12:18:22,294 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 12:18:22,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 12:18:22,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:18:22" (1/1) ... [2024-02-20 12:18:22,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@740b60c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:18:22, skipping insertion in model container [2024-02-20 12:18:22,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:18:22" (1/1) ... [2024-02-20 12:18:22,325 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 12:18:22,471 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2024-02-20 12:18:22,481 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:18:22,491 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 12:18:22,514 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2024-02-20 12:18:22,518 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:18:22,547 INFO L206 MainTranslator]: Completed translation [2024-02-20 12:18:22,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:18:22 WrapperNode [2024-02-20 12:18:22,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 12:18:22,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 12:18:22,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 12:18:22,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 12:18:22,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:18:22" (1/1) ... [2024-02-20 12:18:22,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:18:22" (1/1) ... [2024-02-20 12:18:22,608 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 197 [2024-02-20 12:18:22,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 12:18:22,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 12:18:22,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 12:18:22,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 12:18:22,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:18:22" (1/1) ... [2024-02-20 12:18:22,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:18:22" (1/1) ... [2024-02-20 12:18:22,624 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:18:22" (1/1) ... [2024-02-20 12:18:22,640 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 2, 2, 8]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 2]. [2024-02-20 12:18:22,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:18:22" (1/1) ... [2024-02-20 12:18:22,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:18:22" (1/1) ... [2024-02-20 12:18:22,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:18:22" (1/1) ... [2024-02-20 12:18:22,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:18:22" (1/1) ... [2024-02-20 12:18:22,659 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:18:22" (1/1) ... [2024-02-20 12:18:22,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:18:22" (1/1) ... [2024-02-20 12:18:22,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 12:18:22,664 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 12:18:22,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 12:18:22,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 12:18:22,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:18:22" (1/1) ... [2024-02-20 12:18:22,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:18:22,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:18:22,692 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-02-20 12:18:22,708 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-02-20 12:18:22,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 12:18:22,737 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 12:18:22,737 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 12:18:22,737 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 12:18:22,737 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 12:18:22,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 12:18:22,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 12:18:22,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 12:18:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-20 12:18:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 12:18:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 12:18:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 12:18:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 12:18:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-20 12:18:22,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 12:18:22,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 12:18:22,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-20 12:18:22,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 12:18:22,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 12:18:22,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 12:18:22,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 12:18:22,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 12:18:22,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-20 12:18:22,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 12:18:22,742 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 12:18:22,904 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 12:18:22,907 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 12:18:23,192 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 12:18:23,192 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 12:18:23,445 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 12:18:23,445 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-20 12:18:23,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:18:23 BoogieIcfgContainer [2024-02-20 12:18:23,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 12:18:23,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 12:18:23,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 12:18:23,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 12:18:23,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 12:18:22" (1/3) ... [2024-02-20 12:18:23,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1826b175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:18:23, skipping insertion in model container [2024-02-20 12:18:23,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:18:22" (2/3) ... [2024-02-20 12:18:23,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1826b175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:18:23, skipping insertion in model container [2024-02-20 12:18:23,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:18:23" (3/3) ... [2024-02-20 12:18:23,456 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2024-02-20 12:18:23,470 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 12:18:23,471 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 12:18:23,471 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 12:18:23,512 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-20 12:18:23,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 74 flow [2024-02-20 12:18:23,581 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2024-02-20 12:18:23,581 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 12:18:23,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 5/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2024-02-20 12:18:23,584 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 74 flow [2024-02-20 12:18:23,587 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 27 transitions, 66 flow [2024-02-20 12:18:23,594 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 12:18:23,599 INFO L369 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@1df11356, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 12:18:23,599 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-20 12:18:23,610 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 12:18:23,611 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2024-02-20 12:18:23,611 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 12:18:23,611 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:18:23,613 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:18:23,614 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:18:23,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:18:23,618 INFO L85 PathProgramCache]: Analyzing trace with hash 623822489, now seen corresponding path program 1 times [2024-02-20 12:18:23,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:18:23,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594079690] [2024-02-20 12:18:23,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:18:23,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:18:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:18:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:18:23,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:18:23,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594079690] [2024-02-20 12:18:23,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594079690] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:18:23,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:18:23,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:18:23,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157556188] [2024-02-20 12:18:23,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:18:23,916 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:18:23,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:18:23,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:18:23,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:18:23,953 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-20 12:18:23,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-02-20 12:18:23,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:18:23,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-20 12:18:23,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:18:24,110 INFO L124 PetriNetUnfolderBase]: 193/337 cut-off events. [2024-02-20 12:18:24,110 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-20 12:18:24,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 337 events. 193/337 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1328 event pairs, 51 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 618. Up to 185 conditions per place. [2024-02-20 12:18:24,116 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 32 selfloop transitions, 3 changer transitions 0/39 dead transitions. [2024-02-20 12:18:24,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 163 flow [2024-02-20 12:18:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:18:24,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:18:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2024-02-20 12:18:24,129 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-02-20 12:18:24,133 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2024-02-20 12:18:24,133 INFO L507 AbstractCegarLoop]: Abstraction has has 32 places, 39 transitions, 163 flow [2024-02-20 12:18:24,133 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-02-20 12:18:24,134 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:18:24,134 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:18:24,134 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 12:18:24,134 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:18:24,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:18:24,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1096153256, now seen corresponding path program 1 times [2024-02-20 12:18:24,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:18:24,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350241926] [2024-02-20 12:18:24,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:18:24,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:18:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:18:24,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:18:24,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:18:24,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350241926] [2024-02-20 12:18:24,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350241926] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:18:24,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:18:24,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:18:24,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228247482] [2024-02-20 12:18:24,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:18:24,333 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:18:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:18:24,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:18:24,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:18:24,339 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-20 12:18:24,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 39 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-02-20 12:18:24,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:18:24,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-20 12:18:24,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:18:24,452 INFO L124 PetriNetUnfolderBase]: 193/338 cut-off events. [2024-02-20 12:18:24,452 INFO L125 PetriNetUnfolderBase]: For 54/130 co-relation queries the response was YES. [2024-02-20 12:18:24,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 338 events. 193/338 cut-off events. For 54/130 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1323 event pairs, 51 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 904. Up to 313 conditions per place. [2024-02-20 12:18:24,455 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 34 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2024-02-20 12:18:24,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 239 flow [2024-02-20 12:18:24,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:18:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:18:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2024-02-20 12:18:24,457 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2024-02-20 12:18:24,458 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2024-02-20 12:18:24,458 INFO L507 AbstractCegarLoop]: Abstraction has has 34 places, 40 transitions, 239 flow [2024-02-20 12:18:24,458 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-02-20 12:18:24,458 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:18:24,458 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:18:24,458 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 12:18:24,459 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:18:24,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:18:24,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1576562806, now seen corresponding path program 1 times [2024-02-20 12:18:24,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:18:24,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007229361] [2024-02-20 12:18:24,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:18:24,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:18:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:18:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:18:24,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:18:24,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007229361] [2024-02-20 12:18:24,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007229361] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:18:24,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:18:24,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 12:18:24,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763040642] [2024-02-20 12:18:24,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:18:24,602 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:18:24,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:18:24,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:18:24,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:18:24,603 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-20 12:18:24,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 40 transitions, 239 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-20 12:18:24,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:18:24,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-20 12:18:24,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:18:24,728 INFO L124 PetriNetUnfolderBase]: 263/493 cut-off events. [2024-02-20 12:18:24,728 INFO L125 PetriNetUnfolderBase]: For 248/408 co-relation queries the response was YES. [2024-02-20 12:18:24,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 493 events. 263/493 cut-off events. For 248/408 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2096 event pairs, 38 based on Foata normal form. 1/436 useless extension candidates. Maximal degree in co-relation 1682. Up to 436 conditions per place. [2024-02-20 12:18:24,733 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 54 selfloop transitions, 3 changer transitions 3/64 dead transitions. [2024-02-20 12:18:24,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 509 flow [2024-02-20 12:18:24,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:18:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:18:24,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-02-20 12:18:24,735 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-02-20 12:18:24,735 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2024-02-20 12:18:24,735 INFO L507 AbstractCegarLoop]: Abstraction has has 36 places, 64 transitions, 509 flow [2024-02-20 12:18:24,736 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-02-20 12:18:24,736 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:18:24,736 INFO L234 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] [2024-02-20 12:18:24,736 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 12:18:24,736 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:18:24,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:18:24,737 INFO L85 PathProgramCache]: Analyzing trace with hash 787309211, now seen corresponding path program 1 times [2024-02-20 12:18:24,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:18:24,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325040052] [2024-02-20 12:18:24,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:18:24,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:18:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:18:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:18:24,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:18:24,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325040052] [2024-02-20 12:18:24,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325040052] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:18:24,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:18:24,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 12:18:24,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080335226] [2024-02-20 12:18:24,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:18:24,787 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:18:24,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:18:24,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:18:24,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:18:24,792 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-20 12:18:24,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 64 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-20 12:18:24,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:18:24,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-20 12:18:24,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:18:24,872 INFO L124 PetriNetUnfolderBase]: 257/492 cut-off events. [2024-02-20 12:18:24,872 INFO L125 PetriNetUnfolderBase]: For 425/707 co-relation queries the response was YES. [2024-02-20 12:18:24,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2334 conditions, 492 events. 257/492 cut-off events. For 425/707 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2096 event pairs, 21 based on Foata normal form. 13/451 useless extension candidates. Maximal degree in co-relation 2104. Up to 447 conditions per place. [2024-02-20 12:18:24,876 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 62 selfloop transitions, 3 changer transitions 9/78 dead transitions. [2024-02-20 12:18:24,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 78 transitions, 781 flow [2024-02-20 12:18:24,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:18:24,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:18:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-02-20 12:18:24,878 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-02-20 12:18:24,878 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-02-20 12:18:24,879 INFO L507 AbstractCegarLoop]: Abstraction has has 38 places, 78 transitions, 781 flow [2024-02-20 12:18:24,879 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-02-20 12:18:24,879 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:18:24,879 INFO L234 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] [2024-02-20 12:18:24,879 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 12:18:24,880 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:18:24,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:18:24,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1843767890, now seen corresponding path program 1 times [2024-02-20 12:18:24,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:18:24,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755412801] [2024-02-20 12:18:24,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:18:24,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:18:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:18:24,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:18:24,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:18:24,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755412801] [2024-02-20 12:18:24,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755412801] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:18:24,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:18:24,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:18:24,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427136253] [2024-02-20 12:18:24,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:18:24,982 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:18:24,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:18:24,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:18:24,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:18:24,983 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-20 12:18:24,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 78 transitions, 781 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-02-20 12:18:24,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:18:24,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-20 12:18:24,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:18:25,077 INFO L124 PetriNetUnfolderBase]: 315/621 cut-off events. [2024-02-20 12:18:25,078 INFO L125 PetriNetUnfolderBase]: For 560/634 co-relation queries the response was YES. [2024-02-20 12:18:25,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 621 events. 315/621 cut-off events. For 560/634 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2874 event pairs, 40 based on Foata normal form. 12/561 useless extension candidates. Maximal degree in co-relation 2510. Up to 567 conditions per place. [2024-02-20 12:18:25,082 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 64 selfloop transitions, 2 changer transitions 34/104 dead transitions. [2024-02-20 12:18:25,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 104 transitions, 1256 flow [2024-02-20 12:18:25,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:18:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:18:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-02-20 12:18:25,083 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-20 12:18:25,084 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2024-02-20 12:18:25,084 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 104 transitions, 1256 flow [2024-02-20 12:18:25,084 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-02-20 12:18:25,085 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:18:25,085 INFO L234 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] [2024-02-20 12:18:25,085 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 12:18:25,085 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:18:25,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:18:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash 426916302, now seen corresponding path program 1 times [2024-02-20 12:18:25,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:18:25,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612621851] [2024-02-20 12:18:25,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:18:25,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:18:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:18:25,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:18:25,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:18:25,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612621851] [2024-02-20 12:18:25,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612621851] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:18:25,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965673635] [2024-02-20 12:18:25,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:18:25,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:18:25,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:18:25,940 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-02-20 12:18:25,984 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-02-20 12:18:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:18:26,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 38 conjunts are in the unsatisfiable core [2024-02-20 12:18:26,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:18:26,149 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-02-20 12:18:26,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:18:26,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-20 12:18:26,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:18:26,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-20 12:18:26,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:18:26,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-20 12:18:26,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:18:26,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-20 12:18:26,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:18:26,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-20 12:18:26,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-02-20 12:18:26,279 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-02-20 12:18:26,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-02-20 12:18:26,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-02-20 12:18:26,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2024-02-20 12:18:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:18:26,732 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:18:27,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:18:27,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2024-02-20 12:18:27,406 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-02-20 12:18:27,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 77 [2024-02-20 12:18:27,438 INFO L349 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2024-02-20 12:18:27,438 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 70 treesize of output 66 [2024-02-20 12:18:27,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:18:27,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-02-20 12:18:27,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2024-02-20 12:18:27,483 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:18:27,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-02-20 12:18:27,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:18:27,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965673635] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:18:27,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:18:27,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 32 [2024-02-20 12:18:27,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936763268] [2024-02-20 12:18:27,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:18:27,542 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-02-20 12:18:27,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:18:27,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-02-20 12:18:27,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=887, Unknown=2, NotChecked=0, Total=1056 [2024-02-20 12:18:27,654 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-20 12:18:27,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 104 transitions, 1256 flow. Second operand has 33 states, 33 states have (on average 5.2727272727272725) internal successors, (174), 33 states have internal predecessors, (174), 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-02-20 12:18:27,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:18:27,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-20 12:18:27,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:18:29,664 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int#3| c_~queue~0.base)) (.cse18 (* c_~i~0 4)) (.cse7 (= c_~start~0 0))) (let ((.cse13 (not (= (mod c_~ok~0 256) 0))) (.cse14 (< c_~end~0 0)) (.cse15 (< c_~n~0 (+ c_~end~0 1))) (.cse2 (<= c_~start~0 0)) (.cse4 (not .cse7)) (.cse3 (<= 1 c_~ok~0)) (.cse5 (select (select |c_#memory_int#3| c_~A~0.base) (+ c_~A~0.offset .cse18))) (.cse8 (<= (div c_~ok~0 256) 0)) (.cse6 (not (= c_~end~0 0))) (.cse1 (select .cse9 c_~queue~0.offset))) (and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse0 (select (select |c_#memory_int#3| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= .cse0 c_~v_old~0) (not (= c_~queue~0.base ~A~0.base)) (= .cse1 .cse0)))) .cse2 .cse3 (or (and .cse2 (or .cse4 (= |c_thread1Thread1of1ForFork1_#t~mem1#1| .cse5))) .cse6) .cse7 (or (and .cse3 .cse8 (<= (select .cse9 0) c_~v_old~0)) .cse4) (= |c_thread2Thread1of1ForFork0_~cond~0#1| 1) (or (let ((.cse12 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base)) (.cse11 (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))) (or (< (select .cse10 (+ (* c_~start~0 4) c_~queue~0.offset)) (+ .cse11 1)) (not (= (select .cse10 .cse12) .cse11))))) (or .cse13 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (= (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base) .cse12) (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))))))) .cse14 .cse15) (= c_~ok~0 1) .cse8 (= c_~n~0 1) (= c_~queue~0.offset 0) (<= (+ c_~i~0 1) c_~N~0) (= c_~v_old~0 c_~last~0) (or (let ((.cse16 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161|) 0))))) (and (or (= c_~start~0 c_~end~0) .cse16) (or .cse13 .cse16))) .cse14 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse15) (or (and .cse2 (or .cse4 (and .cse3 (<= .cse5 c_~v_old~0) .cse8))) .cse6) (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse17 (select (select |c_#memory_int#3| ~A~0.base) (+ ~A~0.offset .cse18)))) (and (<= .cse17 c_~v_old~0) (= .cse17 .cse1) (not (= c_~queue~0.base ~A~0.base)))))))) is different from false [2024-02-20 12:18:33,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-02-20 12:18:39,057 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 [0] [2024-02-20 12:18:41,737 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (not (= (mod c_~ok~0 256) 0))) (.cse7 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse12 (select |c_#memory_int#3| c_~queue~0.base)) (.cse9 (+ (* c_~end~0 4) c_~queue~0.offset))) (let ((.cse5 (select |c_#memory_int#3| c_~A~0.base)) (.cse4 (select .cse12 .cse9)) (.cse1 (and .cse10 (<= (select .cse12 .cse7) c_~v_old~0))) (.cse0 (< c_~end~0 0)) (.cse2 (< c_~n~0 (+ c_~end~0 1)))) (and (or .cse0 .cse1 .cse2 (forall ((~A~0.offset Int) (~i~0 Int)) (let ((.cse3 (select .cse5 (+ (* ~i~0 4) ~A~0.offset)))) (or (< c_~last~0 .cse3) (not (= .cse3 .cse4)))))) (or (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base)) (.cse8 (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset)))) (or (< (select .cse6 .cse7) (+ .cse8 1)) (not (= (select .cse6 .cse9) .cse8))))) (or .cse10 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_104 (Array Int Int))) (not (= (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_104) c_~queue~0.base) .cse9) (select v_ArrVal_104 (+ (* ~i~0 4) ~A~0.offset))))))) .cse0 .cse2) (or (not (= (select .cse5 (+ c_~A~0.offset (* c_~i~0 4))) .cse4)) .cse0 .cse1 .cse2 (< c_~last~0 |c_thread1Thread1of1ForFork1_#t~mem1#1|)) (or (let ((.cse11 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_161|) 0))))) (and (or (= c_~start~0 c_~end~0) .cse11) (or .cse10 .cse11))) .cse0 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2)))) is different from false [2024-02-20 12:18:47,623 INFO L124 PetriNetUnfolderBase]: 1931/3307 cut-off events. [2024-02-20 12:18:47,623 INFO L125 PetriNetUnfolderBase]: For 6115/6115 co-relation queries the response was YES. [2024-02-20 12:18:47,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21005 conditions, 3307 events. 1931/3307 cut-off events. For 6115/6115 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 18362 event pairs, 208 based on Foata normal form. 23/3001 useless extension candidates. Maximal degree in co-relation 9863. Up to 2830 conditions per place. [2024-02-20 12:18:47,648 INFO L140 encePairwiseOnDemand]: 12/30 looper letters, 389 selfloop transitions, 158 changer transitions 247/795 dead transitions. [2024-02-20 12:18:47,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 795 transitions, 10887 flow [2024-02-20 12:18:47,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-02-20 12:18:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2024-02-20 12:18:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 747 transitions. [2024-02-20 12:18:47,654 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.32763157894736844 [2024-02-20 12:18:47,654 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 87 predicate places. [2024-02-20 12:18:47,654 INFO L507 AbstractCegarLoop]: Abstraction has has 116 places, 795 transitions, 10887 flow [2024-02-20 12:18:47,655 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 5.2727272727272725) internal successors, (174), 33 states have internal predecessors, (174), 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-02-20 12:18:47,655 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:18:47,655 INFO L234 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] [2024-02-20 12:18:47,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-20 12:18:47,868 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-20 12:18:47,871 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:18:47,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:18:47,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1540360634, now seen corresponding path program 2 times [2024-02-20 12:18:47,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:18:47,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244083068] [2024-02-20 12:18:47,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:18:47,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:18:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:18:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:18:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:18:48,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244083068] [2024-02-20 12:18:48,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244083068] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:18:48,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68815213] [2024-02-20 12:18:48,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 12:18:48,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:18:48,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:18:48,166 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-02-20 12:18:48,167 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-02-20 12:18:48,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 12:18:48,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:18:48,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 12:18:48,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:18:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:18:48,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:18:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:18:48,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68815213] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:18:48,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:18:48,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-02-20 12:18:48,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679223847] [2024-02-20 12:18:48,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:18:48,402 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 12:18:48,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:18:48,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 12:18:48,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-02-20 12:18:48,408 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-20 12:18:48,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 795 transitions, 10887 flow. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 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-02-20 12:18:48,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:18:48,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-20 12:18:48,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:18:49,242 INFO L124 PetriNetUnfolderBase]: 2605/4494 cut-off events. [2024-02-20 12:18:49,243 INFO L125 PetriNetUnfolderBase]: For 11880/11880 co-relation queries the response was YES. [2024-02-20 12:18:49,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32797 conditions, 4494 events. 2605/4494 cut-off events. For 11880/11880 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 26713 event pairs, 79 based on Foata normal form. 236/4241 useless extension candidates. Maximal degree in co-relation 15294. Up to 3804 conditions per place. [2024-02-20 12:18:49,290 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 891 selfloop transitions, 232 changer transitions 305/1429 dead transitions. [2024-02-20 12:18:49,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 1429 transitions, 21793 flow [2024-02-20 12:18:49,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 12:18:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 12:18:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 129 transitions. [2024-02-20 12:18:49,292 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.39090909090909093 [2024-02-20 12:18:49,293 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 96 predicate places. [2024-02-20 12:18:49,293 INFO L507 AbstractCegarLoop]: Abstraction has has 125 places, 1429 transitions, 21793 flow [2024-02-20 12:18:49,293 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 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-02-20 12:18:49,294 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:18:49,294 INFO L234 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] [2024-02-20 12:18:49,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-20 12:18:49,506 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-02-20 12:18:49,507 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:18:49,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:18:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash 518921884, now seen corresponding path program 3 times [2024-02-20 12:18:49,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:18:49,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522554481] [2024-02-20 12:18:49,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:18:49,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:18:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:18:50,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:18:50,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:18:50,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522554481] [2024-02-20 12:18:50,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522554481] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:18:50,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302014386] [2024-02-20 12:18:50,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 12:18:50,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:18:50,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:18:50,239 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-02-20 12:18:50,261 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-02-20 12:18:50,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-20 12:18:50,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:18:50,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 40 conjunts are in the unsatisfiable core [2024-02-20 12:18:50,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:18:50,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-02-20 12:18:50,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:18:50,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-20 12:18:50,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:18:50,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-20 12:18:50,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:18:50,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-20 12:18:50,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:18:50,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-20 12:18:50,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:18:50,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-20 12:18:50,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-02-20 12:18:50,469 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-02-20 12:18:50,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-02-20 12:18:50,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-02-20 12:18:50,804 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-02-20 12:18:50,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-02-20 12:18:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:18:50,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:18:51,339 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:18:51,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 60 [2024-02-20 12:18:51,442 INFO L349 Elim1Store]: treesize reduction 4, result has 95.1 percent of original size [2024-02-20 12:18:51,443 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 184 treesize of output 208 [2024-02-20 12:18:51,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:18:51,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 124 treesize of output 156 [2024-02-20 12:18:52,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:18:52,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 37 [2024-02-20 12:18:52,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:18:52,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 84 [2024-02-20 12:18:52,889 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:18:52,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 61 [2024-02-20 12:18:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:18:52,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302014386] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:18:52,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:18:52,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 29 [2024-02-20 12:18:52,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196963037] [2024-02-20 12:18:52,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:18:52,966 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-02-20 12:18:52,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:18:52,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-02-20 12:18:52,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=711, Unknown=3, NotChecked=0, Total=870 [2024-02-20 12:18:53,000 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-20 12:18:53,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 1429 transitions, 21793 flow. Second operand has 30 states, 30 states have (on average 5.5) internal successors, (165), 30 states have internal predecessors, (165), 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-02-20 12:18:53,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:18:53,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-20 12:18:53,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:18:55,141 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~end~0 1)) (.cse13 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse20 (select |c_#memory_int#3| c_~queue~0.base)) (.cse16 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse7 (div c_~ok~0 256)) (.cse21 (* c_~i~0 4))) (let ((.cse9 (or (< (+ c_~start~0 c_~n~0) 2) (< c_~start~0 1))) (.cse10 (not (= c_~start~0 0))) (.cse1 (select (select |c_#memory_int#3| c_~A~0.base) (+ c_~A~0.offset .cse21))) (.cse8 (not (= c_~end~0 0))) (.cse3 (< c_~end~0 0)) (.cse5 (not (= (* 256 .cse7) c_~ok~0))) (.cse6 (select .cse20 .cse16)) (.cse15 (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (select .cse20 .cse13)) (.cse4 (< c_~n~0 .cse0))) (and (<= 1 c_~ok~0) (or (< 0 .cse0) (< c_~start~0 .cse0)) (or (not (= .cse1 .cse2)) .cse3 .cse4 (and .cse5 (<= .cse6 c_~v_old~0))) (or (< c_~end~0 1) (< c_~n~0 2)) (<= c_~new~0 c_~v_old~0) (= c_~ok~0 1) (<= .cse7 0) (or .cse8 (and .cse9 (or .cse10 (= |c_thread1Thread1of1ForFork1_#t~mem1#1| .cse1)))) (= c_~queue~0.offset 0) (or .cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 (let ((.cse11 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_163| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_163|) 0))))) (and (or .cse11 .cse5) (or .cse11 (and (= c_~i~0 0) (= c_~start~0 c_~end~0)))))) (or (and .cse9 (or .cse10 (< .cse1 (+ c_~v_old~0 1)))) .cse8) (or .cse3 (and (forall ((v_~A~0.base_88 Int) (v_ArrVal_174 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_174))) (let ((.cse12 (select .cse17 c_~queue~0.base)) (.cse14 (select .cse17 v_~A~0.base_88))) (or (not (= (select .cse12 .cse13) (select .cse14 .cse15))) (< (select .cse12 .cse16) (+ (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))))) (or (forall ((v_~A~0.base_88 Int) (v_ArrVal_174 (Array Int Int))) (not (let ((.cse18 (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_174))) (= (select (select .cse18 c_~queue~0.base) .cse13) (select (select .cse18 v_~A~0.base_88) .cse15))))) .cse5)) .cse4) (= c_~v_old~0 c_~last~0) (or .cse3 (and (or .cse5 (forall ((v_~A~0.base_88 Int)) (not (= (select (select |c_#memory_int#3| v_~A~0.base_88) .cse15) .cse2)))) (forall ((v_~A~0.base_88 Int)) (let ((.cse19 (select |c_#memory_int#3| v_~A~0.base_88))) (or (< .cse6 (+ (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select .cse19 .cse15) .cse2)))))) .cse4)))) is different from false [2024-02-20 12:18:56,918 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~end~0 1)) (.cse10 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse17 (select |c_#memory_int#3| c_~queue~0.base)) (.cse13 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse7 (div c_~ok~0 256)) (.cse18 (* c_~i~0 4))) (let ((.cse1 (select (select |c_#memory_int#3| c_~A~0.base) (+ c_~A~0.offset .cse18))) (.cse3 (< c_~end~0 0)) (.cse5 (not (= (* 256 .cse7) c_~ok~0))) (.cse6 (select .cse17 .cse13)) (.cse12 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (select .cse17 .cse10)) (.cse4 (< c_~n~0 .cse0))) (and (<= 1 c_~ok~0) (or (< 0 .cse0) (< c_~start~0 .cse0)) (or (not (= .cse1 .cse2)) .cse3 .cse4 (and .cse5 (<= .cse6 c_~v_old~0))) (or (< c_~end~0 1) (< c_~n~0 2)) (= c_~ok~0 1) (<= .cse7 0) (= c_~queue~0.offset 0) (or .cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 (let ((.cse8 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_163| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_163|) 0))))) (and (or .cse8 .cse5) (or .cse8 (and (= c_~i~0 0) (= c_~start~0 c_~end~0)))))) (or (and (or (< (+ c_~start~0 c_~n~0) 2) (< c_~start~0 1)) (or (not (= c_~start~0 0)) (< .cse1 (+ c_~v_old~0 1)))) (not (= c_~end~0 0))) (or .cse3 (and (forall ((v_~A~0.base_88 Int) (v_ArrVal_174 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_174))) (let ((.cse9 (select .cse14 c_~queue~0.base)) (.cse11 (select .cse14 v_~A~0.base_88))) (or (not (= (select .cse9 .cse10) (select .cse11 .cse12))) (< (select .cse9 .cse13) (+ (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))))) (or (forall ((v_~A~0.base_88 Int) (v_ArrVal_174 (Array Int Int))) (not (let ((.cse15 (store |c_#memory_int#3| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_174))) (= (select (select .cse15 c_~queue~0.base) .cse10) (select (select .cse15 v_~A~0.base_88) .cse12))))) .cse5)) .cse4) (or .cse3 (and (or .cse5 (forall ((v_~A~0.base_88 Int)) (not (= (select (select |c_#memory_int#3| v_~A~0.base_88) .cse12) .cse2)))) (forall ((v_~A~0.base_88 Int)) (let ((.cse16 (select |c_#memory_int#3| v_~A~0.base_88))) (or (< .cse6 (+ (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select .cse16 .cse12) .cse2)))))) .cse4)))) is different from false [2024-02-20 12:18:59,007 INFO L124 PetriNetUnfolderBase]: 5391/9248 cut-off events. [2024-02-20 12:18:59,008 INFO L125 PetriNetUnfolderBase]: For 22183/22183 co-relation queries the response was YES. [2024-02-20 12:18:59,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76803 conditions, 9248 events. 5391/9248 cut-off events. For 22183/22183 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 63040 event pairs, 99 based on Foata normal form. 7/8226 useless extension candidates. Maximal degree in co-relation 50478. Up to 7857 conditions per place. [2024-02-20 12:18:59,106 INFO L140 encePairwiseOnDemand]: 10/30 looper letters, 2175 selfloop transitions, 343 changer transitions 587/3106 dead transitions. [2024-02-20 12:18:59,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 3106 transitions, 53789 flow [2024-02-20 12:18:59,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-02-20 12:18:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2024-02-20 12:18:59,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 548 transitions. [2024-02-20 12:18:59,109 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38865248226950355 [2024-02-20 12:18:59,112 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 142 predicate places. [2024-02-20 12:18:59,112 INFO L507 AbstractCegarLoop]: Abstraction has has 171 places, 3106 transitions, 53789 flow [2024-02-20 12:18:59,112 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.5) internal successors, (165), 30 states have internal predecessors, (165), 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-02-20 12:18:59,112 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:18:59,112 INFO L234 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] [2024-02-20 12:18:59,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-20 12:18:59,326 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:18:59,328 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:18:59,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:18:59,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1178770434, now seen corresponding path program 4 times [2024-02-20 12:18:59,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:18:59,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179147683] [2024-02-20 12:18:59,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:18:59,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:18:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:19:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:19:00,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:19:00,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179147683] [2024-02-20 12:19:00,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179147683] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:19:00,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709032291] [2024-02-20 12:19:00,137 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-20 12:19:00,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:19:00,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:19:00,139 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-02-20 12:19:00,140 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-02-20 12:19:00,215 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-20 12:19:00,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:19:00,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 40 conjunts are in the unsatisfiable core [2024-02-20 12:19:00,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:19:00,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-02-20 12:19:00,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:19:00,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-20 12:19:00,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:19:00,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-20 12:19:00,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:19:00,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2024-02-20 12:19:00,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:19:00,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-02-20 12:19:00,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-20 12:19:00,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-02-20 12:19:00,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-02-20 12:19:00,437 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-02-20 12:19:00,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-02-20 12:19:00,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-02-20 12:19:00,727 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-02-20 12:19:00,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2024-02-20 12:19:00,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:19:00,785 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:19:01,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:19:01,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 60 [2024-02-20 12:19:01,345 INFO L349 Elim1Store]: treesize reduction 4, result has 95.1 percent of original size [2024-02-20 12:19:01,345 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 184 treesize of output 208 [2024-02-20 12:19:01,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:19:01,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 124 treesize of output 156 [2024-02-20 12:19:03,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:19:03,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 37 [2024-02-20 12:19:03,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:19:03,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 84 [2024-02-20 12:19:03,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:19:03,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 61 [2024-02-20 12:19:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:19:03,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709032291] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:19:03,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:19:03,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 10] total 30 [2024-02-20 12:19:03,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681917515] [2024-02-20 12:19:03,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:19:03,785 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-02-20 12:19:03,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:19:03,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-02-20 12:19:03,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=765, Unknown=3, NotChecked=0, Total=930 [2024-02-20 12:19:03,852 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-20 12:19:03,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 3106 transitions, 53789 flow. Second operand has 31 states, 31 states have (on average 5.419354838709677) internal successors, (168), 31 states have internal predecessors, (168), 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-02-20 12:19:03,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:19:03,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-20 12:19:03,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:19:13,228 INFO L124 PetriNetUnfolderBase]: 6241/10755 cut-off events. [2024-02-20 12:19:13,228 INFO L125 PetriNetUnfolderBase]: For 22458/22458 co-relation queries the response was YES. [2024-02-20 12:19:13,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100398 conditions, 10755 events. 6241/10755 cut-off events. For 22458/22458 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 74667 event pairs, 106 based on Foata normal form. 4/9540 useless extension candidates. Maximal degree in co-relation 69420. Up to 9203 conditions per place. [2024-02-20 12:19:13,328 INFO L140 encePairwiseOnDemand]: 14/30 looper letters, 2588 selfloop transitions, 531 changer transitions 690/3810 dead transitions. [2024-02-20 12:19:13,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 3810 transitions, 73918 flow [2024-02-20 12:19:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-02-20 12:19:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-02-20 12:19:13,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 537 transitions. [2024-02-20 12:19:13,331 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38913043478260867 [2024-02-20 12:19:13,331 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 187 predicate places. [2024-02-20 12:19:13,332 INFO L507 AbstractCegarLoop]: Abstraction has has 216 places, 3810 transitions, 73918 flow [2024-02-20 12:19:13,332 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.419354838709677) internal successors, (168), 31 states have internal predecessors, (168), 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-02-20 12:19:13,332 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:19:13,332 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 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-02-20 12:19:13,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-02-20 12:19:13,563 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:19:13,564 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:19:13,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:19:13,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1743246630, now seen corresponding path program 5 times [2024-02-20 12:19:13,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:19:13,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147492313] [2024-02-20 12:19:13,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:19:13,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:19:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:19:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:19:15,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:19:15,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147492313] [2024-02-20 12:19:15,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147492313] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:19:15,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244836409] [2024-02-20 12:19:15,087 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-20 12:19:15,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:19:15,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:19:15,101 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-02-20 12:19:15,180 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-02-20 12:19:15,276 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-20 12:19:15,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:19:15,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 28 conjunts are in the unsatisfiable core [2024-02-20 12:19:15,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:19:15,700 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-02-20 12:19:15,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2024-02-20 12:19:15,771 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:19:15,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:19:20,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:19:20,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 72 treesize of output 176 [2024-02-20 12:19:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-02-20 12:19:20,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244836409] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:19:20,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:19:20,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 7] total 29 [2024-02-20 12:19:20,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719997867] [2024-02-20 12:19:20,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:19:20,706 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-02-20 12:19:20,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:19:20,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-02-20 12:19:20,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=728, Unknown=1, NotChecked=0, Total=870 [2024-02-20 12:19:24,718 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-02-20 12:19:28,732 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-02-20 12:19:32,751 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-02-20 12:19:32,751 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-20 12:19:32,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 3810 transitions, 73918 flow. Second operand has 30 states, 30 states have (on average 5.566666666666666) internal successors, (167), 30 states have internal predecessors, (167), 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-02-20 12:19:32,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:19:32,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-20 12:19:32,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:19:42,510 INFO L124 PetriNetUnfolderBase]: 7505/12907 cut-off events. [2024-02-20 12:19:42,510 INFO L125 PetriNetUnfolderBase]: For 29387/29387 co-relation queries the response was YES. [2024-02-20 12:19:42,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133143 conditions, 12907 events. 7505/12907 cut-off events. For 29387/29387 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 92393 event pairs, 105 based on Foata normal form. 2/11444 useless extension candidates. Maximal degree in co-relation 80144. Up to 10990 conditions per place. [2024-02-20 12:19:42,625 INFO L140 encePairwiseOnDemand]: 15/30 looper letters, 3097 selfloop transitions, 514 changer transitions 824/4436 dead transitions. [2024-02-20 12:19:42,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 4436 transitions, 94812 flow [2024-02-20 12:19:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-02-20 12:19:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2024-02-20 12:19:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 402 transitions. [2024-02-20 12:19:42,628 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3435897435897436 [2024-02-20 12:19:42,628 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 225 predicate places. [2024-02-20 12:19:42,628 INFO L507 AbstractCegarLoop]: Abstraction has has 254 places, 4436 transitions, 94812 flow [2024-02-20 12:19:42,629 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.566666666666666) internal successors, (167), 30 states have internal predecessors, (167), 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-02-20 12:19:42,629 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:19:42,629 INFO L234 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] [2024-02-20 12:19:42,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-02-20 12:19:42,841 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-02-20 12:19:42,841 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:19:42,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:19:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1750091803, now seen corresponding path program 6 times [2024-02-20 12:19:42,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:19:42,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704772802] [2024-02-20 12:19:42,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:19:42,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:19:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:19:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:19:42,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:19:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704772802] [2024-02-20 12:19:42,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704772802] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:19:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986191669] [2024-02-20 12:19:42,913 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-20 12:19:42,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:19:42,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:19:42,929 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:19:42,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-20 12:19:43,084 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-02-20 12:19:43,084 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:19:43,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-20 12:19:43,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:19:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:19:43,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:19:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:19:43,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986191669] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:19:43,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:19:43,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2024-02-20 12:19:43,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709810827] [2024-02-20 12:19:43,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:19:43,235 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 12:19:43,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:19:43,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 12:19:43,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-02-20 12:19:43,257 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-20 12:19:43,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 4436 transitions, 94812 flow. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 states have internal predecessors, (116), 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-02-20 12:19:43,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:19:43,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-20 12:19:43,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:19:54,321 INFO L124 PetriNetUnfolderBase]: 8683/15319 cut-off events. [2024-02-20 12:19:54,322 INFO L125 PetriNetUnfolderBase]: For 53591/53591 co-relation queries the response was YES. [2024-02-20 12:19:54,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168920 conditions, 15319 events. 8683/15319 cut-off events. For 53591/53591 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 113884 event pairs, 187 based on Foata normal form. 687/14112 useless extension candidates. Maximal degree in co-relation 53738. Up to 12677 conditions per place. [2024-02-20 12:19:54,526 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 1684 selfloop transitions, 157 changer transitions 2525/4513 dead transitions. [2024-02-20 12:19:54,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 4513 transitions, 105596 flow [2024-02-20 12:19:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-20 12:19:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-20 12:19:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 216 transitions. [2024-02-20 12:19:54,528 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2024-02-20 12:19:54,528 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 215 predicate places. [2024-02-20 12:19:54,528 INFO L507 AbstractCegarLoop]: Abstraction has has 244 places, 4513 transitions, 105596 flow [2024-02-20 12:19:54,529 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 states have internal predecessors, (116), 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-02-20 12:19:54,529 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:19:54,529 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 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] [2024-02-20 12:19:54,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-02-20 12:19:54,730 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:19:54,730 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:19:54,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:19:54,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1457505605, now seen corresponding path program 1 times [2024-02-20 12:19:54,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:19:54,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768209054] [2024-02-20 12:19:54,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:19:54,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:19:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:19:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-02-20 12:19:54,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:19:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768209054] [2024-02-20 12:19:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768209054] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:19:54,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954729971] [2024-02-20 12:19:54,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:19:54,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:19:54,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:19:54,938 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:19:54,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-02-20 12:19:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:19:55,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-20 12:19:55,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:19:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-02-20 12:19:55,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:19:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-02-20 12:19:55,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954729971] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:19:55,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:19:55,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-02-20 12:19:55,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990376884] [2024-02-20 12:19:55,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:19:55,282 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-20 12:19:55,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:19:55,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-20 12:19:55,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-02-20 12:19:55,341 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-20 12:19:55,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 4513 transitions, 105596 flow. Second operand has 15 states, 15 states have (on average 9.2) internal successors, (138), 15 states have internal predecessors, (138), 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-02-20 12:19:55,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:19:55,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-20 12:19:55,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:20:10,146 INFO L124 PetriNetUnfolderBase]: 8671/15797 cut-off events. [2024-02-20 12:20:10,147 INFO L125 PetriNetUnfolderBase]: For 71503/71503 co-relation queries the response was YES. [2024-02-20 12:20:10,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185977 conditions, 15797 events. 8671/15797 cut-off events. For 71503/71503 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 122101 event pairs, 217 based on Foata normal form. 0/14085 useless extension candidates. Maximal degree in co-relation 57695. Up to 12867 conditions per place. [2024-02-20 12:20:10,394 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 1501 selfloop transitions, 105 changer transitions 3477/5201 dead transitions. [2024-02-20 12:20:10,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 5201 transitions, 132283 flow [2024-02-20 12:20:10,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-20 12:20:10,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-20 12:20:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2024-02-20 12:20:10,400 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-02-20 12:20:10,401 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 223 predicate places. [2024-02-20 12:20:10,401 INFO L507 AbstractCegarLoop]: Abstraction has has 252 places, 5201 transitions, 132283 flow [2024-02-20 12:20:10,401 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.2) internal successors, (138), 15 states have internal predecessors, (138), 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-02-20 12:20:10,401 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:20:10,401 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 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] [2024-02-20 12:20:10,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-02-20 12:20:10,613 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:20:10,616 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:20:10,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:20:10,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1212868325, now seen corresponding path program 2 times [2024-02-20 12:20:10,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:20:10,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063479967] [2024-02-20 12:20:10,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:20:10,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:20:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:20:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-02-20 12:20:10,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:20:10,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063479967] [2024-02-20 12:20:10,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063479967] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:20:10,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:20:10,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:20:10,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762803791] [2024-02-20 12:20:10,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:20:10,795 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 12:20:10,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:20:10,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 12:20:10,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-20 12:20:10,811 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-20 12:20:10,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 5201 transitions, 132283 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-02-20 12:20:10,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:20:10,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-20 12:20:10,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:20:22,295 INFO L124 PetriNetUnfolderBase]: 5952/10919 cut-off events. [2024-02-20 12:20:22,295 INFO L125 PetriNetUnfolderBase]: For 62014/62014 co-relation queries the response was YES. [2024-02-20 12:20:22,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136964 conditions, 10919 events. 5952/10919 cut-off events. For 62014/62014 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 79059 event pairs, 122 based on Foata normal form. 0/9828 useless extension candidates. Maximal degree in co-relation 40711. Up to 8839 conditions per place. [2024-02-20 12:20:22,368 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 1159 selfloop transitions, 34 changer transitions 2326/3593 dead transitions. [2024-02-20 12:20:22,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 3593 transitions, 97898 flow [2024-02-20 12:20:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 12:20:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 12:20:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2024-02-20 12:20:22,370 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2024-02-20 12:20:22,370 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 194 predicate places. [2024-02-20 12:20:22,370 INFO L507 AbstractCegarLoop]: Abstraction has has 223 places, 3593 transitions, 97898 flow [2024-02-20 12:20:22,370 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-02-20 12:20:22,371 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:20:22,371 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:20:22,371 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-20 12:20:22,371 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:20:22,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:20:22,372 INFO L85 PathProgramCache]: Analyzing trace with hash 696218693, now seen corresponding path program 7 times [2024-02-20 12:20:22,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:20:22,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029709050] [2024-02-20 12:20:22,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:20:22,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:20:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:20:24,156 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 12:20:24,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:20:24,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029709050] [2024-02-20 12:20:24,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029709050] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:20:24,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086586580] [2024-02-20 12:20:24,157 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-20 12:20:24,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:20:24,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:20:24,173 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:20:24,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-02-20 12:20:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:20:24,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 41 conjunts are in the unsatisfiable core [2024-02-20 12:20:24,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:20:25,367 INFO L349 Elim1Store]: treesize reduction 38, result has 54.8 percent of original size [2024-02-20 12:20:25,367 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 74 treesize of output 61 [2024-02-20 12:20:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-20 12:20:25,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:20:28,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:20:28,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 233 treesize of output 1432 [2024-02-20 12:23:36,242 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-02-20 12:23:36,244 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-02-20 12:23:36,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-02-20 12:23:36,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-02-20 12:23:36,444 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-02-20 12:23:36,445 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:609) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:443) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:378) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:527) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-02-20 12:23:36,450 INFO L158 Benchmark]: Toolchain (without parser) took 314158.44ms. Allocated memory was 192.9MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 141.2MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. [2024-02-20 12:23:36,450 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 58.8MB in the beginning and 58.7MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-20 12:23:36,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.86ms. Allocated memory is still 192.9MB. Free memory was 141.2MB in the beginning and 128.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-02-20 12:23:36,451 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.17ms. Allocated memory is still 192.9MB. Free memory was 128.6MB in the beginning and 126.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-20 12:23:36,451 INFO L158 Benchmark]: Boogie Preprocessor took 54.29ms. Allocated memory is still 192.9MB. Free memory was 126.5MB in the beginning and 123.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-20 12:23:36,451 INFO L158 Benchmark]: RCFGBuilder took 782.17ms. Allocated memory is still 192.9MB. Free memory was 123.7MB in the beginning and 104.6MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-02-20 12:23:36,451 INFO L158 Benchmark]: TraceAbstraction took 313001.19ms. Allocated memory was 192.9MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 104.6MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. [2024-02-20 12:23:36,454 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 58.8MB in the beginning and 58.7MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.86ms. Allocated memory is still 192.9MB. Free memory was 141.2MB in the beginning and 128.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.17ms. Allocated memory is still 192.9MB. Free memory was 128.6MB in the beginning and 126.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.29ms. Allocated memory is still 192.9MB. Free memory was 126.5MB in the beginning and 123.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 782.17ms. Allocated memory is still 192.9MB. Free memory was 123.7MB in the beginning and 104.6MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 313001.19ms. Allocated memory was 192.9MB in the beginning and 4.8GB in the end (delta: 4.6GB). Free memory was 104.6MB in the beginning and 4.0GB in the end (delta: -3.9GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 12:23:38,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 12:23:38,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-02-20 12:23:38,989 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 12:23:38,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 12:23:39,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 12:23:39,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 12:23:39,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 12:23:39,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 12:23:39,026 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 12:23:39,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 12:23:39,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 12:23:39,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 12:23:39,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 12:23:39,028 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 12:23:39,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 12:23:39,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 12:23:39,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 12:23:39,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 12:23:39,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 12:23:39,029 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 12:23:39,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 12:23:39,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 12:23:39,030 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-02-20 12:23:39,031 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-02-20 12:23:39,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 12:23:39,031 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-02-20 12:23:39,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 12:23:39,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 12:23:39,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 12:23:39,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 12:23:39,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 12:23:39,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 12:23:39,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 12:23:39,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:23:39,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 12:23:39,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 12:23:39,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 12:23:39,034 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-02-20 12:23:39,034 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-02-20 12:23:39,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 12:23:39,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 12:23:39,035 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 12:23:39,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 12:23:39,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 12:23:39,036 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-02-20 12:23:39,036 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 -> ecda181bd3fe1882667151a04232fb9d04292dd6ca3491d98fdc8de5d539856a Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 12:23:39,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 12:23:39,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 12:23:39,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 12:23:39,359 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 12:23:39,361 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 12:23:39,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-02-20 12:23:40,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 12:23:40,862 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 12:23:40,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-02-20 12:23:40,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5050d9a/f38005f2a3a6485e8e489a71d3bcd30e/FLAGa3c51f7a8 [2024-02-20 12:23:40,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5050d9a/f38005f2a3a6485e8e489a71d3bcd30e [2024-02-20 12:23:40,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 12:23:40,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 12:23:40,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 12:23:40,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 12:23:40,900 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 12:23:40,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:23:40" (1/1) ... [2024-02-20 12:23:40,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e18dcc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:23:40, skipping insertion in model container [2024-02-20 12:23:40,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:23:40" (1/1) ... [2024-02-20 12:23:40,925 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 12:23:41,135 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2024-02-20 12:23:41,149 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:23:41,164 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-02-20 12:23:41,169 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 12:23:41,192 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2024-02-20 12:23:41,199 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:23:41,205 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 12:23:41,241 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2024-02-20 12:23:41,244 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:23:41,267 INFO L206 MainTranslator]: Completed translation [2024-02-20 12:23:41,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:23:41 WrapperNode [2024-02-20 12:23:41,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 12:23:41,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 12:23:41,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 12:23:41,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 12:23:41,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:23:41" (1/1) ... [2024-02-20 12:23:41,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:23:41" (1/1) ... [2024-02-20 12:23:41,327 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 192 [2024-02-20 12:23:41,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 12:23:41,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 12:23:41,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 12:23:41,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 12:23:41,339 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:23:41" (1/1) ... [2024-02-20 12:23:41,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:23:41" (1/1) ... [2024-02-20 12:23:41,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:23:41" (1/1) ... [2024-02-20 12:23:41,371 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 2, 8, 2]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 1, 2, 1]. [2024-02-20 12:23:41,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:23:41" (1/1) ... [2024-02-20 12:23:41,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:23:41" (1/1) ... [2024-02-20 12:23:41,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:23:41" (1/1) ... [2024-02-20 12:23:41,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:23:41" (1/1) ... [2024-02-20 12:23:41,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:23:41" (1/1) ... [2024-02-20 12:23:41,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:23:41" (1/1) ... [2024-02-20 12:23:41,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 12:23:41,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 12:23:41,396 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 12:23:41,396 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 12:23:41,401 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:23:41" (1/1) ... [2024-02-20 12:23:41,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:23:41,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:23:41,463 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-02-20 12:23:41,471 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-02-20 12:23:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 12:23:41,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-02-20 12:23:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-02-20 12:23:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-02-20 12:23:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-02-20 12:23:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 12:23:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-02-20 12:23:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-02-20 12:23:41,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-02-20 12:23:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-02-20 12:23:41,507 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 12:23:41,507 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 12:23:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 12:23:41,508 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 12:23:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 12:23:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 12:23:41,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-20 12:23:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 12:23:41,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 12:23:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 12:23:41,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-02-20 12:23:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-02-20 12:23:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-02-20 12:23:41,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-02-20 12:23:41,512 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 12:23:41,633 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 12:23:41,635 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 12:23:41,977 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 12:23:41,977 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 12:23:42,289 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 12:23:42,289 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-20 12:23:42,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:23:42 BoogieIcfgContainer [2024-02-20 12:23:42,290 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 12:23:42,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 12:23:42,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 12:23:42,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 12:23:42,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 12:23:40" (1/3) ... [2024-02-20 12:23:42,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d32b9ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:23:42, skipping insertion in model container [2024-02-20 12:23:42,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:23:41" (2/3) ... [2024-02-20 12:23:42,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d32b9ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:23:42, skipping insertion in model container [2024-02-20 12:23:42,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:23:42" (3/3) ... [2024-02-20 12:23:42,300 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2024-02-20 12:23:42,315 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 12:23:42,315 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 12:23:42,316 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 12:23:42,350 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-20 12:23:42,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 74 flow [2024-02-20 12:23:42,430 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2024-02-20 12:23:42,430 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 12:23:42,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 5/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2024-02-20 12:23:42,435 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 74 flow [2024-02-20 12:23:42,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 27 transitions, 66 flow [2024-02-20 12:23:42,450 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 12:23:42,456 INFO L369 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@1599b504, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 12:23:42,457 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-20 12:23:42,471 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 12:23:42,471 INFO L124 PetriNetUnfolderBase]: 5/26 cut-off events. [2024-02-20 12:23:42,471 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 12:23:42,471 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:23:42,472 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:23:42,473 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:23:42,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:23:42,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1288847665, now seen corresponding path program 1 times [2024-02-20 12:23:42,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:23:42,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803521433] [2024-02-20 12:23:42,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:23:42,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:23:42,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:23:42,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-20 12:23:42,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-02-20 12:23:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:23:42,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-20 12:23:42,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:23:42,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-02-20 12:23:42,664 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:23:42,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:23:42,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803521433] [2024-02-20 12:23:42,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803521433] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:23:42,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:23:42,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 12:23:42,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635976510] [2024-02-20 12:23:42,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:23:42,673 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:23:42,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:23:42,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:23:42,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:23:42,695 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-20 12:23:42,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-02-20 12:23:42,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:23:42,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-20 12:23:42,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:23:42,852 INFO L124 PetriNetUnfolderBase]: 149/290 cut-off events. [2024-02-20 12:23:42,852 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-02-20 12:23:42,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 567 conditions, 290 events. 149/290 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1072 event pairs, 51 based on Foata normal form. 1/247 useless extension candidates. Maximal degree in co-relation 482. Up to 127 conditions per place. [2024-02-20 12:23:42,858 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2024-02-20 12:23:42,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 41 transitions, 174 flow [2024-02-20 12:23:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:23:42,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:23:42,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2024-02-20 12:23:42,868 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6222222222222222 [2024-02-20 12:23:42,871 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2024-02-20 12:23:42,871 INFO L507 AbstractCegarLoop]: Abstraction has has 31 places, 41 transitions, 174 flow [2024-02-20 12:23:42,871 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-02-20 12:23:42,872 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:23:42,872 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:23:42,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-02-20 12:23:43,075 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:23:43,076 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:23:43,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:23:43,078 INFO L85 PathProgramCache]: Analyzing trace with hash -2006503072, now seen corresponding path program 1 times [2024-02-20 12:23:43,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:23:43,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936749250] [2024-02-20 12:23:43,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:23:43,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:23:43,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:23:43,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-20 12:23:43,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-02-20 12:23:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:23:43,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-20 12:23:43,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:23:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:23:43,233 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:23:43,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:23:43,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936749250] [2024-02-20 12:23:43,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936749250] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:23:43,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:23:43,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:23:43,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464846467] [2024-02-20 12:23:43,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:23:43,235 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:23:43,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:23:43,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:23:43,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:23:43,247 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-20 12:23:43,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 41 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-02-20 12:23:43,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:23:43,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-20 12:23:43,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:23:43,495 INFO L124 PetriNetUnfolderBase]: 316/538 cut-off events. [2024-02-20 12:23:43,496 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-02-20 12:23:43,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 538 events. 316/538 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1820 event pairs, 41 based on Foata normal form. 16/488 useless extension candidates. Maximal degree in co-relation 1361. Up to 323 conditions per place. [2024-02-20 12:23:43,499 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 55 selfloop transitions, 3 changer transitions 34/93 dead transitions. [2024-02-20 12:23:43,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 93 transitions, 579 flow [2024-02-20 12:23:43,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-20 12:23:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-20 12:23:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2024-02-20 12:23:43,502 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4380952380952381 [2024-02-20 12:23:43,502 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2024-02-20 12:23:43,503 INFO L507 AbstractCegarLoop]: Abstraction has has 37 places, 93 transitions, 579 flow [2024-02-20 12:23:43,503 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-02-20 12:23:43,503 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:23:43,503 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:23:43,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-02-20 12:23:43,706 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:23:43,707 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:23:43,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:23:43,707 INFO L85 PathProgramCache]: Analyzing trace with hash 892026424, now seen corresponding path program 1 times [2024-02-20 12:23:43,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:23:43,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655782550] [2024-02-20 12:23:43,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:23:43,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:23:43,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:23:43,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-20 12:23:43,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-02-20 12:23:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:23:43,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-20 12:23:43,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:23:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:23:43,864 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:23:43,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:23:43,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655782550] [2024-02-20 12:23:43,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655782550] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:23:43,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:23:43,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:23:43,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617024439] [2024-02-20 12:23:43,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:23:43,866 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:23:43,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:23:43,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:23:43,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:23:43,867 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-20 12:23:43,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 93 transitions, 579 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-02-20 12:23:43,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:23:43,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-20 12:23:43,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:23:44,042 INFO L124 PetriNetUnfolderBase]: 387/675 cut-off events. [2024-02-20 12:23:44,042 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2024-02-20 12:23:44,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2555 conditions, 675 events. 387/675 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2538 event pairs, 70 based on Foata normal form. 10/597 useless extension candidates. Maximal degree in co-relation 1762. Up to 458 conditions per place. [2024-02-20 12:23:44,046 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 52 selfloop transitions, 2 changer transitions 64/124 dead transitions. [2024-02-20 12:23:44,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 124 transitions, 1015 flow [2024-02-20 12:23:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:23:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:23:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-02-20 12:23:44,048 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-20 12:23:44,048 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 11 predicate places. [2024-02-20 12:23:44,048 INFO L507 AbstractCegarLoop]: Abstraction has has 40 places, 124 transitions, 1015 flow [2024-02-20 12:23:44,049 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-02-20 12:23:44,049 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:23:44,049 INFO L234 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] [2024-02-20 12:23:44,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-02-20 12:23:44,252 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:23:44,253 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:23:44,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:23:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash 831084334, now seen corresponding path program 1 times [2024-02-20 12:23:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:23:44,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659892593] [2024-02-20 12:23:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:23:44,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:23:44,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:23:44,270 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-20 12:23:44,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-02-20 12:23:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:23:44,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-20 12:23:44,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:23:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 12:23:44,417 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 12:23:44,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:23:44,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659892593] [2024-02-20 12:23:44,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659892593] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:23:44,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:23:44,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:23:44,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406074081] [2024-02-20 12:23:44,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:23:44,418 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:23:44,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:23:44,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:23:44,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:23:44,426 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-20 12:23:44,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 124 transitions, 1015 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-02-20 12:23:44,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:23:44,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-20 12:23:44,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:23:44,673 INFO L124 PetriNetUnfolderBase]: 599/1059 cut-off events. [2024-02-20 12:23:44,673 INFO L125 PetriNetUnfolderBase]: For 924/924 co-relation queries the response was YES. [2024-02-20 12:23:44,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4890 conditions, 1059 events. 599/1059 cut-off events. For 924/924 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4724 event pairs, 94 based on Foata normal form. 0/931 useless extension candidates. Maximal degree in co-relation 3224. Up to 676 conditions per place. [2024-02-20 12:23:44,679 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 72 selfloop transitions, 7 changer transitions 115/200 dead transitions. [2024-02-20 12:23:44,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 200 transitions, 2040 flow [2024-02-20 12:23:44,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:23:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:23:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2024-02-20 12:23:44,694 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-02-20 12:23:44,696 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2024-02-20 12:23:44,696 INFO L507 AbstractCegarLoop]: Abstraction has has 43 places, 200 transitions, 2040 flow [2024-02-20 12:23:44,696 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-02-20 12:23:44,696 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:23:44,696 INFO L234 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] [2024-02-20 12:23:44,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-02-20 12:23:44,897 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:23:44,897 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:23:44,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:23:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1104953238, now seen corresponding path program 1 times [2024-02-20 12:23:44,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:23:44,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391054515] [2024-02-20 12:23:44,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:23:44,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:23:44,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:23:44,900 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-20 12:23:44,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-02-20 12:23:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:23:45,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 12:23:45,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:23:45,820 INFO L349 Elim1Store]: treesize reduction 80, result has 76.0 percent of original size [2024-02-20 12:23:45,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 286 [2024-02-20 12:23:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:23:46,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:24:01,039 WARN L293 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 394 DAG size of output: 346 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-02-20 12:24:01,039 INFO L349 Elim1Store]: treesize reduction 168, result has 90.0 percent of original size [2024-02-20 12:24:01,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 269 treesize of output 1571 [2024-02-20 12:24:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:24:29,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:24:29,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391054515] [2024-02-20 12:24:29,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391054515] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:24:29,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-20 12:24:29,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-02-20 12:24:29,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736444393] [2024-02-20 12:24:29,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-20 12:24:29,445 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-20 12:24:29,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:24:29,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-20 12:24:29,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2024-02-20 12:24:33,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-20 12:24:37,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-02-20 12:24:37,828 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2024-02-20 12:24:37,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 200 transitions, 2040 flow. Second operand has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 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-02-20 12:24:37,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:24:37,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2024-02-20 12:24:37,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:24:41,245 INFO L124 PetriNetUnfolderBase]: 739/1290 cut-off events. [2024-02-20 12:24:41,245 INFO L125 PetriNetUnfolderBase]: For 1755/1755 co-relation queries the response was YES. [2024-02-20 12:24:41,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7131 conditions, 1290 events. 739/1290 cut-off events. For 1755/1755 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5672 event pairs, 54 based on Foata normal form. 1/1143 useless extension candidates. Maximal degree in co-relation 5020. Up to 864 conditions per place. [2024-02-20 12:24:41,274 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 124 selfloop transitions, 16 changer transitions 159/302 dead transitions. [2024-02-20 12:24:41,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 302 transitions, 3677 flow [2024-02-20 12:24:41,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-20 12:24:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-20 12:24:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 125 transitions. [2024-02-20 12:24:41,289 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.46296296296296297 [2024-02-20 12:24:41,290 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 22 predicate places. [2024-02-20 12:24:41,290 INFO L507 AbstractCegarLoop]: Abstraction has has 51 places, 302 transitions, 3677 flow [2024-02-20 12:24:41,290 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.0) internal successors, (112), 16 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-02-20 12:24:41,290 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:24:41,291 INFO L234 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] [2024-02-20 12:24:41,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-02-20 12:24:41,492 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:24:41,493 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:24:41,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:24:41,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1026207875, now seen corresponding path program 2 times [2024-02-20 12:24:41,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:24:41,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262243818] [2024-02-20 12:24:41,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 12:24:41,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:24:41,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:24:41,496 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-20 12:24:41,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-02-20 12:24:41,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 12:24:41,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:24:41,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-20 12:24:41,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:24:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:24:41,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:24:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:24:42,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:24:42,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262243818] [2024-02-20 12:24:42,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262243818] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:24:42,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-20 12:24:42,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-02-20 12:24:42,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447546770] [2024-02-20 12:24:42,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-20 12:24:42,318 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 12:24:42,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:24:42,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 12:24:42,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-02-20 12:24:42,352 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-20 12:24:42,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 302 transitions, 3677 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-02-20 12:24:42,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:24:42,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-20 12:24:42,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:24:43,025 INFO L124 PetriNetUnfolderBase]: 1141/2002 cut-off events. [2024-02-20 12:24:43,026 INFO L125 PetriNetUnfolderBase]: For 4022/4022 co-relation queries the response was YES. [2024-02-20 12:24:43,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12722 conditions, 2002 events. 1141/2002 cut-off events. For 4022/4022 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 9978 event pairs, 81 based on Foata normal form. 28/1800 useless extension candidates. Maximal degree in co-relation 5794. Up to 1456 conditions per place. [2024-02-20 12:24:43,037 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 130 selfloop transitions, 5 changer transitions 316/460 dead transitions. [2024-02-20 12:24:43,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 460 transitions, 6543 flow [2024-02-20 12:24:43,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-20 12:24:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-20 12:24:43,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-02-20 12:24:43,039 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2024-02-20 12:24:43,040 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2024-02-20 12:24:43,040 INFO L507 AbstractCegarLoop]: Abstraction has has 58 places, 460 transitions, 6543 flow [2024-02-20 12:24:43,040 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-02-20 12:24:43,040 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:24:43,040 INFO L234 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] [2024-02-20 12:24:43,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-02-20 12:24:43,265 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:24:43,265 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:24:43,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:24:43,266 INFO L85 PathProgramCache]: Analyzing trace with hash -587233457, now seen corresponding path program 3 times [2024-02-20 12:24:43,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:24:43,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75062833] [2024-02-20 12:24:43,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 12:24:43,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:24:43,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:24:43,285 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-20 12:24:43,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-02-20 12:24:43,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-20 12:24:43,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:24:43,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 16 conjunts are in the unsatisfiable core [2024-02-20 12:24:43,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:24:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:24:43,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:24:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:24:45,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:24:45,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75062833] [2024-02-20 12:24:45,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75062833] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:24:45,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-20 12:24:45,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2024-02-20 12:24:45,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952948112] [2024-02-20 12:24:45,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-20 12:24:45,684 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-20 12:24:45,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:24:45,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-20 12:24:45,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-02-20 12:24:45,836 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-20 12:24:45,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 460 transitions, 6543 flow. Second operand has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 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-02-20 12:24:45,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:24:45,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-20 12:24:45,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:24:49,892 INFO L124 PetriNetUnfolderBase]: 3927/6686 cut-off events. [2024-02-20 12:24:49,892 INFO L125 PetriNetUnfolderBase]: For 12594/12594 co-relation queries the response was YES. [2024-02-20 12:24:49,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48566 conditions, 6686 events. 3927/6686 cut-off events. For 12594/12594 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 37752 event pairs, 102 based on Foata normal form. 268/6198 useless extension candidates. Maximal degree in co-relation 16220. Up to 5299 conditions per place. [2024-02-20 12:24:49,944 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 764 selfloop transitions, 96 changer transitions 692/1553 dead transitions. [2024-02-20 12:24:49,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 1553 transitions, 24996 flow [2024-02-20 12:24:49,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-02-20 12:24:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-02-20 12:24:49,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 388 transitions. [2024-02-20 12:24:49,949 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5173333333333333 [2024-02-20 12:24:49,949 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2024-02-20 12:24:49,951 INFO L507 AbstractCegarLoop]: Abstraction has has 82 places, 1553 transitions, 24996 flow [2024-02-20 12:24:49,952 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.625) internal successors, (106), 16 states have internal predecessors, (106), 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-02-20 12:24:49,952 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:24:49,952 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:24:49,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-02-20 12:24:50,160 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:24:50,161 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:24:50,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:24:50,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1076131448, now seen corresponding path program 4 times [2024-02-20 12:24:50,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:24:50,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952329906] [2024-02-20 12:24:50,162 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-20 12:24:50,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:24:50,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:24:50,166 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-20 12:24:50,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-02-20 12:24:50,342 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-20 12:24:50,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:24:50,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2024-02-20 12:24:50,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:24:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-20 12:24:50,853 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:24:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-20 12:24:51,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:24:51,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952329906] [2024-02-20 12:24:51,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952329906] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:24:51,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-20 12:24:51,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-02-20 12:24:51,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249764493] [2024-02-20 12:24:51,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-20 12:24:51,765 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-20 12:24:51,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:24:51,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-20 12:24:51,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-02-20 12:24:52,026 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-02-20 12:24:52,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 1553 transitions, 24996 flow. Second operand has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 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-02-20 12:24:52,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:24:52,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-02-20 12:24:52,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:24:57,186 INFO L124 PetriNetUnfolderBase]: 4792/8421 cut-off events. [2024-02-20 12:24:57,187 INFO L125 PetriNetUnfolderBase]: For 14945/14945 co-relation queries the response was YES. [2024-02-20 12:24:57,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70050 conditions, 8421 events. 4792/8421 cut-off events. For 14945/14945 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 51692 event pairs, 101 based on Foata normal form. 72/7511 useless extension candidates. Maximal degree in co-relation 24874. Up to 6830 conditions per place. [2024-02-20 12:24:57,245 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 1058 selfloop transitions, 101 changer transitions 1018/2178 dead transitions. [2024-02-20 12:24:57,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 2178 transitions, 39464 flow [2024-02-20 12:24:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-20 12:24:57,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-20 12:24:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 226 transitions. [2024-02-20 12:24:57,249 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.44313725490196076 [2024-02-20 12:24:57,252 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2024-02-20 12:24:57,252 INFO L507 AbstractCegarLoop]: Abstraction has has 98 places, 2178 transitions, 39464 flow [2024-02-20 12:24:57,252 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.052631578947368) internal successors, (115), 19 states have internal predecessors, (115), 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-02-20 12:24:57,252 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:24:57,253 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:24:57,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-02-20 12:24:57,457 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:24:57,458 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:24:57,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:24:57,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1429336231, now seen corresponding path program 5 times [2024-02-20 12:24:57,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:24:57,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305759035] [2024-02-20 12:24:57,460 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-20 12:24:57,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:24:57,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:24:57,474 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-20 12:24:57,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-02-20 12:24:57,669 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-02-20 12:24:57,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:24:57,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-20 12:24:57,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:24:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-02-20 12:24:57,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:24:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:24:58,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-02-20 12:24:58,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305759035] [2024-02-20 12:24:58,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305759035] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:24:58,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-02-20 12:24:58,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 15 [2024-02-20 12:24:58,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130477703] [2024-02-20 12:24:58,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-02-20 12:24:58,413 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-20 12:24:58,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-02-20 12:24:58,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-20 12:24:58,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-02-20 12:24:58,587 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-02-20 12:24:58,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 2178 transitions, 39464 flow. Second operand has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 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-02-20 12:24:58,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:24:58,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-02-20 12:24:58,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:25:04,387 INFO L124 PetriNetUnfolderBase]: 9131/16092 cut-off events. [2024-02-20 12:25:04,388 INFO L125 PetriNetUnfolderBase]: For 37512/37512 co-relation queries the response was YES. [2024-02-20 12:25:04,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147027 conditions, 16092 events. 9131/16092 cut-off events. For 37512/37512 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 114146 event pairs, 403 based on Foata normal form. 0/14761 useless extension candidates. Maximal degree in co-relation 33282. Up to 12877 conditions per place. [2024-02-20 12:25:04,509 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 1779 selfloop transitions, 414 changer transitions 2495/4746 dead transitions. [2024-02-20 12:25:04,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 4746 transitions, 95567 flow [2024-02-20 12:25:04,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-20 12:25:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-20 12:25:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 212 transitions. [2024-02-20 12:25:04,511 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4711111111111111 [2024-02-20 12:25:04,512 INFO L308 CegarLoopForPetriNet]: 29 programPoint places, 83 predicate places. [2024-02-20 12:25:04,512 INFO L507 AbstractCegarLoop]: Abstraction has has 112 places, 4746 transitions, 95567 flow [2024-02-20 12:25:04,512 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.25) internal successors, (148), 16 states have internal predecessors, (148), 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-02-20 12:25:04,512 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:25:04,513 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:25:04,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-02-20 12:25:04,717 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:25:04,718 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:25:04,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:25:04,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1566818177, now seen corresponding path program 6 times [2024-02-20 12:25:04,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-02-20 12:25:04,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48383420] [2024-02-20 12:25:04,719 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-20 12:25:04,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-02-20 12:25:04,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-02-20 12:25:04,720 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-02-20 12:25:04,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-02-20 12:25:05,181 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-02-20 12:25:05,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:25:05,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-20 12:25:05,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:25:10,142 INFO L349 Elim1Store]: treesize reduction 268, result has 79.7 percent of original size [2024-02-20 12:25:10,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 6 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 298 treesize of output 1112 [2024-02-20 12:25:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-20 12:25:12,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:26:33,225 WARN L293 SmtUtils]: Spent 19.86s on a formula simplification. DAG size of input: 843 DAG size of output: 584 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-02-20 12:26:33,226 INFO L349 Elim1Store]: treesize reduction 973, result has 73.5 percent of original size [2024-02-20 12:26:33,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 276 case distinctions, treesize of input 332 treesize of output 2767 Killed by 15