./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-5.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 b2b2bb654bf56c4e17e833d277e8505998c0901a0fe529242a0e0db923034741 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 12:50:55,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 12:50:55,879 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 12:50:55,883 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 12:50:55,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 12:50:55,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 12:50:55,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 12:50:55,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 12:50:55,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 12:50:55,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 12:50:55,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 12:50:55,904 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 12:50:55,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 12:50:55,905 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 12:50:55,905 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 12:50:55,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 12:50:55,906 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 12:50:55,906 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 12:50:55,907 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 12:50:55,907 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 12:50:55,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 12:50:55,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 12:50:55,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 12:50:55,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 12:50:55,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 12:50:55,915 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 12:50:55,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 12:50:55,916 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 12:50:55,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 12:50:55,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 12:50:55,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 12:50:55,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 12:50:55,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:50:55,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 12:50:55,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 12:50:55,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 12:50:55,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 12:50:55,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 12:50:55,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 12:50:55,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 12:50:55,920 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 12:50:55,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 12:50:55,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 12:50:55,921 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 -> b2b2bb654bf56c4e17e833d277e8505998c0901a0fe529242a0e0db923034741 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 12:50:56,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 12:50:56,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 12:50:56,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 12:50:56,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 12:50:56,218 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 12:50:56,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2024-02-20 12:50:57,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 12:50:57,551 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 12:50:57,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2024-02-20 12:50:57,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/071304e34/e359b60bd7ea40088c4b0182a0519c7f/FLAG09abde4ce [2024-02-20 12:50:57,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/071304e34/e359b60bd7ea40088c4b0182a0519c7f [2024-02-20 12:50:57,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 12:50:57,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 12:50:57,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 12:50:57,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 12:50:57,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 12:50:57,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:50:57" (1/1) ... [2024-02-20 12:50:57,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3013a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:50:57, skipping insertion in model container [2024-02-20 12:50:57,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:50:57" (1/1) ... [2024-02-20 12:50:57,604 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 12:50:57,822 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/unroll-cond-5.wvr.c[2975,2988] [2024-02-20 12:50:57,836 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:50:57,846 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 12:50:57,886 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/unroll-cond-5.wvr.c[2975,2988] [2024-02-20 12:50:57,891 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:50:57,918 INFO L206 MainTranslator]: Completed translation [2024-02-20 12:50:57,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:50:57 WrapperNode [2024-02-20 12:50:57,919 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 12:50:57,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 12:50:57,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 12:50:57,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 12:50:57,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:50:57" (1/1) ... [2024-02-20 12:50:57,945 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:50:57" (1/1) ... [2024-02-20 12:50:57,970 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 207 [2024-02-20 12:50:57,970 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 12:50:57,971 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 12:50:57,971 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 12:50:57,972 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 12:50:57,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:50:57" (1/1) ... [2024-02-20 12:50:57,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:50:57" (1/1) ... [2024-02-20 12:50:57,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:50:57" (1/1) ... [2024-02-20 12:50:57,999 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 11, 2, 2]. 65 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-20 12:50:58,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:50:57" (1/1) ... [2024-02-20 12:50:58,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:50:57" (1/1) ... [2024-02-20 12:50:58,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:50:57" (1/1) ... [2024-02-20 12:50:58,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:50:57" (1/1) ... [2024-02-20 12:50:58,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:50:57" (1/1) ... [2024-02-20 12:50:58,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:50:57" (1/1) ... [2024-02-20 12:50:58,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 12:50:58,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 12:50:58,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 12:50:58,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 12:50:58,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:50:57" (1/1) ... [2024-02-20 12:50:58,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:50:58,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:50:58,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-20 12:50:58,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-20 12:50:58,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 12:50:58,187 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 12:50:58,187 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 12:50:58,188 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 12:50:58,189 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 12:50:58,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 12:50:58,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 12:50:58,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 12:50:58,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-20 12:50:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 12:50:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 12:50:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 12:50:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 12:50:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-20 12:50:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-20 12:50:58,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 12:50:58,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 12:50:58,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 12:50:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 12:50:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 12:50:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-20 12:50:58,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 12:50:58,206 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 12:50:58,357 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 12:50:58,359 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 12:50:58,647 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 12:50:58,648 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 12:50:58,871 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 12:50:58,872 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-02-20 12:50:58,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:50:58 BoogieIcfgContainer [2024-02-20 12:50:58,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 12:50:58,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 12:50:58,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 12:50:58,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 12:50:58,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 12:50:57" (1/3) ... [2024-02-20 12:50:58,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478a9581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:50:58, skipping insertion in model container [2024-02-20 12:50:58,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:50:57" (2/3) ... [2024-02-20 12:50:58,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@478a9581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:50:58, skipping insertion in model container [2024-02-20 12:50:58,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:50:58" (3/3) ... [2024-02-20 12:50:58,879 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2024-02-20 12:50:58,896 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 12:50:58,896 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 12:50:58,896 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 12:50:58,944 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-20 12:50:58,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 56 flow [2024-02-20 12:50:58,996 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2024-02-20 12:50:58,997 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 12:50:58,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 3/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2024-02-20 12:50:58,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 21 transitions, 56 flow [2024-02-20 12:50:59,002 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 18 transitions, 48 flow [2024-02-20 12:50:59,010 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 12:50:59,016 INFO L369 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1547d0f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 12:50:59,017 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-20 12:50:59,026 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 12:50:59,026 INFO L124 PetriNetUnfolderBase]: 3/17 cut-off events. [2024-02-20 12:50:59,026 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 12:50:59,027 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:50:59,027 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:50:59,028 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:50:59,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:50:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash 109122563, now seen corresponding path program 1 times [2024-02-20 12:50:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:50:59,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657563688] [2024-02-20 12:50:59,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:50:59,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:50:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:50:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:50:59,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:50:59,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657563688] [2024-02-20 12:50:59,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657563688] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:50:59,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:50:59,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 12:50:59,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740153954] [2024-02-20 12:50:59,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:50:59,435 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 12:50:59,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:50:59,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 12:50:59,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 12:50:59,470 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 21 [2024-02-20 12:50:59,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 18 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:50:59,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:50:59,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 21 [2024-02-20 12:50:59,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:50:59,548 INFO L124 PetriNetUnfolderBase]: 49/85 cut-off events. [2024-02-20 12:50:59,548 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-02-20 12:50:59,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 85 events. 49/85 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 19 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 129. Up to 81 conditions per place. [2024-02-20 12:50:59,551 INFO L140 encePairwiseOnDemand]: 18/21 looper letters, 14 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2024-02-20 12:50:59,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 19 transitions, 82 flow [2024-02-20 12:50:59,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 12:50:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 12:50:59,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2024-02-20 12:50:59,561 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-02-20 12:50:59,564 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 2 predicate places. [2024-02-20 12:50:59,564 INFO L507 AbstractCegarLoop]: Abstraction has has 24 places, 19 transitions, 82 flow [2024-02-20 12:50:59,564 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:50:59,565 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:50:59,565 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:50:59,565 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 12:50:59,565 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:50:59,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:50:59,566 INFO L85 PathProgramCache]: Analyzing trace with hash -154727438, now seen corresponding path program 1 times [2024-02-20 12:50:59,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:50:59,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601349472] [2024-02-20 12:50:59,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:50:59,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:50:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:50:59,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:50:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:50:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601349472] [2024-02-20 12:50:59,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601349472] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:50:59,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:50:59,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:50:59,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335397999] [2024-02-20 12:50:59,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:50:59,772 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:50:59,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:50:59,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:50:59,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:50:59,774 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-20 12:50:59,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 19 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:50:59,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:50:59,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-20 12:50:59,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:51:01,292 INFO L124 PetriNetUnfolderBase]: 72/137 cut-off events. [2024-02-20 12:51:01,292 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-02-20 12:51:01,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 137 events. 72/137 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 366 event pairs, 24 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 286. Up to 113 conditions per place. [2024-02-20 12:51:01,294 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 35 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2024-02-20 12:51:01,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 41 transitions, 261 flow [2024-02-20 12:51:01,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:51:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:51:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2024-02-20 12:51:01,297 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-02-20 12:51:01,298 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 6 predicate places. [2024-02-20 12:51:01,298 INFO L507 AbstractCegarLoop]: Abstraction has has 28 places, 41 transitions, 261 flow [2024-02-20 12:51:01,298 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:51:01,299 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:51:01,299 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:51:01,299 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 12:51:01,299 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:51:01,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:51:01,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1771301964, now seen corresponding path program 2 times [2024-02-20 12:51:01,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:51:01,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14268733] [2024-02-20 12:51:01,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:51:01,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:51:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:51:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:51:01,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:51:01,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14268733] [2024-02-20 12:51:01,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14268733] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:51:01,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:51:01,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:51:01,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590243396] [2024-02-20 12:51:01,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:51:01,500 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:51:01,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:51:01,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:51:01,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:51:01,503 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-20 12:51:01,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 41 transitions, 261 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:51:01,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:51:01,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-20 12:51:01,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:51:03,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 12:51:03,668 INFO L124 PetriNetUnfolderBase]: 111/212 cut-off events. [2024-02-20 12:51:03,668 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-02-20 12:51:03,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 212 events. 111/212 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 687 event pairs, 24 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 592. Up to 182 conditions per place. [2024-02-20 12:51:03,671 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 64 selfloop transitions, 12 changer transitions 0/77 dead transitions. [2024-02-20 12:51:03,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 77 transitions, 643 flow [2024-02-20 12:51:03,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:51:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:51:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2024-02-20 12:51:03,673 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-02-20 12:51:03,674 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 10 predicate places. [2024-02-20 12:51:03,674 INFO L507 AbstractCegarLoop]: Abstraction has has 32 places, 77 transitions, 643 flow [2024-02-20 12:51:03,674 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:51:03,674 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:51:03,674 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:51:03,675 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 12:51:03,675 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:51:03,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:51:03,676 INFO L85 PathProgramCache]: Analyzing trace with hash 410935150, now seen corresponding path program 3 times [2024-02-20 12:51:03,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:51:03,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695181153] [2024-02-20 12:51:03,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:51:03,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:51:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:51:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:51:03,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:51:03,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695181153] [2024-02-20 12:51:03,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695181153] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:51:03,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:51:03,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:51:03,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087466345] [2024-02-20 12:51:03,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:51:03,837 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:51:03,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:51:03,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:51:03,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:51:03,841 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-20 12:51:03,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 77 transitions, 643 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:51:03,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:51:03,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-20 12:51:03,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:51:07,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 12:51:10,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 12:51:10,721 INFO L124 PetriNetUnfolderBase]: 125/241 cut-off events. [2024-02-20 12:51:10,721 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-02-20 12:51:10,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 241 events. 125/241 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 848 event pairs, 24 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 833. Up to 210 conditions per place. [2024-02-20 12:51:10,726 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 77 selfloop transitions, 16 changer transitions 0/94 dead transitions. [2024-02-20 12:51:10,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 94 transitions, 974 flow [2024-02-20 12:51:10,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:51:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:51:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2024-02-20 12:51:10,728 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5523809523809524 [2024-02-20 12:51:10,731 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 14 predicate places. [2024-02-20 12:51:10,731 INFO L507 AbstractCegarLoop]: Abstraction has has 36 places, 94 transitions, 974 flow [2024-02-20 12:51:10,731 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:51:10,732 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:51:10,732 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:51:10,732 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 12:51:10,732 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:51:10,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:51:10,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1149517430, now seen corresponding path program 4 times [2024-02-20 12:51:10,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:51:10,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741992347] [2024-02-20 12:51:10,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:51:10,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:51:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:51:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:51:10,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:51:10,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741992347] [2024-02-20 12:51:10,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741992347] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:51:10,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:51:10,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:51:10,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888578581] [2024-02-20 12:51:10,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:51:10,872 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:51:10,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:51:10,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:51:10,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:51:10,875 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-20 12:51:10,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 94 transitions, 974 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:51:10,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:51:10,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-20 12:51:10,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:51:11,847 INFO L124 PetriNetUnfolderBase]: 122/231 cut-off events. [2024-02-20 12:51:11,848 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-02-20 12:51:11,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 231 events. 122/231 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 785 event pairs, 24 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 984. Up to 201 conditions per place. [2024-02-20 12:51:11,850 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 71 selfloop transitions, 16 changer transitions 0/88 dead transitions. [2024-02-20 12:51:11,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 88 transitions, 1082 flow [2024-02-20 12:51:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:51:11,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:51:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2024-02-20 12:51:11,851 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-02-20 12:51:11,851 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 18 predicate places. [2024-02-20 12:51:11,852 INFO L507 AbstractCegarLoop]: Abstraction has has 40 places, 88 transitions, 1082 flow [2024-02-20 12:51:11,852 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:51:11,852 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:51:11,852 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:51:11,852 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 12:51:11,852 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:51:11,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:51:11,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1084590064, now seen corresponding path program 5 times [2024-02-20 12:51:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:51:11,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682553242] [2024-02-20 12:51:11,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:51:11,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:51:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:51:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:51:11,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:51:11,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682553242] [2024-02-20 12:51:11,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682553242] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:51:11,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:51:11,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:51:11,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100978652] [2024-02-20 12:51:11,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:51:11,957 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:51:11,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:51:11,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:51:11,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:51:11,961 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-20 12:51:11,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 88 transitions, 1082 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:51:11,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:51:11,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-20 12:51:11,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:51:12,091 INFO L124 PetriNetUnfolderBase]: 118/227 cut-off events. [2024-02-20 12:51:12,092 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-02-20 12:51:12,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 227 events. 118/227 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 753 event pairs, 24 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 1136. Up to 197 conditions per place. [2024-02-20 12:51:12,094 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 71 selfloop transitions, 15 changer transitions 0/87 dead transitions. [2024-02-20 12:51:12,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 87 transitions, 1242 flow [2024-02-20 12:51:12,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:51:12,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:51:12,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2024-02-20 12:51:12,095 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-02-20 12:51:12,095 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 22 predicate places. [2024-02-20 12:51:12,095 INFO L507 AbstractCegarLoop]: Abstraction has has 44 places, 87 transitions, 1242 flow [2024-02-20 12:51:12,096 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:51:12,096 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:51:12,096 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:51:12,096 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-20 12:51:12,096 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:51:12,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:51:12,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1649924652, now seen corresponding path program 6 times [2024-02-20 12:51:12,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:51:12,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736731445] [2024-02-20 12:51:12,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:51:12,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:51:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:51:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:51:12,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:51:12,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736731445] [2024-02-20 12:51:12,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736731445] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:51:12,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:51:12,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 12:51:12,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032168830] [2024-02-20 12:51:12,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:51:12,216 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:51:12,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:51:12,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:51:12,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:51:12,220 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-20 12:51:12,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 87 transitions, 1242 flow. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:51:12,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:51:12,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-20 12:51:12,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:51:12,371 INFO L124 PetriNetUnfolderBase]: 117/219 cut-off events. [2024-02-20 12:51:12,372 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-02-20 12:51:12,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1741 conditions, 219 events. 117/219 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 732 event pairs, 24 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 1276. Up to 190 conditions per place. [2024-02-20 12:51:12,375 INFO L140 encePairwiseOnDemand]: 15/21 looper letters, 65 selfloop transitions, 15 changer transitions 0/81 dead transitions. [2024-02-20 12:51:12,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 81 transitions, 1312 flow [2024-02-20 12:51:12,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:51:12,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:51:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2024-02-20 12:51:12,376 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-02-20 12:51:12,377 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 26 predicate places. [2024-02-20 12:51:12,377 INFO L507 AbstractCegarLoop]: Abstraction has has 48 places, 81 transitions, 1312 flow [2024-02-20 12:51:12,377 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:51:12,377 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:51:12,377 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:51:12,377 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-20 12:51:12,378 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:51:12,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:51:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash 195867267, now seen corresponding path program 1 times [2024-02-20 12:51:12,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:51:12,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674241249] [2024-02-20 12:51:12,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:51:12,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:51:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:51:12,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:51:12,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:51:12,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674241249] [2024-02-20 12:51:12,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674241249] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:51:12,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328211660] [2024-02-20 12:51:12,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:51:12,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:51:12,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:51:12,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:51:12,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-20 12:51:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:51:12,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 36 conjunts are in the unsatisfiable core [2024-02-20 12:51:12,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:51:12,772 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 15 treesize of output 1 [2024-02-20 12:51:13,397 INFO L349 Elim1Store]: treesize reduction 39, result has 20.4 percent of original size [2024-02-20 12:51:13,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 241 treesize of output 224 [2024-02-20 12:51:32,124 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-20 12:51:44,144 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-20 12:52:04,268 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-20 12:52:31,475 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-20 12:52:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:52:43,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:53:05,034 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-20 12:53:26,225 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 87 treesize of output 77 [2024-02-20 12:53:26,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:53:26,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 204 treesize of output 188 [2024-02-20 12:53:27,137 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 170 treesize of output 150 [2024-02-20 12:53:27,155 INFO L349 Elim1Store]: treesize reduction 156, result has 0.6 percent of original size [2024-02-20 12:53:27,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 572 treesize of output 1 [2024-02-20 12:53:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:53:27,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328211660] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:53:27,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:53:27,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2024-02-20 12:53:27,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250166759] [2024-02-20 12:53:27,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:53:27,203 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-02-20 12:53:27,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:53:27,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-02-20 12:53:27,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-02-20 12:53:27,208 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-20 12:53:27,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 81 transitions, 1312 flow. Second operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 20 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:53:27,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:53:27,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-20 12:53:27,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:53:32,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 12:53:33,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 12:53:36,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 12:53:43,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 12:53:46,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 12:53:49,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 12:53:54,636 INFO L124 PetriNetUnfolderBase]: 374/723 cut-off events. [2024-02-20 12:53:54,636 INFO L125 PetriNetUnfolderBase]: For 172/172 co-relation queries the response was YES. [2024-02-20 12:53:54,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6456 conditions, 723 events. 374/723 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3512 event pairs, 12 based on Foata normal form. 5/546 useless extension candidates. Maximal degree in co-relation 3226. Up to 648 conditions per place. [2024-02-20 12:53:54,641 INFO L140 encePairwiseOnDemand]: 11/21 looper letters, 170 selfloop transitions, 57 changer transitions 100/328 dead transitions. [2024-02-20 12:53:54,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 328 transitions, 6031 flow [2024-02-20 12:53:54,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-02-20 12:53:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-02-20 12:53:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 245 transitions. [2024-02-20 12:53:54,644 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-02-20 12:53:54,644 INFO L308 CegarLoopForPetriNet]: 22 programPoint places, 50 predicate places. [2024-02-20 12:53:54,644 INFO L507 AbstractCegarLoop]: Abstraction has has 72 places, 328 transitions, 6031 flow [2024-02-20 12:53:54,645 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 20 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:53:54,645 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:53:54,645 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:53:54,672 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-02-20 12:53:54,860 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:53:54,861 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:53:54,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:53:54,865 INFO L85 PathProgramCache]: Analyzing trace with hash 480893673, now seen corresponding path program 2 times [2024-02-20 12:53:54,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:53:54,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895166590] [2024-02-20 12:53:54,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:53:54,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:53:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:53:55,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:53:55,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:53:55,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895166590] [2024-02-20 12:53:55,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895166590] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:53:55,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412451078] [2024-02-20 12:53:55,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 12:53:55,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:53:55,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:53:55,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:53:55,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-20 12:53:55,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 12:53:55,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:53:55,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 34 conjunts are in the unsatisfiable core [2024-02-20 12:53:55,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:53:55,299 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 15 treesize of output 1 [2024-02-20 12:53:55,527 INFO L349 Elim1Store]: treesize reduction 39, result has 20.4 percent of original size [2024-02-20 12:53:55,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 241 treesize of output 224 [2024-02-20 12:54:08,835 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-20 12:54:16,845 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-20 12:54:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:54:33,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:56:51,137 WARN L293 SmtUtils]: Spent 1.96m on a formula simplification. DAG size of input: 134 DAG size of output: 136 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:57:40,365 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 170 treesize of output 150 [2024-02-20 12:57:40,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-02-20 12:57:40,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 677 treesize of output 515 [2024-02-20 12:58:02,404 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-02-20 12:58:03,785 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 87 treesize of output 77 [2024-02-20 12:58:03,839 INFO L349 Elim1Store]: treesize reduction 24, result has 60.7 percent of original size [2024-02-20 12:58:03,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 164 [2024-02-20 12:58:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:58:04,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412451078] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:58:04,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:58:04,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2024-02-20 12:58:04,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883579790] [2024-02-20 12:58:04,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:58:04,330 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-02-20 12:58:04,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:58:04,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-02-20 12:58:04,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-02-20 12:58:04,431 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 21 [2024-02-20 12:58:04,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 328 transitions, 6031 flow. Second operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 20 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:58:04,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:58:04,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 21 [2024-02-20 12:58:04,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:59:13,282 WARN L293 SmtUtils]: Spent 1.12m on a formula simplification. DAG size of input: 187 DAG size of output: 76 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:59:42,226 WARN L293 SmtUtils]: Spent 26.75s on a formula simplification. DAG size of input: 142 DAG size of output: 66 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 12:59:46,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 12:59:50,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:00:13,686 WARN L293 SmtUtils]: Spent 21.27s on a formula simplification. DAG size of input: 195 DAG size of output: 50 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 13:00:40,280 WARN L293 SmtUtils]: Spent 22.40s on a formula simplification. DAG size of input: 188 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 13:00:43,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:00:46,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:00:50,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:00:56,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:00:59,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:01:03,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:01:06,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:02:24,158 WARN L293 SmtUtils]: Spent 1.16m on a formula simplification. DAG size of input: 194 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 13:04:06,438 WARN L293 SmtUtils]: Spent 1.35m on a formula simplification. DAG size of input: 143 DAG size of output: 131 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 13:04:10,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:04:15,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:04:20,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:04:21,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:04:25,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:04:30,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:04:34,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:04:39,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:04:41,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 13:04:43,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15