./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-dec-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-dec-subseq.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:43:52,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:43:52,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:43:52,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:43:52,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:43:53,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:43:53,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:43:53,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:43:53,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:43:53,009 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:43:53,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:43:53,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:43:53,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:43:53,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:43:53,011 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:43:53,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:43:53,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:43:53,012 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:43:53,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:43:53,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:43:53,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:43:53,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:43:53,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:43:53,013 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:43:53,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:43:53,014 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:43:53,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:43:53,014 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:43:53,015 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:43:53,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:43:53,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:43:53,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:43:53,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:43:53,016 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:43:53,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:43:53,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:43:53,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:43:53,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:43:53,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:43:53,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:43:53,017 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:43:53,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:43:53,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:43:53,018 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 -> 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b [2024-01-27 15:43:53,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:43:53,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:43:53,259 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:43:53,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:43:53,260 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:43:53,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-01-27 15:43:54,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:43:54,451 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:43:54,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-01-27 15:43:54,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59632c75e/7755f68bef834c4b95732c3b55ca9944/FLAGf81873034 [2024-01-27 15:43:54,466 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59632c75e/7755f68bef834c4b95732c3b55ca9944 [2024-01-27 15:43:54,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:43:54,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:43:54,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:43:54,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:43:54,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:43:54,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:43:54" (1/1) ... [2024-01-27 15:43:54,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58a29189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:54, skipping insertion in model container [2024-01-27 15:43:54,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:43:54" (1/1) ... [2024-01-27 15:43:54,502 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:43:54,610 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-01-27 15:43:54,615 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:43:54,621 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:43:54,635 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-01-27 15:43:54,637 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:43:54,647 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:43:54,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:54 WrapperNode [2024-01-27 15:43:54,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:43:54,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:43:54,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:43:54,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:43:54,653 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:43:54" (1/1) ... [2024-01-27 15:43:54,659 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:43:54" (1/1) ... [2024-01-27 15:43:54,677 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 199 [2024-01-27 15:43:54,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:43:54,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:43:54,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:43:54,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:43:54,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:54" (1/1) ... [2024-01-27 15:43:54,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:54" (1/1) ... [2024-01-27 15:43:54,689 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:54" (1/1) ... [2024-01-27 15:43:54,700 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:43:54,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:54" (1/1) ... [2024-01-27 15:43:54,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:54" (1/1) ... [2024-01-27 15:43:54,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:54" (1/1) ... [2024-01-27 15:43:54,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:54" (1/1) ... [2024-01-27 15:43:54,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:54" (1/1) ... [2024-01-27 15:43:54,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:54" (1/1) ... [2024-01-27 15:43:54,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:43:54,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:43:54,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:43:54,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:43:54,713 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:54" (1/1) ... [2024-01-27 15:43:54,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:43:54,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:43:54,738 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:43:54,752 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:43:54,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:43:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:43:54,783 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:43:54,783 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:43:54,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:43:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:43:54,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:43:54,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:43:54,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:43:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:43:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:43:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:43:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:43:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:43:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:43:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:43:54,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:43:54,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:43:54,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:43:54,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:43:54,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:43:54,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:43:54,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:43:54,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:43:54,788 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:43:54,863 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:43:54,865 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:43:55,092 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:43:55,092 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:43:55,363 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:43:55,363 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-27 15:43:55,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:43:55 BoogieIcfgContainer [2024-01-27 15:43:55,364 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:43:55,366 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:43:55,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:43:55,368 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:43:55,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:43:54" (1/3) ... [2024-01-27 15:43:55,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4421cd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:43:55, skipping insertion in model container [2024-01-27 15:43:55,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:43:54" (2/3) ... [2024-01-27 15:43:55,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4421cd75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:43:55, skipping insertion in model container [2024-01-27 15:43:55,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:43:55" (3/3) ... [2024-01-27 15:43:55,371 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2024-01-27 15:43:55,378 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:43:55,385 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:43:55,386 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:43:55,386 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:43:55,428 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 15:43:55,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 78 flow [2024-01-27 15:43:55,487 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2024-01-27 15:43:55,487 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:43:55,491 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:43:55,491 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 32 transitions, 78 flow [2024-01-27 15:43:55,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 29 transitions, 70 flow [2024-01-27 15:43:55,510 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:43:55,517 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;@15661ba0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:43:55,517 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-01-27 15:43:55,531 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:43:55,531 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2024-01-27 15:43:55,531 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:43:55,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:55,532 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:43:55,532 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:43:55,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:55,537 INFO L85 PathProgramCache]: Analyzing trace with hash 547110899, now seen corresponding path program 1 times [2024-01-27 15:43:55,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:55,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166616220] [2024-01-27 15:43:55,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:55,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:43:55,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:55,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166616220] [2024-01-27 15:43:55,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166616220] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:55,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:43:55,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:43:55,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973100696] [2024-01-27 15:43:55,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:55,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:43:55,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:55,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:43:55,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:43:55,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:43:55,968 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:43:55,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:55,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:43:55,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:56,127 INFO L124 PetriNetUnfolderBase]: 207/354 cut-off events. [2024-01-27 15:43:56,127 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-01-27 15:43:56,129 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:43:56,132 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 32 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2024-01-27 15:43:56,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 167 flow [2024-01-27 15:43:56,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:43:56,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:43:56,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2024-01-27 15:43:56,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-01-27 15:43:56,146 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:43:56,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 167 flow [2024-01-27 15:43:56,150 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:43:56,151 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 76 flow [2024-01-27 15:43:56,153 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:43:56,155 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2024-01-27 15:43:56,155 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 76 flow [2024-01-27 15:43:56,156 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:43:56,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:56,156 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:43:56,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:43:56,156 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:43:56,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:56,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1937993546, now seen corresponding path program 1 times [2024-01-27 15:43:56,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:56,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627347250] [2024-01-27 15:43:56,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:56,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:56,286 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:43:56,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:56,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627347250] [2024-01-27 15:43:56,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627347250] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:56,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:43:56,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:43:56,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746747873] [2024-01-27 15:43:56,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:56,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:43:56,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:56,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:43:56,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:43:56,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:43:56,293 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:43:56,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:56,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:43:56,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:56,383 INFO L124 PetriNetUnfolderBase]: 207/379 cut-off events. [2024-01-27 15:43:56,383 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-27 15:43:56,386 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:43:56,388 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 23 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-01-27 15:43:56,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 128 flow [2024-01-27 15:43:56,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:43:56,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:43:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-01-27 15:43:56,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-01-27 15:43:56,391 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:43:56,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 128 flow [2024-01-27 15:43:56,393 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:43:56,394 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 84 flow [2024-01-27 15:43:56,395 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:43:56,396 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-01-27 15:43:56,397 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 84 flow [2024-01-27 15:43:56,399 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:43:56,399 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:56,399 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:43:56,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:43:56,400 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:43:56,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:56,400 INFO L85 PathProgramCache]: Analyzing trace with hash 855847812, now seen corresponding path program 1 times [2024-01-27 15:43:56,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:56,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126038652] [2024-01-27 15:43:56,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:56,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:56,521 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:43:56,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:56,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126038652] [2024-01-27 15:43:56,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126038652] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:56,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:43:56,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:43:56,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127354286] [2024-01-27 15:43:56,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:56,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:43:56,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:56,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:43:56,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:43:56,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:43:56,524 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:43:56,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:56,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:43:56,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:56,604 INFO L124 PetriNetUnfolderBase]: 263/492 cut-off events. [2024-01-27 15:43:56,604 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-01-27 15:43:56,605 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:43:56,606 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 36 selfloop transitions, 2 changer transitions 2/46 dead transitions. [2024-01-27 15:43:56,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 46 transitions, 202 flow [2024-01-27 15:43:56,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:43:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:43:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-01-27 15:43:56,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-01-27 15:43:56,610 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:43:56,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 46 transitions, 202 flow [2024-01-27 15:43:56,611 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:43:56,612 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 92 flow [2024-01-27 15:43:56,612 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:43:56,614 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2024-01-27 15:43:56,614 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 92 flow [2024-01-27 15:43:56,614 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:43:56,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:56,615 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:43:56,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:43:56,615 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:43:56,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:56,616 INFO L85 PathProgramCache]: Analyzing trace with hash 165802299, now seen corresponding path program 1 times [2024-01-27 15:43:56,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:56,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721255003] [2024-01-27 15:43:56,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:56,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:56,676 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:43:56,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:56,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721255003] [2024-01-27 15:43:56,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721255003] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:56,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:43:56,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:43:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982791319] [2024-01-27 15:43:56,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:56,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:43:56,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:56,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:43:56,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:43:56,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:43:56,687 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:43:56,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:56,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:43:56,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:56,750 INFO L124 PetriNetUnfolderBase]: 257/487 cut-off events. [2024-01-27 15:43:56,750 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-01-27 15:43:56,751 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:43:56,752 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 33 selfloop transitions, 2 changer transitions 5/46 dead transitions. [2024-01-27 15:43:56,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 209 flow [2024-01-27 15:43:56,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:43:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:43:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-01-27 15:43:56,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2024-01-27 15:43:56,753 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:43:56,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 209 flow [2024-01-27 15:43:56,754 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:43:56,755 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 102 flow [2024-01-27 15:43:56,755 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:43:56,756 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2024-01-27 15:43:56,756 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 102 flow [2024-01-27 15:43:56,757 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:43:56,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:56,757 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:43:56,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:43:56,757 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:43:56,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:56,758 INFO L85 PathProgramCache]: Analyzing trace with hash -989663438, now seen corresponding path program 1 times [2024-01-27 15:43:56,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:56,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794646714] [2024-01-27 15:43:56,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:56,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:56,868 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:43:56,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:56,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794646714] [2024-01-27 15:43:56,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794646714] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:43:56,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:43:56,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:43:56,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647111571] [2024-01-27 15:43:56,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:43:56,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:43:56,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:56,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:43:56,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:43:56,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:43:56,872 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:43:56,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:56,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:43:56,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:43:56,971 INFO L124 PetriNetUnfolderBase]: 315/619 cut-off events. [2024-01-27 15:43:56,971 INFO L125 PetriNetUnfolderBase]: For 80/87 co-relation queries the response was YES. [2024-01-27 15:43:56,972 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:43:56,973 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 26 selfloop transitions, 2 changer transitions 18/52 dead transitions. [2024-01-27 15:43:56,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 250 flow [2024-01-27 15:43:56,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:43:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:43:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2024-01-27 15:43:56,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5703125 [2024-01-27 15:43:56,980 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:43:56,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 250 flow [2024-01-27 15:43:56,981 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:43:56,983 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 114 flow [2024-01-27 15:43:56,983 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:43:56,984 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-01-27 15:43:56,985 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 114 flow [2024-01-27 15:43:56,985 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:43:56,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:43:56,986 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:43:56,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:43:56,986 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:43:56,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:43:56,987 INFO L85 PathProgramCache]: Analyzing trace with hash 481046099, now seen corresponding path program 1 times [2024-01-27 15:43:56,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:43:56,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339743997] [2024-01-27 15:43:56,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:56,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:43:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:57,685 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:43:57,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:43:57,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339743997] [2024-01-27 15:43:57,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339743997] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:43:57,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711890938] [2024-01-27 15:43:57,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:43:57,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:43:57,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:43:57,688 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:43:57,717 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:43:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:43:57,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 38 conjunts are in the unsatisfiable core [2024-01-27 15:43:57,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:43:57,845 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:43:57,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:57,852 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:43:57,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:57,858 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:43:57,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:57,862 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:43:57,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:57,868 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:43:57,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-27 15:43:57,875 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:43:57,905 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:43:57,956 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-01-27 15:43:57,957 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:43:57,979 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:43:58,369 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:43:58,413 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:43:58,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:43:59,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:43:59,116 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:43:59,125 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-01-27 15:43:59,125 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:43:59,145 INFO L349 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2024-01-27 15:43:59,146 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:43:59,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:43:59,170 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:43:59,173 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:43:59,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:43:59,180 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:43:59,242 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:43:59,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711890938] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:43:59,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:43:59,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 32 [2024-01-27 15:43:59,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886461272] [2024-01-27 15:43:59,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:43:59,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-01-27 15:43:59,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:43:59,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-01-27 15:43:59,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=840, Unknown=3, NotChecked=0, Total=1056 [2024-01-27 15:43:59,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-01-27 15:43:59,458 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:43:59,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:43:59,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-01-27 15:43:59,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:03,133 INFO L124 PetriNetUnfolderBase]: 1827/3130 cut-off events. [2024-01-27 15:44:03,134 INFO L125 PetriNetUnfolderBase]: For 518/518 co-relation queries the response was YES. [2024-01-27 15:44:03,137 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:03,144 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 238 selfloop transitions, 86 changer transitions 101/428 dead transitions. [2024-01-27 15:44:03,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 428 transitions, 2077 flow [2024-01-27 15:44:03,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-01-27 15:44:03,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2024-01-27 15:44:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 656 transitions. [2024-01-27 15:44:03,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41 [2024-01-27 15:44:03,146 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:03,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 428 transitions, 2077 flow [2024-01-27 15:44:03,149 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:03,152 INFO L231 Difference]: Finished difference. Result has 115 places, 119 transitions, 807 flow [2024-01-27 15:44:03,152 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:03,152 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-01-27 15:44:03,153 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 119 transitions, 807 flow [2024-01-27 15:44:03,153 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:03,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:03,153 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:03,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-01-27 15:44:03,364 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:03,365 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:03,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2074415188, now seen corresponding path program 2 times [2024-01-27 15:44:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:03,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107017730] [2024-01-27 15:44:03,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:03,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:05,223 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:05,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:05,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107017730] [2024-01-27 15:44:05,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107017730] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:44:05,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406426541] [2024-01-27 15:44:05,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:44:05,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:44:05,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:44:05,225 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:05,245 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:05,346 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:44:05,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:44:05,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 30 conjunts are in the unsatisfiable core [2024-01-27 15:44:05,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:44:05,730 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-01-27 15:44:05,730 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:05,776 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:05,776 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:44:10,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:44:10,271 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:10,820 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:10,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406426541] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:44:10,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:44:10,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 33 [2024-01-27 15:44:10,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913470134] [2024-01-27 15:44:10,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:44:10,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-01-27 15:44:10,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:10,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-01-27 15:44:10,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=967, Unknown=1, NotChecked=0, Total=1122 [2024-01-27 15:44:10,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-01-27 15:44:10,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 119 transitions, 807 flow. Second operand has 34 states, 34 states have (on average 7.352941176470588) internal successors, (250), 34 states have internal predecessors, (250), 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:10,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:10,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-01-27 15:44:10,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:12,975 INFO L124 PetriNetUnfolderBase]: 2647/4470 cut-off events. [2024-01-27 15:44:12,975 INFO L125 PetriNetUnfolderBase]: For 18302/18302 co-relation queries the response was YES. [2024-01-27 15:44:12,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18721 conditions, 4470 events. 2647/4470 cut-off events. For 18302/18302 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 23970 event pairs, 441 based on Foata normal form. 3/4275 useless extension candidates. Maximal degree in co-relation 18655. Up to 1258 conditions per place. [2024-01-27 15:44:13,008 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 238 selfloop transitions, 86 changer transitions 25/352 dead transitions. [2024-01-27 15:44:13,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 352 transitions, 3186 flow [2024-01-27 15:44:13,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-27 15:44:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-01-27 15:44:13,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 278 transitions. [2024-01-27 15:44:13,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39488636363636365 [2024-01-27 15:44:13,011 INFO L175 Difference]: Start difference. First operand has 115 places, 119 transitions, 807 flow. Second operand 22 states and 278 transitions. [2024-01-27 15:44:13,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 352 transitions, 3186 flow [2024-01-27 15:44:13,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 352 transitions, 2777 flow, removed 191 selfloop flow, removed 11 redundant places. [2024-01-27 15:44:13,058 INFO L231 Difference]: Finished difference. Result has 127 places, 187 transitions, 1513 flow [2024-01-27 15:44:13,058 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=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1513, PETRI_PLACES=127, PETRI_TRANSITIONS=187} [2024-01-27 15:44:13,060 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 96 predicate places. [2024-01-27 15:44:13,060 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 187 transitions, 1513 flow [2024-01-27 15:44:13,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.352941176470588) internal successors, (250), 34 states have internal predecessors, (250), 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:13,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:13,060 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:13,074 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:13,275 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:13,275 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:13,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash -492064662, now seen corresponding path program 3 times [2024-01-27 15:44:13,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:13,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766731701] [2024-01-27 15:44:13,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:13,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:13,343 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:13,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:13,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766731701] [2024-01-27 15:44:13,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766731701] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:44:13,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:44:13,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:44:13,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658651820] [2024-01-27 15:44:13,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:44:13,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:44:13,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:13,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:44:13,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:44:13,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:44:13,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 187 transitions, 1513 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:13,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:13,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:44:13,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:13,883 INFO L124 PetriNetUnfolderBase]: 2726/5077 cut-off events. [2024-01-27 15:44:13,883 INFO L125 PetriNetUnfolderBase]: For 24509/24608 co-relation queries the response was YES. [2024-01-27 15:44:13,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21814 conditions, 5077 events. 2726/5077 cut-off events. For 24509/24608 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 32677 event pairs, 549 based on Foata normal form. 87/4873 useless extension candidates. Maximal degree in co-relation 21756. Up to 2205 conditions per place. [2024-01-27 15:44:13,925 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 227 selfloop transitions, 68 changer transitions 0/305 dead transitions. [2024-01-27 15:44:13,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 305 transitions, 2951 flow [2024-01-27 15:44:13,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:44:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:44:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-01-27 15:44:13,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6953125 [2024-01-27 15:44:13,927 INFO L175 Difference]: Start difference. First operand has 127 places, 187 transitions, 1513 flow. Second operand 4 states and 89 transitions. [2024-01-27 15:44:13,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 305 transitions, 2951 flow [2024-01-27 15:44:13,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 305 transitions, 2801 flow, removed 67 selfloop flow, removed 6 redundant places. [2024-01-27 15:44:13,978 INFO L231 Difference]: Finished difference. Result has 124 places, 231 transitions, 2056 flow [2024-01-27 15:44:13,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2056, PETRI_PLACES=124, PETRI_TRANSITIONS=231} [2024-01-27 15:44:13,980 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 93 predicate places. [2024-01-27 15:44:13,980 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 231 transitions, 2056 flow [2024-01-27 15:44:13,980 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:13,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:13,981 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:13,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 15:44:13,981 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:13,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:13,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1313814923, now seen corresponding path program 1 times [2024-01-27 15:44:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:13,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006939975] [2024-01-27 15:44:13,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:14,114 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:14,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:14,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006939975] [2024-01-27 15:44:14,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006939975] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:44:14,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664372124] [2024-01-27 15:44:14,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:14,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:44:14,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:44:14,133 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:14,152 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:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:14,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:44:14,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:44:14,301 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:14,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:44:14,360 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:14,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664372124] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:44:14,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:44:14,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-01-27 15:44:14,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413971158] [2024-01-27 15:44:14,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:44:14,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-01-27 15:44:14,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:14,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-01-27 15:44:14,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-01-27 15:44:14,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:44:14,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 231 transitions, 2056 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:14,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:14,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:44:14,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:15,115 INFO L124 PetriNetUnfolderBase]: 2968/5653 cut-off events. [2024-01-27 15:44:15,116 INFO L125 PetriNetUnfolderBase]: For 27227/27315 co-relation queries the response was YES. [2024-01-27 15:44:15,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24875 conditions, 5653 events. 2968/5653 cut-off events. For 27227/27315 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 37658 event pairs, 472 based on Foata normal form. 58/5417 useless extension candidates. Maximal degree in co-relation 24284. Up to 3420 conditions per place. [2024-01-27 15:44:15,212 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 275 selfloop transitions, 21 changer transitions 73/379 dead transitions. [2024-01-27 15:44:15,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 379 transitions, 4104 flow [2024-01-27 15:44:15,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 15:44:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 15:44:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-01-27 15:44:15,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-01-27 15:44:15,213 INFO L175 Difference]: Start difference. First operand has 124 places, 231 transitions, 2056 flow. Second operand 9 states and 136 transitions. [2024-01-27 15:44:15,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 379 transitions, 4104 flow [2024-01-27 15:44:15,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 379 transitions, 4076 flow, removed 14 selfloop flow, removed 0 redundant places. [2024-01-27 15:44:15,293 INFO L231 Difference]: Finished difference. Result has 133 places, 227 transitions, 2046 flow [2024-01-27 15:44:15,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2042, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2046, PETRI_PLACES=133, PETRI_TRANSITIONS=227} [2024-01-27 15:44:15,294 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 102 predicate places. [2024-01-27 15:44:15,294 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 227 transitions, 2046 flow [2024-01-27 15:44:15,295 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:15,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:15,295 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:15,320 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:15,523 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:15,523 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:15,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:15,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1662031995, now seen corresponding path program 2 times [2024-01-27 15:44:15,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:15,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761801151] [2024-01-27 15:44:15,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:15,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:15,780 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:15,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:15,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761801151] [2024-01-27 15:44:15,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761801151] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:44:15,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:44:15,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-27 15:44:15,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253966834] [2024-01-27 15:44:15,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:44:15,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:44:15,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:15,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:44:15,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:44:15,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:44:15,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 227 transitions, 2046 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:15,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:15,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:44:15,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:16,318 INFO L124 PetriNetUnfolderBase]: 1771/3310 cut-off events. [2024-01-27 15:44:16,319 INFO L125 PetriNetUnfolderBase]: For 17252/17289 co-relation queries the response was YES. [2024-01-27 15:44:16,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15026 conditions, 3310 events. 1771/3310 cut-off events. For 17252/17289 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 18621 event pairs, 341 based on Foata normal form. 15/3111 useless extension candidates. Maximal degree in co-relation 14413. Up to 2829 conditions per place. [2024-01-27 15:44:16,340 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 174 selfloop transitions, 22 changer transitions 0/206 dead transitions. [2024-01-27 15:44:16,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 206 transitions, 2157 flow [2024-01-27 15:44:16,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:44:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:44:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2024-01-27 15:44:16,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-01-27 15:44:16,342 INFO L175 Difference]: Start difference. First operand has 133 places, 227 transitions, 2046 flow. Second operand 6 states and 88 transitions. [2024-01-27 15:44:16,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 206 transitions, 2157 flow [2024-01-27 15:44:16,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 206 transitions, 2051 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-01-27 15:44:16,370 INFO L231 Difference]: Finished difference. Result has 129 places, 197 transitions, 1709 flow [2024-01-27 15:44:16,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1709, PETRI_PLACES=129, PETRI_TRANSITIONS=197} [2024-01-27 15:44:16,370 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 98 predicate places. [2024-01-27 15:44:16,370 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 197 transitions, 1709 flow [2024-01-27 15:44:16,371 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:16,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:16,371 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:16,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 15:44:16,371 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:16,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:16,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1216429168, now seen corresponding path program 4 times [2024-01-27 15:44:16,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:16,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804029873] [2024-01-27 15:44:16,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:16,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:16,474 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:16,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:16,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804029873] [2024-01-27 15:44:16,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804029873] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:44:16,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017640415] [2024-01-27 15:44:16,475 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:44:16,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:44:16,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:44:16,476 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:16,504 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:16,580 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:44:16,580 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:44:16,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 15:44:16,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:44:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:44:16,678 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:44:16,853 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:44:16,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017640415] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:44:16,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:44:16,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2024-01-27 15:44:16,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290424167] [2024-01-27 15:44:16,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:44:16,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-27 15:44:16,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:44:16,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-27 15:44:16,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-01-27 15:44:16,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:44:16,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 197 transitions, 1709 flow. Second operand has 16 states, 16 states have (on average 11.9375) internal successors, (191), 16 states have internal predecessors, (191), 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:16,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:44:16,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:44:16,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:44:17,412 INFO L124 PetriNetUnfolderBase]: 1043/2158 cut-off events. [2024-01-27 15:44:17,412 INFO L125 PetriNetUnfolderBase]: For 11178/11185 co-relation queries the response was YES. [2024-01-27 15:44:17,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9500 conditions, 2158 events. 1043/2158 cut-off events. For 11178/11185 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 11916 event pairs, 567 based on Foata normal form. 15/2033 useless extension candidates. Maximal degree in co-relation 8869. Up to 1613 conditions per place. [2024-01-27 15:44:17,423 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 86 selfloop transitions, 3 changer transitions 54/150 dead transitions. [2024-01-27 15:44:17,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 150 transitions, 1540 flow [2024-01-27 15:44:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 15:44:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 15:44:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-01-27 15:44:17,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5133928571428571 [2024-01-27 15:44:17,424 INFO L175 Difference]: Start difference. First operand has 129 places, 197 transitions, 1709 flow. Second operand 7 states and 115 transitions. [2024-01-27 15:44:17,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 150 transitions, 1540 flow [2024-01-27 15:44:17,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 150 transitions, 1401 flow, removed 52 selfloop flow, removed 10 redundant places. [2024-01-27 15:44:17,446 INFO L231 Difference]: Finished difference. Result has 115 places, 96 transitions, 751 flow [2024-01-27 15:44:17,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1010, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=751, PETRI_PLACES=115, PETRI_TRANSITIONS=96} [2024-01-27 15:44:17,446 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 84 predicate places. [2024-01-27 15:44:17,446 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 96 transitions, 751 flow [2024-01-27 15:44:17,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.9375) internal successors, (191), 16 states have internal predecessors, (191), 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:17,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:44:17,447 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:17,459 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:17,658 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:17,659 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:17,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:44:17,660 INFO L85 PathProgramCache]: Analyzing trace with hash -105641823, now seen corresponding path program 5 times [2024-01-27 15:44:17,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:44:17,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866329197] [2024-01-27 15:44:17,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:44:17,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:44:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:44:18,782 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:18,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:44:18,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866329197] [2024-01-27 15:44:18,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866329197] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:44:18,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690007017] [2024-01-27 15:44:18,783 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:44:18,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:44:18,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:44:18,784 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:18,807 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:18,881 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-01-27 15:44:18,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:44:18,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 49 conjunts are in the unsatisfiable core [2024-01-27 15:44:18,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:44:19,986 INFO L349 Elim1Store]: treesize reduction 28, result has 56.9 percent of original size [2024-01-27 15:44:19,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 52 [2024-01-27 15:44:20,066 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:20,066 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:44:22,919 INFO L349 Elim1Store]: treesize reduction 164, result has 86.0 percent of original size [2024-01-27 15:44:22,920 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 1066 [2024-01-27 15:49:05,412 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:09,467 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:10,194 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:10,782 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:10,840 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:19,792 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:22,067 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:22,303 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:23,287 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:30,842 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:31,521 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:31,588 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:32,217 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:33,721 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:40,773 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:40,962 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:41,475 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:42,033 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:51,342 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:51,393 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:51,550 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:51,585 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:52,552 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:53,993 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:54,274 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:54,548 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:54,983 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:55,251 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:55,439 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:56,294 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:56,697 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:56,784 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:56,908 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:57,515 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:57,969 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:58,409 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:49:58,529 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:04,199 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:04,350 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:05,085 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:05,218 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:05,782 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:06,312 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:06,394 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:06,513 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:07,571 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:08,007 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:08,165 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:20,023 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:21,479 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:22,532 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:22,971 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-27 15:50:23,071 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:23,400 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:23,517 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:23,613 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:23,878 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:26,291 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:26,488 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-27 15:50:26,624 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-27 15:50:27,127 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:27,352 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:27,493 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:27,744 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-27 15:50:27,854 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:27,942 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:28,102 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-27 15:50:28,226 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-27 15:50:28,337 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:28,434 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:28,541 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:28,602 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-27 15:50:28,713 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:28,914 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:29,140 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-01-27 15:50:29,317 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:29,422 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:29,617 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:30,379 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:31,384 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:31,467 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:31,640 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:32,145 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:32,330 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-27 15:50:32,537 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:50:32,538 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:50:32,539 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-01-27 15:50:32,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-27 15:50:32,740 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:50:32,741 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.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) ... 78 more [2024-01-27 15:50:32,746 INFO L158 Benchmark]: Toolchain (without parser) took 398277.69ms. Allocated memory was 151.0MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 119.2MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-01-27 15:50:32,746 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 123.7MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 15:50:32,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.80ms. Allocated memory is still 151.0MB. Free memory was 119.2MB in the beginning and 107.2MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-01-27 15:50:32,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.51ms. Allocated memory is still 151.0MB. Free memory was 106.6MB in the beginning and 104.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 15:50:32,746 INFO L158 Benchmark]: Boogie Preprocessor took 33.96ms. Allocated memory is still 151.0MB. Free memory was 104.5MB in the beginning and 101.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 15:50:32,747 INFO L158 Benchmark]: RCFGBuilder took 651.32ms. Allocated memory is still 151.0MB. Free memory was 101.8MB in the beginning and 90.7MB in the end (delta: 11.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-01-27 15:50:32,747 INFO L158 Benchmark]: TraceAbstraction took 397379.50ms. Allocated memory was 151.0MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 90.6MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-01-27 15:50:32,748 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.13ms. Allocated memory is still 123.7MB. Free memory is still 96.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.80ms. Allocated memory is still 151.0MB. Free memory was 119.2MB in the beginning and 107.2MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.51ms. Allocated memory is still 151.0MB. Free memory was 106.6MB in the beginning and 104.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.96ms. Allocated memory is still 151.0MB. Free memory was 104.5MB in the beginning and 101.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 651.32ms. Allocated memory is still 151.0MB. Free memory was 101.8MB in the beginning and 90.7MB in the end (delta: 11.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 397379.50ms. Allocated memory was 151.0MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 90.6MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:50:34,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:50:35,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-01-27 15:50:35,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:50:35,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:50:35,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:50:35,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:50:35,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:50:35,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:50:35,045 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:50:35,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:50:35,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:50:35,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:50:35,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:50:35,047 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:50:35,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:50:35,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:50:35,048 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:50:35,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:50:35,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:50:35,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:50:35,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:50:35,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:50:35,050 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-01-27 15:50:35,050 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-01-27 15:50:35,050 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:50:35,051 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-01-27 15:50:35,051 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:50:35,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:50:35,051 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:50:35,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:50:35,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:50:35,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:50:35,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:50:35,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:50:35,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:50:35,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:50:35,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:50:35,054 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-01-27 15:50:35,054 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-01-27 15:50:35,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:50:35,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:50:35,055 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:50:35,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:50:35,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:50:35,056 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-01-27 15:50:35,056 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 -> 0f0e249de6560bdff430500b6d1ad159bf4a19253ccf183d061fafc41fe4114b [2024-01-27 15:50:35,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:50:35,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:50:35,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:50:35,355 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:50:35,356 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:50:35,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-01-27 15:50:36,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:50:36,639 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:50:36,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2024-01-27 15:50:36,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782d837f8/01d0bd042763456b9390a831d6145c14/FLAG1a20fc091 [2024-01-27 15:50:36,663 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/782d837f8/01d0bd042763456b9390a831d6145c14 [2024-01-27 15:50:36,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:50:36,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:50:36,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:50:36,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:50:36,671 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:50:36,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:50:36" (1/1) ... [2024-01-27 15:50:36,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd8b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:50:36, skipping insertion in model container [2024-01-27 15:50:36,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:50:36" (1/1) ... [2024-01-27 15:50:36,692 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:50:36,856 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-01-27 15:50:36,868 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:50:36,892 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-01-27 15:50:36,899 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:50:36,918 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-01-27 15:50:36,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:50:36,928 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:50:36,958 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2950,2963] [2024-01-27 15:50:36,960 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:50:36,975 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:50:36,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:50:36 WrapperNode [2024-01-27 15:50:36,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:50:36,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:50:36,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:50:36,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:50:36,983 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:50:36" (1/1) ... [2024-01-27 15:50:37,000 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:50:36" (1/1) ... [2024-01-27 15:50:37,025 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 194 [2024-01-27 15:50:37,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:50:37,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:50:37,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:50:37,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:50:37,034 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:50:36" (1/1) ... [2024-01-27 15:50:37,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:50:36" (1/1) ... [2024-01-27 15:50:37,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:50:36" (1/1) ... [2024-01-27 15:50:37,072 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 8, 2, 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, 2, 1, 1]. [2024-01-27 15:50:37,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:50:36" (1/1) ... [2024-01-27 15:50:37,073 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:50:36" (1/1) ... [2024-01-27 15:50:37,079 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:50:36" (1/1) ... [2024-01-27 15:50:37,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:50:36" (1/1) ... [2024-01-27 15:50:37,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:50:36" (1/1) ... [2024-01-27 15:50:37,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:50:36" (1/1) ... [2024-01-27 15:50:37,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:50:37,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:50:37,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:50:37,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:50:37,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:50:36" (1/1) ... [2024-01-27 15:50:37,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:50:37,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:50:37,142 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:50:37,165 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:50:37,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:50:37,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-01-27 15:50:37,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-01-27 15:50:37,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-01-27 15:50:37,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-01-27 15:50:37,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:50:37,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-01-27 15:50:37,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-01-27 15:50:37,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-01-27 15:50:37,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-01-27 15:50:37,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:50:37,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:50:37,189 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:50:37,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:50:37,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:50:37,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:50:37,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:50:37,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:50:37,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:50:37,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:50:37,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-01-27 15:50:37,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-01-27 15:50:37,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-01-27 15:50:37,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-01-27 15:50:37,191 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:50:37,291 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:50:37,293 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:50:37,637 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:50:37,638 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:50:37,912 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:50:37,912 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-27 15:50:37,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:50:37 BoogieIcfgContainer [2024-01-27 15:50:37,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:50:37,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:50:37,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:50:37,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:50:37,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:50:36" (1/3) ... [2024-01-27 15:50:37,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48535643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:50:37, skipping insertion in model container [2024-01-27 15:50:37,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:50:36" (2/3) ... [2024-01-27 15:50:37,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48535643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:50:37, skipping insertion in model container [2024-01-27 15:50:37,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:50:37" (3/3) ... [2024-01-27 15:50:37,918 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2024-01-27 15:50:37,924 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:50:37,937 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:50:37,937 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:50:37,937 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:50:37,962 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 15:50:37,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 78 flow [2024-01-27 15:50:37,997 INFO L124 PetriNetUnfolderBase]: 5/30 cut-off events. [2024-01-27 15:50:37,998 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:50:37,999 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:50:38,000 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 32 transitions, 78 flow [2024-01-27 15:50:38,001 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 29 transitions, 70 flow [2024-01-27 15:50:38,007 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:50:38,011 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;@179339cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:50:38,012 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-01-27 15:50:38,019 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:50:38,019 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2024-01-27 15:50:38,019 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:50:38,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:50:38,020 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:50:38,020 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:50:38,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:50:38,023 INFO L85 PathProgramCache]: Analyzing trace with hash -552187415, now seen corresponding path program 1 times [2024-01-27 15:50:38,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:50:38,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143745096] [2024-01-27 15:50:38,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:50:38,032 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:50:38,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:50:38,034 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:50:38,063 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:50:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:50:38,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2024-01-27 15:50:38,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:50:38,180 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:50:38,180 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:50:38,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:50:38,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143745096] [2024-01-27 15:50:38,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143745096] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:50:38,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:50:38,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:50:38,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716330649] [2024-01-27 15:50:38,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:50:38,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:50:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:50:38,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:50:38,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:50:38,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:50:38,209 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:50:38,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:50:38,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:50:38,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:50:38,324 INFO L124 PetriNetUnfolderBase]: 181/339 cut-off events. [2024-01-27 15:50:38,324 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-01-27 15:50:38,326 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:50:38,328 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 33 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-01-27 15:50:38,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 43 transitions, 178 flow [2024-01-27 15:50:38,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:50:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:50:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2024-01-27 15:50:38,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-01-27 15:50:38,340 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:50:38,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 43 transitions, 178 flow [2024-01-27 15:50:38,343 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:50:38,344 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 74 flow [2024-01-27 15:50:38,345 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:50:38,348 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2024-01-27 15:50:38,348 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 74 flow [2024-01-27 15:50:38,348 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:50:38,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:50:38,348 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:50:38,354 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:50:38,551 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:50:38,552 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:50:38,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:50:38,553 INFO L85 PathProgramCache]: Analyzing trace with hash -889919438, now seen corresponding path program 1 times [2024-01-27 15:50:38,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:50:38,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [566097514] [2024-01-27 15:50:38,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:50:38,554 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:50:38,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:50:38,556 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:50:38,573 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:50:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:50:38,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-27 15:50:38,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:50:38,699 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:50:38,699 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:50:38,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:50:38,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [566097514] [2024-01-27 15:50:38,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [566097514] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:50:38,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:50:38,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:50:38,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586290292] [2024-01-27 15:50:38,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:50:38,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:50:38,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:50:38,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:50:38,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:50:38,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-01-27 15:50:38,707 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:50:38,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:50:38,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-01-27 15:50:38,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:50:38,932 INFO L124 PetriNetUnfolderBase]: 336/570 cut-off events. [2024-01-27 15:50:38,932 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-01-27 15:50:38,933 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:50:38,935 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 44 selfloop transitions, 3 changer transitions 22/72 dead transitions. [2024-01-27 15:50:38,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 72 transitions, 302 flow [2024-01-27 15:50:38,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 15:50:38,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 15:50:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2024-01-27 15:50:38,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4732142857142857 [2024-01-27 15:50:38,937 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:50:38,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 72 transitions, 302 flow [2024-01-27 15:50:38,937 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:50:38,938 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 98 flow [2024-01-27 15:50:38,938 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:50:38,939 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2024-01-27 15:50:38,939 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 98 flow [2024-01-27 15:50:38,939 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:50:38,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:50:38,940 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:50:38,954 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 (3)] Ended with exit code 0 [2024-01-27 15:50:39,142 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:50:39,143 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:50:39,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:50:39,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1798103182, now seen corresponding path program 1 times [2024-01-27 15:50:39,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:50:39,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997683149] [2024-01-27 15:50:39,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:50:39,144 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:50:39,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:50:39,145 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:50:39,147 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:50:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:50:39,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjunts are in the unsatisfiable core [2024-01-27 15:50:39,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:50:39,325 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:50:39,326 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:50:39,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:50:39,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997683149] [2024-01-27 15:50:39,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997683149] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:50:39,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:50:39,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:50:39,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87735329] [2024-01-27 15:50:39,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:50:39,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:50:39,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:50:39,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:50:39,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:50:39,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:50:39,328 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:50:39,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:50:39,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:50:39,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:50:39,465 INFO L124 PetriNetUnfolderBase]: 183/365 cut-off events. [2024-01-27 15:50:39,466 INFO L125 PetriNetUnfolderBase]: For 178/198 co-relation queries the response was YES. [2024-01-27 15:50:39,467 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:50:39,469 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 24 selfloop transitions, 2 changer transitions 11/43 dead transitions. [2024-01-27 15:50:39,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 198 flow [2024-01-27 15:50:39,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:50:39,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:50:39,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2024-01-27 15:50:39,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-01-27 15:50:39,471 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:50:39,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 198 flow [2024-01-27 15:50:39,474 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:50:39,475 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 102 flow [2024-01-27 15:50:39,475 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:50:39,476 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-01-27 15:50:39,476 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 102 flow [2024-01-27 15:50:39,476 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:50:39,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:50:39,478 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:50:39,481 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:50:39,680 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:50:39,682 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:50:39,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:50:39,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2060159943, now seen corresponding path program 1 times [2024-01-27 15:50:39,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:50:39,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450628453] [2024-01-27 15:50:39,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:50:39,683 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:50:39,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:50:39,685 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:50:39,739 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:50:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:50:39,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:50:39,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:50:39,857 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:50:39,857 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:50:39,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:50:39,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450628453] [2024-01-27 15:50:39,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450628453] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:50:39,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:50:39,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:50:39,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310702823] [2024-01-27 15:50:39,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:50:39,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:50:39,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:50:39,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:50:39,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:50:39,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:50:39,865 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:50:39,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:50:39,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:50:39,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:50:39,981 INFO L124 PetriNetUnfolderBase]: 221/405 cut-off events. [2024-01-27 15:50:39,981 INFO L125 PetriNetUnfolderBase]: For 100/136 co-relation queries the response was YES. [2024-01-27 15:50:39,982 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:50:39,983 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 36 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2024-01-27 15:50:39,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 224 flow [2024-01-27 15:50:39,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:50:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:50:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2024-01-27 15:50:39,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5390625 [2024-01-27 15:50:39,984 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:50:39,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 224 flow [2024-01-27 15:50:39,985 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:50:39,986 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 120 flow [2024-01-27 15:50:39,986 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:50:39,986 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2024-01-27 15:50:39,986 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 120 flow [2024-01-27 15:50:39,986 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:50:39,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:50:39,987 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:50:39,992 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 (5)] Ended with exit code 0 [2024-01-27 15:50:40,189 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:50:40,190 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:50:40,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:50:40,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1449551143, now seen corresponding path program 1 times [2024-01-27 15:50:40,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:50:40,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327549540] [2024-01-27 15:50:40,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:50:40,191 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:50:40,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:50:40,192 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:50:40,195 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:50:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:50:40,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-27 15:50:40,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:50:40,364 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:50:40,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:50:40,391 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:50:40,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:50:40,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327549540] [2024-01-27 15:50:40,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327549540] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:50:40,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:50:40,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2024-01-27 15:50:40,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097336069] [2024-01-27 15:50:40,392 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:50:40,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:50:40,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:50:40,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:50:40,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:50:40,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-01-27 15:50:40,395 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:50:40,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:50:40,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-01-27 15:50:40,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:50:40,638 INFO L124 PetriNetUnfolderBase]: 597/1008 cut-off events. [2024-01-27 15:50:40,638 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2024-01-27 15:50:40,639 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:50:40,642 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 62 selfloop transitions, 15 changer transitions 0/80 dead transitions. [2024-01-27 15:50:40,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 80 transitions, 413 flow [2024-01-27 15:50:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 15:50:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 15:50:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2024-01-27 15:50:40,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45535714285714285 [2024-01-27 15:50:40,644 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:50:40,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 80 transitions, 413 flow [2024-01-27 15:50:40,645 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:50:40,646 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 210 flow [2024-01-27 15:50:40,646 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:50:40,646 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-01-27 15:50:40,646 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 210 flow [2024-01-27 15:50:40,646 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:50:40,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:50:40,647 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:50:40,662 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 (6)] Ended with exit code 0 [2024-01-27 15:50:40,850 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:50:40,850 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:50:40,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:50:40,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2060509935, now seen corresponding path program 2 times [2024-01-27 15:50:40,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:50:40,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017157284] [2024-01-27 15:50:40,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:50:40,852 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:50:40,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:50:40,854 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:50:40,859 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:50:40,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:50:40,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:50:41,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 15:50:41,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:50:41,745 INFO L349 Elim1Store]: treesize reduction 80, result has 76.0 percent of original size [2024-01-27 15:50:41,746 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:50:41,895 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:50:41,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:50:51,905 WARN L293 SmtUtils]: Spent 5.48s 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:50:51,906 INFO L349 Elim1Store]: treesize reduction 168, result has 90.0 percent of original size [2024-01-27 15:50:51,906 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:50:55,073 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:50:55,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:50:55,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017157284] [2024-01-27 15:50:55,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017157284] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:50:55,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:50:55,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-01-27 15:50:55,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526937259] [2024-01-27 15:50:55,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:50:55,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-27 15:50:55,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:50:55,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-27 15:50:55,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2024-01-27 15:50:59,199 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:51:03,476 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:51:03,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2024-01-27 15:51:03,476 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:51:03,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:51:03,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2024-01-27 15:51:03,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:51:06,177 INFO L124 PetriNetUnfolderBase]: 656/1152 cut-off events. [2024-01-27 15:51:06,178 INFO L125 PetriNetUnfolderBase]: For 972/978 co-relation queries the response was YES. [2024-01-27 15:51:06,184 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:51:06,187 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 104 selfloop transitions, 11 changer transitions 4/125 dead transitions. [2024-01-27 15:51:06,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 125 transitions, 802 flow [2024-01-27 15:51:06,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 15:51:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 15:51:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-01-27 15:51:06,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-01-27 15:51:06,191 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:51:06,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 125 transitions, 802 flow [2024-01-27 15:51:06,198 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:51:06,200 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 294 flow [2024-01-27 15:51:06,200 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:51:06,203 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 30 predicate places. [2024-01-27 15:51:06,203 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 294 flow [2024-01-27 15:51:06,204 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:51:06,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:51:06,204 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:51:06,210 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 (7)] Forceful destruction successful, exit code 0 [2024-01-27 15:51:06,407 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:51:06,407 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:51:06,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:51:06,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1538106158, now seen corresponding path program 3 times [2024-01-27 15:51:06,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:51:06,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432400994] [2024-01-27 15:51:06,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:51:06,409 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:51:06,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:51:06,410 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:51:06,414 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:51:06,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-27 15:51:06,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:51:06,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-27 15:51:06,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:51:07,042 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:51:07,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:51:07,684 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:51:07,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:51:07,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432400994] [2024-01-27 15:51:07,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432400994] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:51:07,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:51:07,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-01-27 15:51:07,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624674797] [2024-01-27 15:51:07,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:51:07,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-27 15:51:07,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:51:07,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-27 15:51:07,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-01-27 15:51:07,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2024-01-27 15:51:07,860 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:51:07,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:51:07,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2024-01-27 15:51:07,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:51:09,094 INFO L124 PetriNetUnfolderBase]: 990/1863 cut-off events. [2024-01-27 15:51:09,094 INFO L125 PetriNetUnfolderBase]: For 3257/3379 co-relation queries the response was YES. [2024-01-27 15:51:09,098 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:51:09,105 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 40 selfloop transitions, 3 changer transitions 77/132 dead transitions. [2024-01-27 15:51:09,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 132 transitions, 953 flow [2024-01-27 15:51:09,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 15:51:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 15:51:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-01-27 15:51:09,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625 [2024-01-27 15:51:09,108 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:51:09,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 132 transitions, 953 flow [2024-01-27 15:51:09,114 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:51:09,117 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 316 flow [2024-01-27 15:51:09,117 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:51:09,117 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 40 predicate places. [2024-01-27 15:51:09,118 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 316 flow [2024-01-27 15:51:09,118 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:51:09,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:51:09,118 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:51:09,139 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 (8)] Ended with exit code 0 [2024-01-27 15:51:09,322 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:51:09,322 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:51:09,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:51:09,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1181642863, now seen corresponding path program 4 times [2024-01-27 15:51:09,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:51:09,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589812526] [2024-01-27 15:51:09,325 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:51:09,327 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:51:09,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:51:09,328 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:51:09,359 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:51:09,442 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:51:09,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:51:09,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2024-01-27 15:51:09,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:51:10,025 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:51:10,025 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:51:10,672 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:51:10,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:51:10,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589812526] [2024-01-27 15:51:10,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589812526] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:51:10,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:51:10,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2024-01-27 15:51:10,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633294558] [2024-01-27 15:51:10,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:51:10,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:51:10,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:51:10,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:51:10,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:51:10,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-01-27 15:51:10,846 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:51:10,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:51:10,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-01-27 15:51:10,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:51:13,586 INFO L124 PetriNetUnfolderBase]: 2314/3979 cut-off events. [2024-01-27 15:51:13,587 INFO L125 PetriNetUnfolderBase]: For 7032/7032 co-relation queries the response was YES. [2024-01-27 15:51:13,594 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:51:13,606 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 207 selfloop transitions, 25 changer transitions 48/283 dead transitions. [2024-01-27 15:51:13,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 283 transitions, 2050 flow [2024-01-27 15:51:13,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-01-27 15:51:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-01-27 15:51:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 288 transitions. [2024-01-27 15:51:13,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2024-01-27 15:51:13,609 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:51:13,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 283 transitions, 2050 flow [2024-01-27 15:51:13,626 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:51:13,628 INFO L231 Difference]: Finished difference. Result has 89 places, 77 transitions, 555 flow [2024-01-27 15:51:13,629 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:51:13,629 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 58 predicate places. [2024-01-27 15:51:13,630 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 77 transitions, 555 flow [2024-01-27 15:51:13,630 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:51:13,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:51:13,630 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:51:13,636 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:51:13,834 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:51:13,834 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:51:13,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:51:13,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1784466025, now seen corresponding path program 5 times [2024-01-27 15:51:13,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:51:13,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471838702] [2024-01-27 15:51:13,835 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:51:13,835 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:51:13,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:51:13,836 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:51:13,856 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:51:14,002 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-01-27 15:51:14,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:51:14,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-27 15:51:14,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:51:14,271 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:51:14,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:51:15,232 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:51:15,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:51:15,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471838702] [2024-01-27 15:51:15,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1471838702] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:51:15,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:51:15,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 16 [2024-01-27 15:51:15,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146939889] [2024-01-27 15:51:15,232 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:51:15,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-01-27 15:51:15,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:51:15,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-01-27 15:51:15,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-01-27 15:51:15,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2024-01-27 15:51:15,251 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:51:15,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:51:15,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2024-01-27 15:51:15,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:51:18,368 INFO L124 PetriNetUnfolderBase]: 4800/8311 cut-off events. [2024-01-27 15:51:18,368 INFO L125 PetriNetUnfolderBase]: For 21394/21394 co-relation queries the response was YES. [2024-01-27 15:51:18,388 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:51:18,411 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 259 selfloop transitions, 61 changer transitions 64/387 dead transitions. [2024-01-27 15:51:18,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 387 transitions, 3438 flow [2024-01-27 15:51:18,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-01-27 15:51:18,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-01-27 15:51:18,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 330 transitions. [2024-01-27 15:51:18,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4296875 [2024-01-27 15:51:18,414 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:51:18,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 387 transitions, 3438 flow [2024-01-27 15:51:18,542 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:51:18,546 INFO L231 Difference]: Finished difference. Result has 116 places, 123 transitions, 1143 flow [2024-01-27 15:51:18,546 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:51:18,547 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 85 predicate places. [2024-01-27 15:51:18,547 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 123 transitions, 1143 flow [2024-01-27 15:51:18,547 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:51:18,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:51:18,548 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:51:18,556 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 (10)] Forceful destruction successful, exit code 0 [2024-01-27 15:51:18,751 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:51:18,752 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:51:18,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:51:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash 377022539, now seen corresponding path program 6 times [2024-01-27 15:51:18,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:51:18,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710613261] [2024-01-27 15:51:18,753 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:51:18,753 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:51:18,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:51:18,755 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:51:18,756 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:51:19,030 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-01-27 15:51:19,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:51:19,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 36 conjunts are in the unsatisfiable core [2024-01-27 15:51:19,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:51:27,164 INFO L349 Elim1Store]: treesize reduction 1280, result has 45.3 percent of original size [2024-01-27 15:51:27,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 6 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 300 treesize of output 1124 [2024-01-27 15:51:30,246 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:51:30,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:53:25,263 WARN L293 SmtUtils]: Spent 42.00s on a formula simplification. DAG size of input: 848 DAG size of output: 394 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-01-27 15:53:25,263 INFO L349 Elim1Store]: treesize reduction 2100, result has 45.4 percent of original size [2024-01-27 15:53:25,264 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 345 treesize of output 1812 Killed by 15