./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-inc-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 69f7b2e4777088b02df05d348ae0a210dcd9618a97428b10acd3ef63d9199610 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:44:19,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:44:19,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:44:19,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:44:19,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:44:19,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:44:19,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:44:19,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:44:19,511 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:44:19,514 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:44:19,514 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:44:19,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:44:19,515 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:44:19,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:44:19,516 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:44:19,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:44:19,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:44:19,517 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:44:19,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:44:19,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:44:19,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:44:19,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:44:19,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:44:19,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:44:19,518 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:44:19,519 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:44:19,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:44:19,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:44:19,520 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:44:19,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:44:19,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:44:19,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:44:19,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:44:19,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:44:19,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:44:19,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:44:19,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:44:19,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:44:19,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:44:19,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:44:19,522 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:44:19,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:44:19,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:44:19,523 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 -> 69f7b2e4777088b02df05d348ae0a210dcd9618a97428b10acd3ef63d9199610 [2024-01-27 15:44:19,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:44:19,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:44:19,773 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:44:19,774 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:44:19,775 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:44:19,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-01-27 15:44:20,820 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:44:20,991 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:44:20,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-01-27 15:44:20,998 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ae4260f/22b305004e894518b21676c777c69372/FLAG17f54c41b [2024-01-27 15:44:21,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06ae4260f/22b305004e894518b21676c777c69372 [2024-01-27 15:44:21,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:44:21,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:44:21,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:44:21,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:44:21,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:44:21,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:44:21" (1/1) ... [2024-01-27 15:44:21,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c25e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:44:21, skipping insertion in model container [2024-01-27 15:44:21,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:44:21" (1/1) ... [2024-01-27 15:44:21,422 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:44:21,590 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-inc-subseq.wvr.c[2950,2963] [2024-01-27 15:44:21,605 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:44:21,617 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:44:21,641 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-inc-subseq.wvr.c[2950,2963] [2024-01-27 15:44:21,643 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:44:21,659 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:44:21,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:44:21 WrapperNode [2024-01-27 15:44:21,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:44:21,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:44:21,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:44:21,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:44:21,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:44:21" (1/1) ... [2024-01-27 15:44:21,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:44:21" (1/1) ... [2024-01-27 15:44:21,694 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 199 [2024-01-27 15:44:21,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:44:21,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:44:21,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:44:21,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:44:21,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:44:21" (1/1) ... [2024-01-27 15:44:21,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:44:21" (1/1) ... [2024-01-27 15:44:21,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:44:21" (1/1) ... [2024-01-27 15:44:21,749 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-01-27 15:44:21,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:44:21" (1/1) ... [2024-01-27 15:44:21,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:44:21" (1/1) ... [2024-01-27 15:44:21,766 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:44:21" (1/1) ... [2024-01-27 15:44:21,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:44:21" (1/1) ... [2024-01-27 15:44:21,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:44:21" (1/1) ... [2024-01-27 15:44:21,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:44:21" (1/1) ... [2024-01-27 15:44:21,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:44:21,789 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:44:21,789 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:44:21,790 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:44:21,790 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:44:21" (1/1) ... [2024-01-27 15:44:21,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:44:21,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:44:21,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 15:44:21,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 15:44:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:44:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:44:21,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:44:21,864 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:44:21,865 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:44:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:44:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:44:21,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:44:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:44:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:44:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:44:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:44:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:44:21,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:44:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:44:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:44:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:44:21,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:44:21,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:44:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:44:21,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:44:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:44:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:44:21,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:44:21,873 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:44:21,982 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:44:21,984 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:44:22,197 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:44:22,197 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:44:22,407 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:44:22,408 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-27 15:44:22,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:44:22 BoogieIcfgContainer [2024-01-27 15:44:22,408 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:44:22,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:44:22,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:44:22,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:44:22,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:44:21" (1/3) ... [2024-01-27 15:44:22,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3ada0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:44:22, skipping insertion in model container [2024-01-27 15:44:22,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:44:21" (2/3) ... [2024-01-27 15:44:22,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3ada0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:44:22, skipping insertion in model container [2024-01-27 15:44:22,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:44:22" (3/3) ... [2024-01-27 15:44:22,415 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2024-01-27 15:44:22,421 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:44:22,428 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:44:22,429 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:44:22,429 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:44:22,471 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 15:44:22,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 78 flow [2024-01-27 15:44:22,519 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2024-01-27 15:44:22,520 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:44:22,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 5/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2024-01-27 15:44:22,522 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 32 transitions, 78 flow [2024-01-27 15:44:22,525 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 29 transitions, 70 flow [2024-01-27 15:44:22,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:44:22,536 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@44196604, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:44:22,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-01-27 15:44:22,544 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:44:22,544 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2024-01-27 15:44:22,544 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:44:22,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:22,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:44:22,546 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:44:22,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:22,550 INFO L85 PathProgramCache]: Analyzing trace with hash 547110899, now seen corresponding path program 1 times [2024-01-27 15:44:22,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:22,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285735653] [2024-01-27 15:44:22,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:22,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:22,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:44:22,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:22,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285735653] [2024-01-27 15:44:22,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285735653] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:44:22,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:44:22,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:44:22,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838375728] [2024-01-27 15:44:22,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:44:22,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:44:22,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:22,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:44:22,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:44:22,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:44:22,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 70 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-01-27 15:44:22,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:22,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:44:22,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:23,055 INFO L124 PetriNetUnfolderBase]: 207/354 cut-off events. [2024-01-27 15:44:23,055 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-27 15:44:23,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 354 events. 207/354 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1421 event pairs, 51 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 651. Up to 197 conditions per place. [2024-01-27 15:44:23,061 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 32 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2024-01-27 15:44:23,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 167 flow [2024-01-27 15:44:23,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:44:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:44:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2024-01-27 15:44:23,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-01-27 15:44:23,074 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 70 flow. Second operand 4 states and 68 transitions. [2024-01-27 15:44:23,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 167 flow [2024-01-27 15:44:23,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 41 transitions, 157 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 15:44:23,078 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 76 flow [2024-01-27 15:44:23,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=31, PETRI_TRANSITIONS=30} [2024-01-27 15:44:23,083 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2024-01-27 15:44:23,083 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 76 flow [2024-01-27 15:44:23,083 INFO L496 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-01-27 15:44:23,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:23,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:44:23,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:44:23,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:44:23,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:23,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1937993546, now seen corresponding path program 1 times [2024-01-27 15:44:23,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:23,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371723114] [2024-01-27 15:44:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:23,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:44:23,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:23,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371723114] [2024-01-27 15:44:23,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371723114] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:44:23,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:44:23,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:44:23,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611900620] [2024-01-27 15:44:23,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:44:23,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:44:23,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:23,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:44:23,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:44:23,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:44:23,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:23,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:23,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:44:23,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:23,338 INFO L124 PetriNetUnfolderBase]: 207/379 cut-off events. [2024-01-27 15:44:23,338 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-27 15:44:23,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 379 events. 207/379 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1637 event pairs, 129 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 285. Up to 329 conditions per place. [2024-01-27 15:44:23,343 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 23 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-01-27 15:44:23,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 128 flow [2024-01-27 15:44:23,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:44:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:44:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-01-27 15:44:23,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-01-27 15:44:23,346 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 76 flow. Second operand 3 states and 49 transitions. [2024-01-27 15:44:23,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 128 flow [2024-01-27 15:44:23,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-27 15:44:23,350 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 84 flow [2024-01-27 15:44:23,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2024-01-27 15:44:23,352 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-01-27 15:44:23,353 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 84 flow [2024-01-27 15:44:23,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:23,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:23,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:44:23,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:44:23,356 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:44:23,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:23,358 INFO L85 PathProgramCache]: Analyzing trace with hash 855847812, now seen corresponding path program 1 times [2024-01-27 15:44:23,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:23,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781775275] [2024-01-27 15:44:23,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:23,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:23,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:44:23,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:23,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781775275] [2024-01-27 15:44:23,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781775275] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:44:23,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:44:23,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:44:23,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002644953] [2024-01-27 15:44:23,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:44:23,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:44:23,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:23,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:44:23,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:44:23,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:44:23,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:23,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:23,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:44:23,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:23,530 INFO L124 PetriNetUnfolderBase]: 263/492 cut-off events. [2024-01-27 15:44:23,531 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-01-27 15:44:23,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 492 events. 263/492 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2204 event pairs, 96 based on Foata normal form. 1/445 useless extension candidates. Maximal degree in co-relation 977. Up to 221 conditions per place. [2024-01-27 15:44:23,533 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 36 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2024-01-27 15:44:23,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 46 transitions, 202 flow [2024-01-27 15:44:23,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:44:23,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:44:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-01-27 15:44:23,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-01-27 15:44:23,535 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 84 flow. Second operand 3 states and 62 transitions. [2024-01-27 15:44:23,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 46 transitions, 202 flow [2024-01-27 15:44:23,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 198 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 15:44:23,536 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 92 flow [2024-01-27 15:44:23,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2024-01-27 15:44:23,537 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2024-01-27 15:44:23,537 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 92 flow [2024-01-27 15:44:23,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:23,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:23,538 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:44:23,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:44:23,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:44:23,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:23,539 INFO L85 PathProgramCache]: Analyzing trace with hash 165802299, now seen corresponding path program 1 times [2024-01-27 15:44:23,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:23,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968672864] [2024-01-27 15:44:23,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:23,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:44:23,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:23,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968672864] [2024-01-27 15:44:23,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968672864] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:44:23,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:44:23,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:44:23,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757965697] [2024-01-27 15:44:23,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:44:23,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:44:23,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:23,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:44:23,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:44:23,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:44:23,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:23,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:23,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:44:23,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:23,672 INFO L124 PetriNetUnfolderBase]: 257/487 cut-off events. [2024-01-27 15:44:23,672 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-01-27 15:44:23,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 487 events. 257/487 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2171 event pairs, 107 based on Foata normal form. 10/460 useless extension candidates. Maximal degree in co-relation 1055. Up to 326 conditions per place. [2024-01-27 15:44:23,674 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 33 selfloop transitions, 2 changer transitions 5/46 dead transitions. [2024-01-27 15:44:23,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 209 flow [2024-01-27 15:44:23,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:44:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:44:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-01-27 15:44:23,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2024-01-27 15:44:23,676 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 92 flow. Second operand 3 states and 61 transitions. [2024-01-27 15:44:23,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 209 flow [2024-01-27 15:44:23,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:44:23,677 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 102 flow [2024-01-27 15:44:23,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2024-01-27 15:44:23,678 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2024-01-27 15:44:23,678 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 102 flow [2024-01-27 15:44:23,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:23,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:23,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:44:23,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:44:23,679 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:44:23,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:23,679 INFO L85 PathProgramCache]: Analyzing trace with hash -989663438, now seen corresponding path program 1 times [2024-01-27 15:44:23,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:23,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335590411] [2024-01-27 15:44:23,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:23,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:23,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:44:23,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:23,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335590411] [2024-01-27 15:44:23,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335590411] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:44:23,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:44:23,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:44:23,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235150527] [2024-01-27 15:44:23,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:44:23,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:44:23,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:23,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:44:23,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:44:23,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:44:23,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:23,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:23,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:44:23,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:23,845 INFO L124 PetriNetUnfolderBase]: 315/619 cut-off events. [2024-01-27 15:44:23,845 INFO L125 PetriNetUnfolderBase]: For 80/87 co-relation queries the response was YES. [2024-01-27 15:44:23,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1421 conditions, 619 events. 315/619 cut-off events. For 80/87 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2986 event pairs, 254 based on Foata normal form. 12/582 useless extension candidates. Maximal degree in co-relation 1115. Up to 448 conditions per place. [2024-01-27 15:44:23,847 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 26 selfloop transitions, 2 changer transitions 18/52 dead transitions. [2024-01-27 15:44:23,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 250 flow [2024-01-27 15:44:23,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:44:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:44:23,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2024-01-27 15:44:23,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5703125 [2024-01-27 15:44:23,849 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 102 flow. Second operand 4 states and 73 transitions. [2024-01-27 15:44:23,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 250 flow [2024-01-27 15:44:23,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 52 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:44:23,850 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 114 flow [2024-01-27 15:44:23,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2024-01-27 15:44:23,851 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-01-27 15:44:23,851 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 114 flow [2024-01-27 15:44:23,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:23,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:23,852 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:44:23,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:44:23,852 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:44:23,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:23,853 INFO L85 PathProgramCache]: Analyzing trace with hash 481046099, now seen corresponding path program 1 times [2024-01-27 15:44:23,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:23,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052494459] [2024-01-27 15:44:23,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:23,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:44:24,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:24,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052494459] [2024-01-27 15:44:24,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052494459] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:44:24,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209366162] [2024-01-27 15:44:24,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:24,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:44:24,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:44:24,609 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:44:24,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-27 15:44:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:24,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 38 conjunts are in the unsatisfiable core [2024-01-27 15:44:24,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:44:24,746 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-01-27 15:44:24,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:24,752 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-01-27 15:44:24,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:24,758 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-01-27 15:44:24,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:24,762 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-01-27 15:44:24,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:24,768 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-01-27 15:44:24,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:44:24,774 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-01-27 15:44:24,804 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-01-27 15:44:24,839 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-27 15:44:24,840 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-01-27 15:44:24,862 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-01-27 15:44:25,238 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-01-27 15:44:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:44:25,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:44:26,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:44:26,074 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-01-27 15:44:26,083 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-01-27 15:44:26,084 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-01-27 15:44:26,113 INFO L349 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2024-01-27 15:44:26,113 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-01-27 15:44:26,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:44:26,141 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-01-27 15:44:26,147 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-01-27 15:44:26,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:44:26,155 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-01-27 15:44:26,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:44:26,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209366162] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:44:26,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:44:26,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 32 [2024-01-27 15:44:26,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227554098] [2024-01-27 15:44:26,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:44:26,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-01-27 15:44:26,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:26,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-01-27 15:44:26,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=841, Unknown=2, NotChecked=0, Total=1056 [2024-01-27 15:44:26,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-01-27 15:44:26,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 114 flow. Second operand has 33 states, 33 states have (on average 7.2727272727272725) internal successors, (240), 33 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:26,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:26,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-01-27 15:44:26,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:30,215 INFO L124 PetriNetUnfolderBase]: 1827/3130 cut-off events. [2024-01-27 15:44:30,215 INFO L125 PetriNetUnfolderBase]: For 518/518 co-relation queries the response was YES. [2024-01-27 15:44:30,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7373 conditions, 3130 events. 1827/3130 cut-off events. For 518/518 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 16317 event pairs, 309 based on Foata normal form. 6/2740 useless extension candidates. Maximal degree in co-relation 7355. Up to 512 conditions per place. [2024-01-27 15:44:30,226 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 238 selfloop transitions, 86 changer transitions 101/428 dead transitions. [2024-01-27 15:44:30,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 428 transitions, 2077 flow [2024-01-27 15:44:30,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-01-27 15:44:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2024-01-27 15:44:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 656 transitions. [2024-01-27 15:44:30,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41 [2024-01-27 15:44:30,229 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 114 flow. Second operand 50 states and 656 transitions. [2024-01-27 15:44:30,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 428 transitions, 2077 flow [2024-01-27 15:44:30,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 428 transitions, 2063 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-01-27 15:44:30,235 INFO L231 Difference]: Finished difference. Result has 115 places, 119 transitions, 807 flow [2024-01-27 15:44:30,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=807, PETRI_PLACES=115, PETRI_TRANSITIONS=119} [2024-01-27 15:44:30,236 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-01-27 15:44:30,236 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 119 transitions, 807 flow [2024-01-27 15:44:30,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.2727272727272725) internal successors, (240), 33 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:30,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:30,236 INFO L208 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, 1, 1] [2024-01-27 15:44:30,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-27 15:44:30,456 WARN L477 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-01-27 15:44:30,456 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:44:30,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:30,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2074415188, now seen corresponding path program 2 times [2024-01-27 15:44:30,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:30,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152691488] [2024-01-27 15:44:30,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:30,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:44:32,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:32,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152691488] [2024-01-27 15:44:32,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152691488] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:44:32,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72060328] [2024-01-27 15:44:32,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:44:32,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:44:32,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:44:32,533 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:44:32,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-27 15:44:32,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:44:32,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:44:32,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 30 conjunts are in the unsatisfiable core [2024-01-27 15:44:32,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:44:33,115 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-01-27 15:44:33,116 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-01-27 15:44:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:44:33,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:44:37,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:44:37,734 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 70 treesize of output 174 [2024-01-27 15:44:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-01-27 15:44:37,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72060328] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:44:37,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:44:37,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 9] total 35 [2024-01-27 15:44:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114507461] [2024-01-27 15:44:37,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:44:37,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-01-27 15:44:37,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:37,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-01-27 15:44:37,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1086, Unknown=1, NotChecked=0, Total=1260 [2024-01-27 15:44:42,051 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 [1] [2024-01-27 15:44:42,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-01-27 15:44:42,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 119 transitions, 807 flow. Second operand has 36 states, 36 states have (on average 7.222222222222222) internal successors, (260), 36 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:42,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:42,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-01-27 15:44:42,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:44,310 INFO L124 PetriNetUnfolderBase]: 2647/4473 cut-off events. [2024-01-27 15:44:44,310 INFO L125 PetriNetUnfolderBase]: For 18308/18308 co-relation queries the response was YES. [2024-01-27 15:44:44,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18724 conditions, 4473 events. 2647/4473 cut-off events. For 18308/18308 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 23980 event pairs, 432 based on Foata normal form. 3/4280 useless extension candidates. Maximal degree in co-relation 18658. Up to 1258 conditions per place. [2024-01-27 15:44:44,337 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 225 selfloop transitions, 105 changer transitions 25/358 dead transitions. [2024-01-27 15:44:44,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 358 transitions, 3217 flow [2024-01-27 15:44:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-01-27 15:44:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-01-27 15:44:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 294 transitions. [2024-01-27 15:44:44,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3828125 [2024-01-27 15:44:44,339 INFO L175 Difference]: Start difference. First operand has 115 places, 119 transitions, 807 flow. Second operand 24 states and 294 transitions. [2024-01-27 15:44:44,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 358 transitions, 3217 flow [2024-01-27 15:44:44,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 358 transitions, 2808 flow, removed 191 selfloop flow, removed 11 redundant places. [2024-01-27 15:44:44,377 INFO L231 Difference]: Finished difference. Result has 132 places, 206 transitions, 1744 flow [2024-01-27 15:44:44,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1744, PETRI_PLACES=132, PETRI_TRANSITIONS=206} [2024-01-27 15:44:44,378 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 101 predicate places. [2024-01-27 15:44:44,378 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 206 transitions, 1744 flow [2024-01-27 15:44:44,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.222222222222222) internal successors, (260), 36 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:44,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:44,379 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:44:44,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 15:44:44,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-01-27 15:44:44,590 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:44:44,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:44,591 INFO L85 PathProgramCache]: Analyzing trace with hash -38365366, now seen corresponding path program 3 times [2024-01-27 15:44:44,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:44,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591309739] [2024-01-27 15:44:44,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:44,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:44:44,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:44,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591309739] [2024-01-27 15:44:44,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591309739] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:44:44,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:44:44,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:44:44,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692125598] [2024-01-27 15:44:44,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:44:44,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:44:44,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:44,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:44:44,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:44:44,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:44:44,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 206 transitions, 1744 flow. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:44,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:44,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:44:44,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:45,245 INFO L124 PetriNetUnfolderBase]: 2789/5176 cut-off events. [2024-01-27 15:44:45,246 INFO L125 PetriNetUnfolderBase]: For 29175/29272 co-relation queries the response was YES. [2024-01-27 15:44:45,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24025 conditions, 5176 events. 2789/5176 cut-off events. For 29175/29272 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 33303 event pairs, 577 based on Foata normal form. 100/4964 useless extension candidates. Maximal degree in co-relation 23964. Up to 2205 conditions per place. [2024-01-27 15:44:45,295 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 245 selfloop transitions, 68 changer transitions 0/324 dead transitions. [2024-01-27 15:44:45,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 324 transitions, 3242 flow [2024-01-27 15:44:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:44:45,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:44:45,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-01-27 15:44:45,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6953125 [2024-01-27 15:44:45,296 INFO L175 Difference]: Start difference. First operand has 132 places, 206 transitions, 1744 flow. Second operand 4 states and 89 transitions. [2024-01-27 15:44:45,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 324 transitions, 3242 flow [2024-01-27 15:44:45,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 324 transitions, 3074 flow, removed 76 selfloop flow, removed 6 redundant places. [2024-01-27 15:44:45,359 INFO L231 Difference]: Finished difference. Result has 129 places, 250 transitions, 2269 flow [2024-01-27 15:44:45,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1577, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2269, PETRI_PLACES=129, PETRI_TRANSITIONS=250} [2024-01-27 15:44:45,360 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 98 predicate places. [2024-01-27 15:44:45,360 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 250 transitions, 2269 flow [2024-01-27 15:44:45,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:45,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:45,360 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:44:45,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 15:44:45,361 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:44:45,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:45,361 INFO L85 PathProgramCache]: Analyzing trace with hash 569577995, now seen corresponding path program 1 times [2024-01-27 15:44:45,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:45,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204467168] [2024-01-27 15:44:45,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:45,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-01-27 15:44:45,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:45,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204467168] [2024-01-27 15:44:45,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204467168] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:44:45,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277793358] [2024-01-27 15:44:45,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:45,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:44:45,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:44:45,458 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:44:45,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-27 15:44:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:45,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:44:45,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:44:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-01-27 15:44:45,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:44:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-01-27 15:44:45,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277793358] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:44:45,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:44:45,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-01-27 15:44:45,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853420325] [2024-01-27 15:44:45,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:44:45,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-01-27 15:44:45,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:45,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-01-27 15:44:45,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-01-27 15:44:45,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:44:45,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 250 transitions, 2269 flow. Second operand has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 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-01-27 15:44:45,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:45,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:44:45,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:46,538 INFO L124 PetriNetUnfolderBase]: 3049/5781 cut-off events. [2024-01-27 15:44:46,538 INFO L125 PetriNetUnfolderBase]: For 32611/32669 co-relation queries the response was YES. [2024-01-27 15:44:46,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27279 conditions, 5781 events. 3049/5781 cut-off events. For 32611/32669 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 38661 event pairs, 495 based on Foata normal form. 65/5533 useless extension candidates. Maximal degree in co-relation 26625. Up to 3421 conditions per place. [2024-01-27 15:44:46,579 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 284 selfloop transitions, 21 changer transitions 82/398 dead transitions. [2024-01-27 15:44:46,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 398 transitions, 4417 flow [2024-01-27 15:44:46,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 15:44:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 15:44:46,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-01-27 15:44:46,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-01-27 15:44:46,580 INFO L175 Difference]: Start difference. First operand has 129 places, 250 transitions, 2269 flow. Second operand 9 states and 136 transitions. [2024-01-27 15:44:46,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 398 transitions, 4417 flow [2024-01-27 15:44:46,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 398 transitions, 4389 flow, removed 14 selfloop flow, removed 0 redundant places. [2024-01-27 15:44:46,654 INFO L231 Difference]: Finished difference. Result has 138 places, 246 transitions, 2259 flow [2024-01-27 15:44:46,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2255, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2259, PETRI_PLACES=138, PETRI_TRANSITIONS=246} [2024-01-27 15:44:46,656 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 107 predicate places. [2024-01-27 15:44:46,656 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 246 transitions, 2259 flow [2024-01-27 15:44:46,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.2) internal successors, (168), 15 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-01-27 15:44:46,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:46,657 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:44:46,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-01-27 15:44:46,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:44:46,868 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:44:46,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:46,869 INFO L85 PathProgramCache]: Analyzing trace with hash 297683419, now seen corresponding path program 2 times [2024-01-27 15:44:46,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:46,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589652754] [2024-01-27 15:44:46,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:46,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-01-27 15:44:47,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:47,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589652754] [2024-01-27 15:44:47,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589652754] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:44:47,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:44:47,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:44:47,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088655646] [2024-01-27 15:44:47,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:44:47,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:44:47,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:47,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:44:47,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:44:47,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:44:47,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 246 transitions, 2259 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:47,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:47,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:44:47,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:47,476 INFO L124 PetriNetUnfolderBase]: 1804/3380 cut-off events. [2024-01-27 15:44:47,488 INFO L125 PetriNetUnfolderBase]: For 20832/20899 co-relation queries the response was YES. [2024-01-27 15:44:47,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16395 conditions, 3380 events. 1804/3380 cut-off events. For 20832/20899 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 19087 event pairs, 361 based on Foata normal form. 23/3202 useless extension candidates. Maximal degree in co-relation 15719. Up to 2841 conditions per place. [2024-01-27 15:44:47,528 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 174 selfloop transitions, 28 changer transitions 0/213 dead transitions. [2024-01-27 15:44:47,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 213 transitions, 2265 flow [2024-01-27 15:44:47,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:44:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:44:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-01-27 15:44:47,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-01-27 15:44:47,540 INFO L175 Difference]: Start difference. First operand has 138 places, 246 transitions, 2259 flow. Second operand 6 states and 88 transitions. [2024-01-27 15:44:47,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 213 transitions, 2265 flow [2024-01-27 15:44:47,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 213 transitions, 2165 flow, removed 16 selfloop flow, removed 9 redundant places. [2024-01-27 15:44:47,587 INFO L231 Difference]: Finished difference. Result has 133 places, 204 transitions, 1817 flow [2024-01-27 15:44:47,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1697, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1817, PETRI_PLACES=133, PETRI_TRANSITIONS=204} [2024-01-27 15:44:47,587 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 102 predicate places. [2024-01-27 15:44:47,587 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 204 transitions, 1817 flow [2024-01-27 15:44:47,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:47,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:47,588 INFO L208 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, 1, 1] [2024-01-27 15:44:47,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 15:44:47,588 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:44:47,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:47,588 INFO L85 PathProgramCache]: Analyzing trace with hash 840272692, now seen corresponding path program 4 times [2024-01-27 15:44:47,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:47,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462430884] [2024-01-27 15:44:47,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:47,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:47,681 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-01-27 15:44:47,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:47,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462430884] [2024-01-27 15:44:47,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462430884] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:44:47,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820860541] [2024-01-27 15:44:47,682 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:44:47,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:44:47,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:44:47,699 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-01-27 15:44:47,733 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-01-27 15:44:47,797 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:44:47,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:44:47,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:44:47,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:44:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-01-27 15:44:47,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:44:47,895 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-01-27 15:44:47,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820860541] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:44:47,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:44:47,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-01-27 15:44:47,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56141940] [2024-01-27 15:44:47,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:44:47,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-27 15:44:47,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:47,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-27 15:44:47,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-01-27 15:44:47,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:44:47,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 204 transitions, 1817 flow. Second operand has 12 states, 12 states have (on average 11.75) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:47,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:47,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:44:47,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:48,216 INFO L124 PetriNetUnfolderBase]: 1079/2214 cut-off events. [2024-01-27 15:44:48,216 INFO L125 PetriNetUnfolderBase]: For 12938/12948 co-relation queries the response was YES. [2024-01-27 15:44:48,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10199 conditions, 2214 events. 1079/2214 cut-off events. For 12938/12948 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 12262 event pairs, 616 based on Foata normal form. 20/2104 useless extension candidates. Maximal degree in co-relation 9536. Up to 1640 conditions per place. [2024-01-27 15:44:48,227 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 90 selfloop transitions, 3 changer transitions 48/149 dead transitions. [2024-01-27 15:44:48,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 149 transitions, 1587 flow [2024-01-27 15:44:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:44:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:44:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-01-27 15:44:48,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2024-01-27 15:44:48,228 INFO L175 Difference]: Start difference. First operand has 133 places, 204 transitions, 1817 flow. Second operand 6 states and 97 transitions. [2024-01-27 15:44:48,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 149 transitions, 1587 flow [2024-01-27 15:44:48,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 149 transitions, 1492 flow, removed 24 selfloop flow, removed 11 redundant places. [2024-01-27 15:44:48,246 INFO L231 Difference]: Finished difference. Result has 117 places, 101 transitions, 835 flow [2024-01-27 15:44:48,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=835, PETRI_PLACES=117, PETRI_TRANSITIONS=101} [2024-01-27 15:44:48,246 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 86 predicate places. [2024-01-27 15:44:48,246 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 101 transitions, 835 flow [2024-01-27 15:44:48,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.75) internal successors, (141), 12 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:44:48,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:48,247 INFO L208 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, 1, 1] [2024-01-27 15:44:48,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-27 15:44:48,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:44:48,458 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:44:48,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:48,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1794450209, now seen corresponding path program 5 times [2024-01-27 15:44:48,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:48,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71873985] [2024-01-27 15:44:48,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:48,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:44:49,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:49,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71873985] [2024-01-27 15:44:49,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71873985] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:44:49,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380753050] [2024-01-27 15:44:49,499 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:44:49,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:44:49,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:44:49,503 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-01-27 15:44:49,505 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-01-27 15:44:49,623 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-01-27 15:44:49,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:44:49,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 38 conjunts are in the unsatisfiable core [2024-01-27 15:44:49,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:44:50,312 INFO L349 Elim1Store]: treesize reduction 38, result has 54.8 percent of original size [2024-01-27 15:44:50,313 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-01-27 15:44:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:44:50,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:44:53,826 INFO L349 Elim1Store]: treesize reduction 20, result has 98.5 percent of original size [2024-01-27 15:44:53,827 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 1412 [2024-01-27 15:47:34,617 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-01-27 15:47:34,619 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-01-27 15:47:34,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-01-27 15:47:34,633 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-01-27 15:47:34,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-01-27 15:47:34,820 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:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:516) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:500) 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:606) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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-01-27 15:47:34,825 INFO L158 Benchmark]: Toolchain (without parser) took 193430.17ms. Allocated memory was 157.3MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 100.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-01-27 15:47:34,825 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 157.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 15:47:34,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.52ms. Allocated memory is still 157.3MB. Free memory was 100.3MB in the beginning and 88.1MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-01-27 15:47:34,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.59ms. Allocated memory is still 157.3MB. Free memory was 88.1MB in the beginning and 85.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 15:47:34,825 INFO L158 Benchmark]: Boogie Preprocessor took 93.50ms. Allocated memory is still 157.3MB. Free memory was 85.6MB in the beginning and 83.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 15:47:34,826 INFO L158 Benchmark]: RCFGBuilder took 619.09ms. Allocated memory is still 157.3MB. Free memory was 82.8MB in the beginning and 104.0MB in the end (delta: -21.1MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2024-01-27 15:47:34,826 INFO L158 Benchmark]: TraceAbstraction took 192414.99ms. Allocated memory was 157.3MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 103.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-01-27 15:47:34,827 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 157.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.52ms. Allocated memory is still 157.3MB. Free memory was 100.3MB in the beginning and 88.1MB in the end (delta: 12.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.59ms. Allocated memory is still 157.3MB. Free memory was 88.1MB in the beginning and 85.6MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.50ms. Allocated memory is still 157.3MB. Free memory was 85.6MB in the beginning and 83.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 619.09ms. Allocated memory is still 157.3MB. Free memory was 82.8MB in the beginning and 104.0MB in the end (delta: -21.1MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. * TraceAbstraction took 192414.99ms. Allocated memory was 157.3MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 103.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.1GB. 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-inc-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 69f7b2e4777088b02df05d348ae0a210dcd9618a97428b10acd3ef63d9199610 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:47:36,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:47:36,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-01-27 15:47:36,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:47:36,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:47:36,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:47:36,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:47:36,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:47:36,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:47:36,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:47:36,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:47:36,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:47:36,964 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:47:36,964 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:47:36,965 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:47:36,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:47:36,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:47:36,966 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:47:36,966 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:47:36,966 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:47:36,966 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:47:36,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:47:36,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:47:36,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-01-27 15:47:36,968 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-01-27 15:47:36,968 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:47:36,968 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-01-27 15:47:36,969 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:47:36,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:47:36,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:47:36,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:47:36,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:47:36,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:47:36,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:47:36,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:47:36,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:47:36,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:47:36,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:47:36,972 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-01-27 15:47:36,972 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-01-27 15:47:36,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:47:36,973 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:47:36,973 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:47:36,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:47:36,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:47:36,974 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-01-27 15:47:36,974 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 -> 69f7b2e4777088b02df05d348ae0a210dcd9618a97428b10acd3ef63d9199610 [2024-01-27 15:47:37,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:47:37,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:47:37,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:47:37,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:47:37,278 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:47:37,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-01-27 15:47:38,405 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:47:38,564 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:47:38,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-01-27 15:47:38,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a01d4038/86ff5002168d40419708b73f9c4f59f8/FLAG4351aeac5 [2024-01-27 15:47:38,581 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a01d4038/86ff5002168d40419708b73f9c4f59f8 [2024-01-27 15:47:38,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:47:38,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:47:38,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:47:38,585 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:47:38,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:47:38,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:47:38" (1/1) ... [2024-01-27 15:47:38,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5634b47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:38, skipping insertion in model container [2024-01-27 15:47:38,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:47:38" (1/1) ... [2024-01-27 15:47:38,613 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:47:38,734 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-inc-subseq.wvr.c[2950,2963] [2024-01-27 15:47:38,741 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:47:38,750 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-01-27 15:47:38,752 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:47:38,761 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-inc-subseq.wvr.c[2950,2963] [2024-01-27 15:47:38,763 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:47:38,767 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:47:38,785 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-inc-subseq.wvr.c[2950,2963] [2024-01-27 15:47:38,787 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:47:38,801 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:47:38,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:38 WrapperNode [2024-01-27 15:47:38,801 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:47:38,802 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:47:38,802 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:47:38,802 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:47:38,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:38" (1/1) ... [2024-01-27 15:47:38,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:38" (1/1) ... [2024-01-27 15:47:38,849 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 194 [2024-01-27 15:47:38,850 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:47:38,851 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:47:38,851 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:47:38,851 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:47:38,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:38" (1/1) ... [2024-01-27 15:47:38,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:38" (1/1) ... [2024-01-27 15:47:38,874 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:38" (1/1) ... [2024-01-27 15:47:38,900 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-01-27 15:47:38,903 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:38" (1/1) ... [2024-01-27 15:47:38,903 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:38" (1/1) ... [2024-01-27 15:47:38,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:38" (1/1) ... [2024-01-27 15:47:38,929 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:38" (1/1) ... [2024-01-27 15:47:38,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:38" (1/1) ... [2024-01-27 15:47:38,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:38" (1/1) ... [2024-01-27 15:47:38,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:47:38,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:47:38,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:47:38,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:47:38,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:38" (1/1) ... [2024-01-27 15:47:38,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:47:38,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:47:38,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-27 15:47:38,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-27 15:47:39,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:47:39,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-01-27 15:47:39,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-01-27 15:47:39,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-01-27 15:47:39,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-01-27 15:47:39,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:47:39,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-01-27 15:47:39,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-01-27 15:47:39,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-01-27 15:47:39,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-01-27 15:47:39,019 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:47:39,019 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:47:39,020 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:47:39,020 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:47:39,020 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:47:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:47:39,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:47:39,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:47:39,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:47:39,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:47:39,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-01-27 15:47:39,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-01-27 15:47:39,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-01-27 15:47:39,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-01-27 15:47:39,025 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:47:39,141 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:47:39,143 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:47:39,390 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:47:39,390 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:47:39,603 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:47:39,604 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-27 15:47:39,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:47:39 BoogieIcfgContainer [2024-01-27 15:47:39,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:47:39,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:47:39,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:47:39,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:47:39,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:47:38" (1/3) ... [2024-01-27 15:47:39,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c15b900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:47:39, skipping insertion in model container [2024-01-27 15:47:39,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:47:38" (2/3) ... [2024-01-27 15:47:39,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c15b900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:47:39, skipping insertion in model container [2024-01-27 15:47:39,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:47:39" (3/3) ... [2024-01-27 15:47:39,612 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2024-01-27 15:47:39,618 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:47:39,625 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:47:39,625 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:47:39,625 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:47:39,667 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 15:47:39,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 78 flow [2024-01-27 15:47:39,730 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2024-01-27 15:47:39,730 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:47:39,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 5/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2024-01-27 15:47:39,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 32 transitions, 78 flow [2024-01-27 15:47:39,738 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 29 transitions, 70 flow [2024-01-27 15:47:39,751 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:47:39,756 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@190b3991, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:47:39,757 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-01-27 15:47:39,771 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:47:39,771 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2024-01-27 15:47:39,771 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:47:39,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:39,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:39,772 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:47:39,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash -552187415, now seen corresponding path program 1 times [2024-01-27 15:47:39,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:39,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627878580] [2024-01-27 15:47:39,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:47:39,788 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-01-27 15:47:39,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:39,820 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-01-27 15:47:39,904 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-01-27 15:47:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:47:39,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2024-01-27 15:47:39,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:47:40,024 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:47:40,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627878580] [2024-01-27 15:47:40,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627878580] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:47:40,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:47:40,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:47:40,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584682989] [2024-01-27 15:47:40,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:47:40,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:47:40,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:40,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:47:40,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:47:40,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:47:40,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 70 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-01-27 15:47:40,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:40,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:47:40,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:40,229 INFO L124 PetriNetUnfolderBase]: 181/339 cut-off events. [2024-01-27 15:47:40,229 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-01-27 15:47:40,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 339 events. 181/339 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1384 event pairs, 59 based on Foata normal form. 1/276 useless extension candidates. Maximal degree in co-relation 578. Up to 149 conditions per place. [2024-01-27 15:47:40,233 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 33 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-01-27 15:47:40,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 178 flow [2024-01-27 15:47:40,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:47:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:47:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-01-27 15:47:40,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-01-27 15:47:40,244 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 70 flow. Second operand 3 states and 62 transitions. [2024-01-27 15:47:40,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 178 flow [2024-01-27 15:47:40,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 43 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 15:47:40,248 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 74 flow [2024-01-27 15:47:40,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2024-01-27 15:47:40,252 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2024-01-27 15:47:40,252 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 74 flow [2024-01-27 15:47:40,252 INFO L496 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-01-27 15:47:40,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:40,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:40,258 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 (2)] Ended with exit code 0 [2024-01-27 15:47:40,455 WARN L477 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-01-27 15:47:40,456 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:47:40,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:40,457 INFO L85 PathProgramCache]: Analyzing trace with hash -889919438, now seen corresponding path program 1 times [2024-01-27 15:47:40,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:40,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057483929] [2024-01-27 15:47:40,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:47:40,459 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-01-27 15:47:40,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:40,461 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-01-27 15:47:40,462 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-01-27 15:47:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:47:40,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-27 15:47:40,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:47:40,670 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:47:40,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:40,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057483929] [2024-01-27 15:47:40,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057483929] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:47:40,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:47:40,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:47:40,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934588759] [2024-01-27 15:47:40,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:47:40,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:47:40,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:40,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:47:40,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:47:40,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-01-27 15:47:40,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:47:40,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:40,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-01-27 15:47:40,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:40,994 INFO L124 PetriNetUnfolderBase]: 336/570 cut-off events. [2024-01-27 15:47:40,994 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-27 15:47:40,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 570 events. 336/570 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2049 event pairs, 97 based on Foata normal form. 14/465 useless extension candidates. Maximal degree in co-relation 754. Up to 323 conditions per place. [2024-01-27 15:47:40,997 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 44 selfloop transitions, 3 changer transitions 22/72 dead transitions. [2024-01-27 15:47:40,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 72 transitions, 302 flow [2024-01-27 15:47:40,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 15:47:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 15:47:40,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2024-01-27 15:47:40,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4732142857142857 [2024-01-27 15:47:40,999 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 74 flow. Second operand 7 states and 106 transitions. [2024-01-27 15:47:40,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 72 transitions, 302 flow [2024-01-27 15:47:40,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 72 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:47:41,000 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 98 flow [2024-01-27 15:47:41,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=98, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-01-27 15:47:41,001 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2024-01-27 15:47:41,001 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 98 flow [2024-01-27 15:47:41,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:47:41,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:41,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:41,023 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-01-27 15:47:41,204 WARN L477 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-01-27 15:47:41,205 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:47:41,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:41,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1798103182, now seen corresponding path program 1 times [2024-01-27 15:47:41,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:41,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235928115] [2024-01-27 15:47:41,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:47:41,206 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-01-27 15:47:41,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:41,207 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-01-27 15:47:41,213 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-01-27 15:47:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:47:41,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-27 15:47:41,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:47:41,361 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:47:41,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:41,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235928115] [2024-01-27 15:47:41,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235928115] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:47:41,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:47:41,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:47:41,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227028025] [2024-01-27 15:47:41,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:47:41,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:47:41,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:41,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:47:41,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:47:41,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:47:41,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:47:41,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:41,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:47:41,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:41,495 INFO L124 PetriNetUnfolderBase]: 183/365 cut-off events. [2024-01-27 15:47:41,495 INFO L125 PetriNetUnfolderBase]: For 178/198 co-relation queries the response was YES. [2024-01-27 15:47:41,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 365 events. 183/365 cut-off events. For 178/198 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1392 event pairs, 130 based on Foata normal form. 4/341 useless extension candidates. Maximal degree in co-relation 661. Up to 289 conditions per place. [2024-01-27 15:47:41,497 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 24 selfloop transitions, 2 changer transitions 11/43 dead transitions. [2024-01-27 15:47:41,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 198 flow [2024-01-27 15:47:41,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:47:41,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:47:41,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2024-01-27 15:47:41,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-01-27 15:47:41,498 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 98 flow. Second operand 4 states and 68 transitions. [2024-01-27 15:47:41,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 198 flow [2024-01-27 15:47:41,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 188 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-01-27 15:47:41,501 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 102 flow [2024-01-27 15:47:41,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2024-01-27 15:47:41,501 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-01-27 15:47:41,502 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 102 flow [2024-01-27 15:47:41,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:47:41,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:41,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:41,507 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-01-27 15:47:41,705 WARN L477 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-01-27 15:47:41,705 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:47:41,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:41,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2060159943, now seen corresponding path program 1 times [2024-01-27 15:47:41,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:41,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032778848] [2024-01-27 15:47:41,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:47:41,706 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-01-27 15:47:41,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:41,708 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-01-27 15:47:41,732 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-01-27 15:47:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:47:41,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:47:41,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:47:41,845 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:47:41,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:41,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032778848] [2024-01-27 15:47:41,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032778848] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:47:41,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:47:41,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:47:41,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257572275] [2024-01-27 15:47:41,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:47:41,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:47:41,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:41,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:47:41,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:47:41,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:47:41,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 102 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:47:41,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:41,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:47:41,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:41,966 INFO L124 PetriNetUnfolderBase]: 221/405 cut-off events. [2024-01-27 15:47:41,966 INFO L125 PetriNetUnfolderBase]: For 100/136 co-relation queries the response was YES. [2024-01-27 15:47:41,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 405 events. 221/405 cut-off events. For 100/136 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1670 event pairs, 35 based on Foata normal form. 2/377 useless extension candidates. Maximal degree in co-relation 966. Up to 296 conditions per place. [2024-01-27 15:47:41,968 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 36 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2024-01-27 15:47:41,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 224 flow [2024-01-27 15:47:41,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:47:41,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:47:41,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2024-01-27 15:47:41,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390625 [2024-01-27 15:47:41,969 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 102 flow. Second operand 4 states and 69 transitions. [2024-01-27 15:47:41,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 224 flow [2024-01-27 15:47:41,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 216 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-01-27 15:47:41,970 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 120 flow [2024-01-27 15:47:41,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2024-01-27 15:47:41,971 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-01-27 15:47:41,971 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 120 flow [2024-01-27 15:47:41,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:47:41,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:41,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:41,986 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-01-27 15:47:42,175 WARN L477 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-01-27 15:47:42,175 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:47:42,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1449551143, now seen corresponding path program 1 times [2024-01-27 15:47:42,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:42,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108786978] [2024-01-27 15:47:42,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:47:42,176 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-01-27 15:47:42,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:42,177 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-01-27 15:47:42,179 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-01-27 15:47:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:47:42,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-27 15:47:42,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:47:42,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:47:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:47:42,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:47:42,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108786978] [2024-01-27 15:47:42,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108786978] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:47:42,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:47:42,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2024-01-27 15:47:42,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822020971] [2024-01-27 15:47:42,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:47:42,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:47:42,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:47:42,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:47:42,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:47:42,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-01-27 15:47:42,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:47:42,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:47:42,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-01-27 15:47:42,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:47:42,570 INFO L124 PetriNetUnfolderBase]: 597/1008 cut-off events. [2024-01-27 15:47:42,570 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2024-01-27 15:47:42,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2466 conditions, 1008 events. 597/1008 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4244 event pairs, 57 based on Foata normal form. 36/983 useless extension candidates. Maximal degree in co-relation 2441. Up to 298 conditions per place. [2024-01-27 15:47:42,575 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 62 selfloop transitions, 15 changer transitions 0/80 dead transitions. [2024-01-27 15:47:42,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 80 transitions, 413 flow [2024-01-27 15:47:42,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 15:47:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 15:47:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-01-27 15:47:42,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2024-01-27 15:47:42,577 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 120 flow. Second operand 7 states and 102 transitions. [2024-01-27 15:47:42,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 80 transitions, 413 flow [2024-01-27 15:47:42,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 80 transitions, 407 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 15:47:42,579 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 210 flow [2024-01-27 15:47:42,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2024-01-27 15:47:42,580 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-01-27 15:47:42,580 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 210 flow [2024-01-27 15:47:42,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:47:42,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:47:42,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:47:42,593 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-01-27 15:47:42,793 WARN L477 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-01-27 15:47:42,794 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:47:42,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:47:42,794 INFO L85 PathProgramCache]: Analyzing trace with hash -2060509935, now seen corresponding path program 2 times [2024-01-27 15:47:42,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:47:42,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624258767] [2024-01-27 15:47:42,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:47:42,795 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-01-27 15:47:42,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:47:42,796 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-01-27 15:47:42,797 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-01-27 15:47:43,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:47:43,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:47:43,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 15:47:43,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:47:43,821 INFO L349 Elim1Store]: treesize reduction 80, result has 76.0 percent of original size [2024-01-27 15:47:43,822 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-01-27 15:47:43,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:47:43,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:47:56,681 WARN L293 SmtUtils]: Spent 8.15s 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-01-27 15:47:56,683 INFO L349 Elim1Store]: treesize reduction 168, result has 90.0 percent of original size [2024-01-27 15:47:56,684 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-01-27 15:48:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:48:24,697 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:48:24,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624258767] [2024-01-27 15:48:24,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624258767] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:48:24,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:48:24,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-01-27 15:48:24,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784979205] [2024-01-27 15:48:24,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:48:24,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-27 15:48:24,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:48:24,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-27 15:48:24,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2024-01-27 15:48:29,587 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-01-27 15:48:33,834 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-01-27 15:48:33,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-01-27 15:48:33,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 210 flow. Second operand has 16 states, 16 states have (on average 9.0) internal successors, (144), 16 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:48:33,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:48:33,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-01-27 15:48:33,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:48:36,529 INFO L124 PetriNetUnfolderBase]: 656/1152 cut-off events. [2024-01-27 15:48:36,529 INFO L125 PetriNetUnfolderBase]: For 972/978 co-relation queries the response was YES. [2024-01-27 15:48:36,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3382 conditions, 1152 events. 656/1152 cut-off events. For 972/978 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5111 event pairs, 62 based on Foata normal form. 7/1093 useless extension candidates. Maximal degree in co-relation 3354. Up to 333 conditions per place. [2024-01-27 15:48:36,538 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 104 selfloop transitions, 11 changer transitions 4/125 dead transitions. [2024-01-27 15:48:36,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 125 transitions, 802 flow [2024-01-27 15:48:36,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 15:48:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 15:48:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-01-27 15:48:36,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-01-27 15:48:36,542 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 210 flow. Second operand 9 states and 136 transitions. [2024-01-27 15:48:36,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 125 transitions, 802 flow [2024-01-27 15:48:36,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 125 transitions, 802 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:48:36,550 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 294 flow [2024-01-27 15:48:36,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=294, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2024-01-27 15:48:36,553 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 30 predicate places. [2024-01-27 15:48:36,553 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 294 flow [2024-01-27 15:48:36,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.0) internal successors, (144), 16 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:48:36,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:48:36,554 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:48:36,562 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-01-27 15:48:36,757 WARN L477 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-01-27 15:48:36,760 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:48:36,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:48:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1538106158, now seen corresponding path program 3 times [2024-01-27 15:48:36,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:48:36,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457337532] [2024-01-27 15:48:36,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:48:36,761 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-01-27 15:48:36,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:48:36,762 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-01-27 15:48:36,763 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-01-27 15:48:36,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-27 15:48:36,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:48:36,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-27 15:48:36,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:48:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:48:37,432 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:48:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:48:38,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:48:38,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457337532] [2024-01-27 15:48:38,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457337532] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:48:38,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:48:38,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-01-27 15:48:38,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17472071] [2024-01-27 15:48:38,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:48:38,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-27 15:48:38,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:48:38,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-27 15:48:38,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-01-27 15:48:38,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:48:38,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 294 flow. Second operand has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:48:38,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:48:38,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:48:38,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:48:39,908 INFO L124 PetriNetUnfolderBase]: 990/1863 cut-off events. [2024-01-27 15:48:39,909 INFO L125 PetriNetUnfolderBase]: For 3257/3379 co-relation queries the response was YES. [2024-01-27 15:48:39,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6155 conditions, 1863 events. 990/1863 cut-off events. For 3257/3379 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 10147 event pairs, 400 based on Foata normal form. 93/1849 useless extension candidates. Maximal degree in co-relation 4715. Up to 915 conditions per place. [2024-01-27 15:48:39,918 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 40 selfloop transitions, 3 changer transitions 77/132 dead transitions. [2024-01-27 15:48:39,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 132 transitions, 953 flow [2024-01-27 15:48:39,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 15:48:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 15:48:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-01-27 15:48:39,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-01-27 15:48:39,920 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 294 flow. Second operand 8 states and 144 transitions. [2024-01-27 15:48:39,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 132 transitions, 953 flow [2024-01-27 15:48:39,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 132 transitions, 945 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-01-27 15:48:39,929 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 316 flow [2024-01-27 15:48:39,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=316, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2024-01-27 15:48:39,930 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 40 predicate places. [2024-01-27 15:48:39,930 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 316 flow [2024-01-27 15:48:39,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:48:39,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:48:39,931 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:48:39,936 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-01-27 15:48:40,136 WARN L477 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-01-27 15:48:40,137 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:48:40,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:48:40,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1181642863, now seen corresponding path program 4 times [2024-01-27 15:48:40,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:48:40,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468630045] [2024-01-27 15:48:40,138 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:48:40,138 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-01-27 15:48:40,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:48:40,140 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-01-27 15:48:40,190 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-01-27 15:48:40,267 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:48:40,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:48:40,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2024-01-27 15:48:40,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:48:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:48:40,972 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:48:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:48:41,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:48:41,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468630045] [2024-01-27 15:48:41,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468630045] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:48:41,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:48:41,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2024-01-27 15:48:41,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224086930] [2024-01-27 15:48:41,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:48:41,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:48:41,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:48:41,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:48:41,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:48:42,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-01-27 15:48:42,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 316 flow. Second operand has 18 states, 18 states have (on average 7.833333333333333) internal successors, (141), 18 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:48:42,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:48:42,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-01-27 15:48:42,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:48:45,454 INFO L124 PetriNetUnfolderBase]: 2314/3979 cut-off events. [2024-01-27 15:48:45,455 INFO L125 PetriNetUnfolderBase]: For 7032/7032 co-relation queries the response was YES. [2024-01-27 15:48:45,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13785 conditions, 3979 events. 2314/3979 cut-off events. For 7032/7032 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 21008 event pairs, 432 based on Foata normal form. 110/3907 useless extension candidates. Maximal degree in co-relation 13748. Up to 915 conditions per place. [2024-01-27 15:48:45,479 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 207 selfloop transitions, 25 changer transitions 48/283 dead transitions. [2024-01-27 15:48:45,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 283 transitions, 2050 flow [2024-01-27 15:48:45,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-27 15:48:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-01-27 15:48:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 288 transitions. [2024-01-27 15:48:45,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2024-01-27 15:48:45,482 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 316 flow. Second operand 19 states and 288 transitions. [2024-01-27 15:48:45,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 283 transitions, 2050 flow [2024-01-27 15:48:45,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 283 transitions, 1984 flow, removed 31 selfloop flow, removed 6 redundant places. [2024-01-27 15:48:45,505 INFO L231 Difference]: Finished difference. Result has 89 places, 77 transitions, 555 flow [2024-01-27 15:48:45,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=555, PETRI_PLACES=89, PETRI_TRANSITIONS=77} [2024-01-27 15:48:45,508 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2024-01-27 15:48:45,508 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 77 transitions, 555 flow [2024-01-27 15:48:45,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 7.833333333333333) internal successors, (141), 18 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:48:45,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:48:45,509 INFO L208 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, 1, 1] [2024-01-27 15:48:45,514 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 (9)] Forceful destruction successful, exit code 0 [2024-01-27 15:48:45,711 WARN L477 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-01-27 15:48:45,712 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:48:45,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:48:45,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1784466025, now seen corresponding path program 5 times [2024-01-27 15:48:45,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:48:45,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743944299] [2024-01-27 15:48:45,713 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:48:45,713 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-01-27 15:48:45,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:48:45,714 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-01-27 15:48:45,718 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-01-27 15:48:45,865 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-01-27 15:48:45,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:48:45,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-27 15:48:45,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:48:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-01-27 15:48:46,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:48:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:48:47,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:48:47,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743944299] [2024-01-27 15:48:47,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743944299] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:48:47,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:48:47,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 16 [2024-01-27 15:48:47,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621523603] [2024-01-27 15:48:47,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:48:47,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-01-27 15:48:47,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:48:47,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-01-27 15:48:47,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-01-27 15:48:47,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-01-27 15:48:47,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 77 transitions, 555 flow. Second operand has 17 states, 17 states have (on average 8.647058823529411) internal successors, (147), 17 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:48:47,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:48:47,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-01-27 15:48:47,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:48:50,936 INFO L124 PetriNetUnfolderBase]: 4800/8311 cut-off events. [2024-01-27 15:48:50,936 INFO L125 PetriNetUnfolderBase]: For 21394/21394 co-relation queries the response was YES. [2024-01-27 15:48:50,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31243 conditions, 8311 events. 4800/8311 cut-off events. For 21394/21394 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 52373 event pairs, 444 based on Foata normal form. 484/8483 useless extension candidates. Maximal degree in co-relation 27122. Up to 2252 conditions per place. [2024-01-27 15:48:50,989 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 259 selfloop transitions, 61 changer transitions 64/387 dead transitions. [2024-01-27 15:48:50,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 387 transitions, 3438 flow [2024-01-27 15:48:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-01-27 15:48:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-01-27 15:48:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 330 transitions. [2024-01-27 15:48:50,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4296875 [2024-01-27 15:48:50,992 INFO L175 Difference]: Start difference. First operand has 89 places, 77 transitions, 555 flow. Second operand 24 states and 330 transitions. [2024-01-27 15:48:50,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 387 transitions, 3438 flow [2024-01-27 15:48:51,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 387 transitions, 3332 flow, removed 51 selfloop flow, removed 5 redundant places. [2024-01-27 15:48:51,074 INFO L231 Difference]: Finished difference. Result has 116 places, 123 transitions, 1143 flow [2024-01-27 15:48:51,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1143, PETRI_PLACES=116, PETRI_TRANSITIONS=123} [2024-01-27 15:48:51,074 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2024-01-27 15:48:51,075 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 123 transitions, 1143 flow [2024-01-27 15:48:51,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.647058823529411) internal successors, (147), 17 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:48:51,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:48:51,075 INFO L208 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, 1, 1] [2024-01-27 15:48:51,084 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-01-27 15:48:51,279 WARN L477 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-01-27 15:48:51,279 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:48:51,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:48:51,280 INFO L85 PathProgramCache]: Analyzing trace with hash 377022539, now seen corresponding path program 6 times [2024-01-27 15:48:51,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:48:51,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823607378] [2024-01-27 15:48:51,280 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:48:51,280 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-01-27 15:48:51,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:48:51,281 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-01-27 15:48:51,314 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-01-27 15:48:51,624 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-01-27 15:48:51,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:48:51,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 23 conjunts are in the unsatisfiable core [2024-01-27 15:48:51,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:48:58,497 INFO L349 Elim1Store]: treesize reduction 268, result has 79.7 percent of original size [2024-01-27 15:48:58,498 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-01-27 15:49:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:49:01,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:50:16,042 WARN L293 SmtUtils]: Spent 20.46s on a formula simplification. DAG size of input: 779 DAG size of output: 513 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-01-27 15:50:16,043 INFO L349 Elim1Store]: treesize reduction 1085, result has 70.2 percent of original size [2024-01-27 15:50:16,044 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 346 treesize of output 2619 Killed by 15