/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 14:31:22,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 14:31:22,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 14:31:22,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 14:31:22,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 14:31:22,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 14:31:22,862 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 14:31:22,862 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 14:31:22,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 14:31:22,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 14:31:22,863 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 14:31:22,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 14:31:22,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 14:31:22,864 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 14:31:22,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 14:31:22,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 14:31:22,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 14:31:22,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 14:31:22,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 14:31:22,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 14:31:22,866 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 14:31:22,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 14:31:22,869 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 14:31:22,869 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 14:31:22,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 14:31:22,870 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 14:31:22,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 14:31:22,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 14:31:22,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 14:31:22,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 14:31:22,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 14:31:22,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 14:31:22,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 14:31:22,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 14:31:22,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 14:31:22,873 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 14:31:23,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 14:31:23,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 14:31:23,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 14:31:23,233 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 14:31:23,234 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 14:31:23,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-08-24 14:31:24,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 14:31:24,461 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 14:31:24,462 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-08-24 14:31:24,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978f4a658/bdb25b8dbc2048c8820f48c84cb8d4fa/FLAG6bd525208 [2023-08-24 14:31:24,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/978f4a658/bdb25b8dbc2048c8820f48c84cb8d4fa [2023-08-24 14:31:24,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 14:31:24,484 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 14:31:24,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 14:31:24,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 14:31:24,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 14:31:24,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 02:31:24" (1/1) ... [2023-08-24 14:31:24,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26262ab6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:31:24, skipping insertion in model container [2023-08-24 14:31:24,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 02:31:24" (1/1) ... [2023-08-24 14:31:24,522 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 14:31:24,721 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-08-24 14:31:24,732 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 14:31:24,745 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 14:31:24,786 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-08-24 14:31:24,789 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 14:31:24,799 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 14:31:24,800 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 14:31:24,805 INFO L206 MainTranslator]: Completed translation [2023-08-24 14:31:24,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:31:24 WrapperNode [2023-08-24 14:31:24,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 14:31:24,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 14:31:24,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 14:31:24,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 14:31:24,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:31:24" (1/1) ... [2023-08-24 14:31:24,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:31:24" (1/1) ... [2023-08-24 14:31:24,879 INFO L138 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 304 [2023-08-24 14:31:24,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 14:31:24,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 14:31:24,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 14:31:24,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 14:31:24,888 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:31:24" (1/1) ... [2023-08-24 14:31:24,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:31:24" (1/1) ... [2023-08-24 14:31:24,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:31:24" (1/1) ... [2023-08-24 14:31:24,902 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:31:24" (1/1) ... [2023-08-24 14:31:24,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:31:24" (1/1) ... [2023-08-24 14:31:24,920 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:31:24" (1/1) ... [2023-08-24 14:31:24,922 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:31:24" (1/1) ... [2023-08-24 14:31:24,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:31:24" (1/1) ... [2023-08-24 14:31:24,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 14:31:24,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 14:31:24,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 14:31:24,939 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 14:31:24,940 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:31:24" (1/1) ... [2023-08-24 14:31:24,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 14:31:24,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 14:31:24,972 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 14:31:24,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 14:31:25,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 14:31:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 14:31:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 14:31:25,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 14:31:25,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 14:31:25,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 14:31:25,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 14:31:25,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 14:31:25,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 14:31:25,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 14:31:25,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 14:31:25,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 14:31:25,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 14:31:25,013 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-24 14:31:25,013 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-24 14:31:25,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-24 14:31:25,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-24 14:31:25,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 14:31:25,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 14:31:25,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 14:31:25,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 14:31:25,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 14:31:25,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 14:31:25,017 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 14:31:25,157 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 14:31:25,159 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 14:31:25,662 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 14:31:25,861 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 14:31:25,861 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-24 14:31:25,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 02:31:25 BoogieIcfgContainer [2023-08-24 14:31:25,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 14:31:25,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 14:31:25,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 14:31:25,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 14:31:25,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 02:31:24" (1/3) ... [2023-08-24 14:31:25,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211f87cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 02:31:25, skipping insertion in model container [2023-08-24 14:31:25,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:31:24" (2/3) ... [2023-08-24 14:31:25,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@211f87cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 02:31:25, skipping insertion in model container [2023-08-24 14:31:25,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 02:31:25" (3/3) ... [2023-08-24 14:31:25,874 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2023-08-24 14:31:25,889 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 14:31:25,889 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 14:31:25,889 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 14:31:25,978 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-08-24 14:31:26,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 264 places, 263 transitions, 598 flow [2023-08-24 14:31:26,088 INFO L124 PetriNetUnfolderBase]: 18/235 cut-off events. [2023-08-24 14:31:26,089 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 14:31:26,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 235 events. 18/235 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 305 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2023-08-24 14:31:26,100 INFO L82 GeneralOperation]: Start removeDead. Operand has 264 places, 263 transitions, 598 flow [2023-08-24 14:31:26,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 227 transitions, 502 flow [2023-08-24 14:31:26,108 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 14:31:26,115 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 227 transitions, 502 flow [2023-08-24 14:31:26,117 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 227 transitions, 502 flow [2023-08-24 14:31:26,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 227 transitions, 502 flow [2023-08-24 14:31:26,164 INFO L124 PetriNetUnfolderBase]: 18/227 cut-off events. [2023-08-24 14:31:26,164 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 14:31:26,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 227 events. 18/227 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 302 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2023-08-24 14:31:26,174 INFO L119 LiptonReduction]: Number of co-enabled transitions 7920 [2023-08-24 14:31:32,258 INFO L134 LiptonReduction]: Checked pairs total: 33760 [2023-08-24 14:31:32,258 INFO L136 LiptonReduction]: Total number of compositions: 188 [2023-08-24 14:31:32,270 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 14:31:32,276 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@72848b27, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 14:31:32,276 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-08-24 14:31:32,288 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 14:31:32,288 INFO L124 PetriNetUnfolderBase]: 9/64 cut-off events. [2023-08-24 14:31:32,288 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 14:31:32,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:31:32,289 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:31:32,290 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:31:32,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:31:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1898109785, now seen corresponding path program 1 times [2023-08-24 14:31:32,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:31:32,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365768156] [2023-08-24 14:31:32,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:31:32,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:31:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:31:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:31:32,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:31:32,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365768156] [2023-08-24 14:31:32,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365768156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 14:31:32,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 14:31:32,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 14:31:32,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23558982] [2023-08-24 14:31:32,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 14:31:32,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 14:31:32,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:31:32,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 14:31:32,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 14:31:32,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 455 [2023-08-24 14:31:32,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 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) [2023-08-24 14:31:32,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:31:32,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 455 [2023-08-24 14:31:32,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:31:36,515 INFO L124 PetriNetUnfolderBase]: 24447/33183 cut-off events. [2023-08-24 14:31:36,516 INFO L125 PetriNetUnfolderBase]: For 5662/5662 co-relation queries the response was YES. [2023-08-24 14:31:36,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69959 conditions, 33183 events. 24447/33183 cut-off events. For 5662/5662 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 178552 event pairs, 7197 based on Foata normal form. 1/25597 useless extension candidates. Maximal degree in co-relation 68487. Up to 12303 conditions per place. [2023-08-24 14:31:36,748 INFO L140 encePairwiseOnDemand]: 448/455 looper letters, 109 selfloop transitions, 8 changer transitions 1/138 dead transitions. [2023-08-24 14:31:36,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 138 transitions, 641 flow [2023-08-24 14:31:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 14:31:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 14:31:36,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 975 transitions. [2023-08-24 14:31:36,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2023-08-24 14:31:36,764 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 975 transitions. [2023-08-24 14:31:36,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 975 transitions. [2023-08-24 14:31:36,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:31:36,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 975 transitions. [2023-08-24 14:31:36,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 243.75) internal successors, (975), 4 states have internal predecessors, (975), 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) [2023-08-24 14:31:36,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 455.0) internal successors, (2275), 5 states have internal predecessors, (2275), 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) [2023-08-24 14:31:36,782 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 455.0) internal successors, (2275), 5 states have internal predecessors, (2275), 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) [2023-08-24 14:31:36,783 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 178 flow. Second operand 4 states and 975 transitions. [2023-08-24 14:31:36,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 138 transitions, 641 flow [2023-08-24 14:31:36,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 138 transitions, 555 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-24 14:31:36,867 INFO L231 Difference]: Finished difference. Result has 68 places, 72 transitions, 199 flow [2023-08-24 14:31:36,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=68, PETRI_TRANSITIONS=72} [2023-08-24 14:31:36,872 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2023-08-24 14:31:36,872 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 72 transitions, 199 flow [2023-08-24 14:31:36,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 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) [2023-08-24 14:31:36,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:31:36,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:31:36,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 14:31:36,874 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:31:36,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:31:36,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1410762776, now seen corresponding path program 1 times [2023-08-24 14:31:36,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:31:36,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222075470] [2023-08-24 14:31:36,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:31:36,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:31:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:31:37,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:31:37,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:31:37,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222075470] [2023-08-24 14:31:37,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222075470] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 14:31:37,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 14:31:37,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 14:31:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087235458] [2023-08-24 14:31:37,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 14:31:37,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 14:31:37,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:31:37,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 14:31:37,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 14:31:37,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 455 [2023-08-24 14:31:37,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 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) [2023-08-24 14:31:37,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:31:37,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 455 [2023-08-24 14:31:37,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:31:41,493 INFO L124 PetriNetUnfolderBase]: 40211/54719 cut-off events. [2023-08-24 14:31:41,493 INFO L125 PetriNetUnfolderBase]: For 11876/11876 co-relation queries the response was YES. [2023-08-24 14:31:41,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120973 conditions, 54719 events. 40211/54719 cut-off events. For 11876/11876 co-relation queries the response was YES. Maximal size of possible extension queue 1378. Compared 312439 event pairs, 15979 based on Foata normal form. 1/42240 useless extension candidates. Maximal degree in co-relation 43215. Up to 22845 conditions per place. [2023-08-24 14:31:41,822 INFO L140 encePairwiseOnDemand]: 448/455 looper letters, 115 selfloop transitions, 11 changer transitions 1/147 dead transitions. [2023-08-24 14:31:41,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 147 transitions, 654 flow [2023-08-24 14:31:41,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 14:31:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 14:31:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 977 transitions. [2023-08-24 14:31:41,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5368131868131868 [2023-08-24 14:31:41,825 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 977 transitions. [2023-08-24 14:31:41,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 977 transitions. [2023-08-24 14:31:41,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:31:41,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 977 transitions. [2023-08-24 14:31:41,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 244.25) internal successors, (977), 4 states have internal predecessors, (977), 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) [2023-08-24 14:31:41,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 455.0) internal successors, (2275), 5 states have internal predecessors, (2275), 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) [2023-08-24 14:31:41,834 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 455.0) internal successors, (2275), 5 states have internal predecessors, (2275), 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) [2023-08-24 14:31:41,836 INFO L175 Difference]: Start difference. First operand has 68 places, 72 transitions, 199 flow. Second operand 4 states and 977 transitions. [2023-08-24 14:31:41,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 147 transitions, 654 flow [2023-08-24 14:31:41,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 147 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 14:31:41,853 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 278 flow [2023-08-24 14:31:41,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2023-08-24 14:31:41,854 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2023-08-24 14:31:41,854 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 278 flow [2023-08-24 14:31:41,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 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) [2023-08-24 14:31:41,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:31:41,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:31:41,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 14:31:41,856 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:31:41,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:31:41,858 INFO L85 PathProgramCache]: Analyzing trace with hash -322165593, now seen corresponding path program 1 times [2023-08-24 14:31:41,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:31:41,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776686573] [2023-08-24 14:31:41,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:31:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:31:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:31:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:31:42,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:31:42,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776686573] [2023-08-24 14:31:42,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776686573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 14:31:42,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 14:31:42,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 14:31:42,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836876831] [2023-08-24 14:31:42,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 14:31:42,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 14:31:42,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:31:42,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 14:31:42,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 14:31:42,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 14:31:42,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 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) [2023-08-24 14:31:42,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:31:42,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 14:31:42,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:31:47,233 INFO L124 PetriNetUnfolderBase]: 52244/71422 cut-off events. [2023-08-24 14:31:47,234 INFO L125 PetriNetUnfolderBase]: For 34593/34593 co-relation queries the response was YES. [2023-08-24 14:31:47,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169705 conditions, 71422 events. 52244/71422 cut-off events. For 34593/34593 co-relation queries the response was YES. Maximal size of possible extension queue 1847. Compared 428320 event pairs, 34723 based on Foata normal form. 0/55814 useless extension candidates. Maximal degree in co-relation 71375. Up to 50266 conditions per place. [2023-08-24 14:31:47,748 INFO L140 encePairwiseOnDemand]: 449/455 looper letters, 121 selfloop transitions, 5 changer transitions 0/146 dead transitions. [2023-08-24 14:31:47,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 146 transitions, 753 flow [2023-08-24 14:31:47,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 14:31:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 14:31:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1112 transitions. [2023-08-24 14:31:47,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4887912087912088 [2023-08-24 14:31:47,758 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1112 transitions. [2023-08-24 14:31:47,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1112 transitions. [2023-08-24 14:31:47,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:31:47,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1112 transitions. [2023-08-24 14:31:47,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 222.4) internal successors, (1112), 5 states have internal predecessors, (1112), 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) [2023-08-24 14:31:47,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 455.0) internal successors, (2730), 6 states have internal predecessors, (2730), 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) [2023-08-24 14:31:47,770 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 455.0) internal successors, (2730), 6 states have internal predecessors, (2730), 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) [2023-08-24 14:31:47,770 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 278 flow. Second operand 5 states and 1112 transitions. [2023-08-24 14:31:47,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 146 transitions, 753 flow [2023-08-24 14:31:47,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 146 transitions, 749 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-24 14:31:47,802 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 324 flow [2023-08-24 14:31:47,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2023-08-24 14:31:47,803 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2023-08-24 14:31:47,803 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 324 flow [2023-08-24 14:31:47,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 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) [2023-08-24 14:31:47,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:31:47,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:31:47,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 14:31:47,804 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:31:47,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:31:47,805 INFO L85 PathProgramCache]: Analyzing trace with hash 348277624, now seen corresponding path program 1 times [2023-08-24 14:31:47,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:31:47,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120912156] [2023-08-24 14:31:47,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:31:47,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:31:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:31:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:31:48,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:31:48,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120912156] [2023-08-24 14:31:48,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120912156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 14:31:48,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 14:31:48,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 14:31:48,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868265478] [2023-08-24 14:31:48,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 14:31:48,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 14:31:48,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:31:48,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 14:31:48,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 14:31:48,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 14:31:48,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 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) [2023-08-24 14:31:48,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:31:48,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 14:31:48,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:31:52,151 INFO L124 PetriNetUnfolderBase]: 43919/60156 cut-off events. [2023-08-24 14:31:52,151 INFO L125 PetriNetUnfolderBase]: For 33722/33722 co-relation queries the response was YES. [2023-08-24 14:31:52,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147051 conditions, 60156 events. 43919/60156 cut-off events. For 33722/33722 co-relation queries the response was YES. Maximal size of possible extension queue 1583. Compared 353513 event pairs, 30832 based on Foata normal form. 0/51689 useless extension candidates. Maximal degree in co-relation 134975. Up to 50266 conditions per place. [2023-08-24 14:31:52,497 INFO L140 encePairwiseOnDemand]: 449/455 looper letters, 58 selfloop transitions, 2 changer transitions 51/131 dead transitions. [2023-08-24 14:31:52,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 131 transitions, 677 flow [2023-08-24 14:31:52,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 14:31:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 14:31:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1103 transitions. [2023-08-24 14:31:52,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4848351648351648 [2023-08-24 14:31:52,502 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1103 transitions. [2023-08-24 14:31:52,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1103 transitions. [2023-08-24 14:31:52,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:31:52,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1103 transitions. [2023-08-24 14:31:52,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 220.6) internal successors, (1103), 5 states have internal predecessors, (1103), 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) [2023-08-24 14:31:52,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 455.0) internal successors, (2730), 6 states have internal predecessors, (2730), 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) [2023-08-24 14:31:52,510 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 455.0) internal successors, (2730), 6 states have internal predecessors, (2730), 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) [2023-08-24 14:31:52,511 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 324 flow. Second operand 5 states and 1103 transitions. [2023-08-24 14:31:52,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 131 transitions, 677 flow [2023-08-24 14:31:52,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 131 transitions, 673 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 14:31:52,533 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 302 flow [2023-08-24 14:31:52,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2023-08-24 14:31:52,535 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2023-08-24 14:31:52,535 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 302 flow [2023-08-24 14:31:52,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 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) [2023-08-24 14:31:52,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:31:52,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:31:52,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 14:31:52,537 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:31:52,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:31:52,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2068381003, now seen corresponding path program 1 times [2023-08-24 14:31:52,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:31:52,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507265822] [2023-08-24 14:31:52,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:31:52,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:31:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:31:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:31:52,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:31:52,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507265822] [2023-08-24 14:31:52,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507265822] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 14:31:52,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308538568] [2023-08-24 14:31:52,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:31:52,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:31:52,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 14:31:52,829 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) [2023-08-24 14:31:52,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 14:31:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:31:52,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-24 14:31:53,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 14:31:53,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:31:53,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 14:31:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:31:53,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308538568] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 14:31:53,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 14:31:53,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-24 14:31:53,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953111024] [2023-08-24 14:31:53,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 14:31:53,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-24 14:31:53,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:31:53,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-24 14:31:53,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-08-24 14:31:53,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 14:31:53,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 302 flow. Second operand has 11 states, 11 states have (on average 205.45454545454547) internal successors, (2260), 11 states have internal predecessors, (2260), 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) [2023-08-24 14:31:53,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:31:53,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 14:31:53,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:31:58,639 INFO L124 PetriNetUnfolderBase]: 50674/69405 cut-off events. [2023-08-24 14:31:58,640 INFO L125 PetriNetUnfolderBase]: For 48897/48897 co-relation queries the response was YES. [2023-08-24 14:31:58,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175332 conditions, 69405 events. 50674/69405 cut-off events. For 48897/48897 co-relation queries the response was YES. Maximal size of possible extension queue 1840. Compared 425307 event pairs, 17153 based on Foata normal form. 3638/68767 useless extension candidates. Maximal degree in co-relation 175311. Up to 28288 conditions per place. [2023-08-24 14:31:59,013 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 159 selfloop transitions, 8 changer transitions 0/187 dead transitions. [2023-08-24 14:31:59,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 187 transitions, 1059 flow [2023-08-24 14:31:59,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 14:31:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 14:31:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1544 transitions. [2023-08-24 14:31:59,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847723704866562 [2023-08-24 14:31:59,018 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1544 transitions. [2023-08-24 14:31:59,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1544 transitions. [2023-08-24 14:31:59,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:31:59,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1544 transitions. [2023-08-24 14:31:59,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 220.57142857142858) internal successors, (1544), 7 states have internal predecessors, (1544), 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) [2023-08-24 14:31:59,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 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) [2023-08-24 14:31:59,029 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 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) [2023-08-24 14:31:59,029 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 302 flow. Second operand 7 states and 1544 transitions. [2023-08-24 14:31:59,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 187 transitions, 1059 flow [2023-08-24 14:31:59,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 187 transitions, 1035 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-24 14:31:59,057 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 368 flow [2023-08-24 14:31:59,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-08-24 14:31:59,058 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 13 predicate places. [2023-08-24 14:31:59,058 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 368 flow [2023-08-24 14:31:59,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 205.45454545454547) internal successors, (2260), 11 states have internal predecessors, (2260), 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) [2023-08-24 14:31:59,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:31:59,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:31:59,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 14:31:59,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:31:59,265 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:31:59,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:31:59,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2027202032, now seen corresponding path program 1 times [2023-08-24 14:31:59,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:31:59,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119134611] [2023-08-24 14:31:59,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:31:59,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:31:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:31:59,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:31:59,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:31:59,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119134611] [2023-08-24 14:31:59,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119134611] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 14:31:59,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389984608] [2023-08-24 14:31:59,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:31:59,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:31:59,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 14:31:59,601 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) [2023-08-24 14:31:59,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 14:31:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:31:59,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-24 14:31:59,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 14:31:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:31:59,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 14:31:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:31:59,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389984608] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 14:31:59,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 14:31:59,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-24 14:31:59,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524731238] [2023-08-24 14:31:59,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 14:31:59,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 14:31:59,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:31:59,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 14:31:59,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-08-24 14:31:59,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 14:31:59,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 368 flow. Second operand has 12 states, 12 states have (on average 205.41666666666666) internal successors, (2465), 12 states have internal predecessors, (2465), 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) [2023-08-24 14:31:59,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:31:59,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 14:31:59,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:32:04,760 INFO L124 PetriNetUnfolderBase]: 40749/56293 cut-off events. [2023-08-24 14:32:04,760 INFO L125 PetriNetUnfolderBase]: For 64553/64553 co-relation queries the response was YES. [2023-08-24 14:32:04,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156626 conditions, 56293 events. 40749/56293 cut-off events. For 64553/64553 co-relation queries the response was YES. Maximal size of possible extension queue 1569. Compared 337020 event pairs, 12988 based on Foata normal form. 2458/55322 useless extension candidates. Maximal degree in co-relation 143695. Up to 26698 conditions per place. [2023-08-24 14:32:05,039 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 100 selfloop transitions, 5 changer transitions 51/176 dead transitions. [2023-08-24 14:32:05,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 176 transitions, 1023 flow [2023-08-24 14:32:05,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 14:32:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 14:32:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1535 transitions. [2023-08-24 14:32:05,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48194662480376765 [2023-08-24 14:32:05,044 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1535 transitions. [2023-08-24 14:32:05,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1535 transitions. [2023-08-24 14:32:05,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:32:05,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1535 transitions. [2023-08-24 14:32:05,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 219.28571428571428) internal successors, (1535), 7 states have internal predecessors, (1535), 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) [2023-08-24 14:32:05,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 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) [2023-08-24 14:32:05,053 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 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) [2023-08-24 14:32:05,053 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 368 flow. Second operand 7 states and 1535 transitions. [2023-08-24 14:32:05,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 176 transitions, 1023 flow [2023-08-24 14:32:05,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 176 transitions, 1007 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-24 14:32:05,082 INFO L231 Difference]: Finished difference. Result has 96 places, 85 transitions, 362 flow [2023-08-24 14:32:05,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=96, PETRI_TRANSITIONS=85} [2023-08-24 14:32:05,084 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 21 predicate places. [2023-08-24 14:32:05,084 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 85 transitions, 362 flow [2023-08-24 14:32:05,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 205.41666666666666) internal successors, (2465), 12 states have internal predecessors, (2465), 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) [2023-08-24 14:32:05,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:32:05,085 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:32:05,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 14:32:05,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-24 14:32:05,290 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:32:05,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:32:05,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1593234664, now seen corresponding path program 1 times [2023-08-24 14:32:05,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:32:05,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280021223] [2023-08-24 14:32:05,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:32:05,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:32:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:32:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:32:05,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:32:05,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280021223] [2023-08-24 14:32:05,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280021223] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 14:32:05,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815531234] [2023-08-24 14:32:05,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:32:05,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:32:05,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 14:32:05,533 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 14:32:05,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 14:32:05,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:32:05,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-24 14:32:05,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 14:32:05,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:32:05,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 14:32:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:32:05,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815531234] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 14:32:05,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 14:32:05,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-24 14:32:05,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32485880] [2023-08-24 14:32:05,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 14:32:05,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 14:32:05,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:32:05,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 14:32:05,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-08-24 14:32:05,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 14:32:05,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 85 transitions, 362 flow. Second operand has 12 states, 12 states have (on average 206.66666666666666) internal successors, (2480), 12 states have internal predecessors, (2480), 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) [2023-08-24 14:32:05,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:32:05,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 14:32:05,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:32:09,509 INFO L124 PetriNetUnfolderBase]: 28494/38679 cut-off events. [2023-08-24 14:32:09,509 INFO L125 PetriNetUnfolderBase]: For 63978/63978 co-relation queries the response was YES. [2023-08-24 14:32:09,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122051 conditions, 38679 events. 28494/38679 cut-off events. For 63978/63978 co-relation queries the response was YES. Maximal size of possible extension queue 1081. Compared 210950 event pairs, 15424 based on Foata normal form. 1152/37794 useless extension candidates. Maximal degree in co-relation 122010. Up to 32675 conditions per place. [2023-08-24 14:32:09,894 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 88 selfloop transitions, 8 changer transitions 0/116 dead transitions. [2023-08-24 14:32:09,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 116 transitions, 693 flow [2023-08-24 14:32:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 14:32:09,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 14:32:09,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1481 transitions. [2023-08-24 14:32:09,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4649921507064364 [2023-08-24 14:32:09,899 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1481 transitions. [2023-08-24 14:32:09,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1481 transitions. [2023-08-24 14:32:09,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:32:09,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1481 transitions. [2023-08-24 14:32:09,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 211.57142857142858) internal successors, (1481), 7 states have internal predecessors, (1481), 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) [2023-08-24 14:32:09,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 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) [2023-08-24 14:32:09,907 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 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) [2023-08-24 14:32:09,907 INFO L175 Difference]: Start difference. First operand has 96 places, 85 transitions, 362 flow. Second operand 7 states and 1481 transitions. [2023-08-24 14:32:09,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 116 transitions, 693 flow [2023-08-24 14:32:09,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 116 transitions, 651 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-24 14:32:09,948 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 370 flow [2023-08-24 14:32:09,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=370, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2023-08-24 14:32:09,949 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 17 predicate places. [2023-08-24 14:32:09,949 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 370 flow [2023-08-24 14:32:09,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 206.66666666666666) internal successors, (2480), 12 states have internal predecessors, (2480), 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) [2023-08-24 14:32:09,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:32:09,950 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:32:09,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 14:32:10,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:32:10,159 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:32:10,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:32:10,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1296418912, now seen corresponding path program 1 times [2023-08-24 14:32:10,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:32:10,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775844922] [2023-08-24 14:32:10,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:32:10,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:32:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:32:10,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:32:10,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:32:10,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775844922] [2023-08-24 14:32:10,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775844922] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 14:32:10,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808006607] [2023-08-24 14:32:10,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:32:10,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:32:10,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 14:32:10,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 14:32:10,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 14:32:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:32:10,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-24 14:32:10,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 14:32:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:32:10,654 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 14:32:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:32:10,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808006607] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 14:32:10,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 14:32:10,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2023-08-24 14:32:10,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423312347] [2023-08-24 14:32:10,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 14:32:10,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 14:32:10,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:32:10,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 14:32:10,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-24 14:32:10,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 14:32:10,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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) [2023-08-24 14:32:10,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:32:10,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 14:32:10,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:32:13,080 INFO L124 PetriNetUnfolderBase]: 21901/29332 cut-off events. [2023-08-24 14:32:13,080 INFO L125 PetriNetUnfolderBase]: For 41930/41930 co-relation queries the response was YES. [2023-08-24 14:32:13,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92309 conditions, 29332 events. 21901/29332 cut-off events. For 41930/41930 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 148272 event pairs, 11661 based on Foata normal form. 816/28769 useless extension candidates. Maximal degree in co-relation 92269. Up to 25062 conditions per place. [2023-08-24 14:32:13,216 INFO L140 encePairwiseOnDemand]: 448/455 looper letters, 93 selfloop transitions, 7 changer transitions 0/120 dead transitions. [2023-08-24 14:32:13,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 120 transitions, 716 flow [2023-08-24 14:32:13,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 14:32:13,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 14:32:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1280 transitions. [2023-08-24 14:32:13,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46886446886446886 [2023-08-24 14:32:13,219 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1280 transitions. [2023-08-24 14:32:13,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1280 transitions. [2023-08-24 14:32:13,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:32:13,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1280 transitions. [2023-08-24 14:32:13,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 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) [2023-08-24 14:32:13,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 455.0) internal successors, (3185), 7 states have internal predecessors, (3185), 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) [2023-08-24 14:32:13,226 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 455.0) internal successors, (3185), 7 states have internal predecessors, (3185), 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) [2023-08-24 14:32:13,226 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 370 flow. Second operand 6 states and 1280 transitions. [2023-08-24 14:32:13,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 120 transitions, 716 flow [2023-08-24 14:32:13,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 120 transitions, 691 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-24 14:32:13,256 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 386 flow [2023-08-24 14:32:13,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2023-08-24 14:32:13,257 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 19 predicate places. [2023-08-24 14:32:13,257 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 386 flow [2023-08-24 14:32:13,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 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) [2023-08-24 14:32:13,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:32:13,258 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:32:13,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 14:32:13,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:32:13,469 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:32:13,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:32:13,470 INFO L85 PathProgramCache]: Analyzing trace with hash 477685320, now seen corresponding path program 1 times [2023-08-24 14:32:13,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:32:13,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24674629] [2023-08-24 14:32:13,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:32:13,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:32:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:32:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 14:32:14,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:32:14,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24674629] [2023-08-24 14:32:14,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24674629] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 14:32:14,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511638193] [2023-08-24 14:32:14,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:32:14,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:32:14,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 14:32:14,821 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 14:32:14,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 14:32:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:32:15,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 62 conjunts are in the unsatisfiable core [2023-08-24 14:32:15,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 14:32:15,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 14:32:15,394 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 14:32:15,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 14:32:15,468 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 14:32:15,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 14:32:15,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 14:32:15,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 14:32:15,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 14:32:15,749 INFO L351 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 15 treesize of output 7 [2023-08-24 14:32:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 14:32:15,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 14:32:16,221 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0) (+ 1 c_~s_2~0))))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0))))))) is different from false [2023-08-24 14:32:17,209 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0) (+ 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 14:32:18,567 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 14:32:18,648 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_496 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_496 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 14:32:20,779 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_495) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_495) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 14:32:20,835 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 14:32:20,835 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 922 treesize of output 630 [2023-08-24 14:32:20,852 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 290 [2023-08-24 14:32:20,862 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 258 [2023-08-24 14:32:20,874 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 123 [2023-08-24 14:32:20,886 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 122 [2023-08-24 14:32:21,256 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 14:32:21,257 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 14:32:21,257 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 14:32:21,258 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 14:32:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 14:32:21,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511638193] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 14:32:21,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 14:32:21,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 36 [2023-08-24 14:32:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865903401] [2023-08-24 14:32:21,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 14:32:21,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-24 14:32:21,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:32:21,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-24 14:32:21,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=907, Unknown=20, NotChecked=330, Total=1406 [2023-08-24 14:32:21,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 455 [2023-08-24 14:32:21,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 386 flow. Second operand has 38 states, 38 states have (on average 169.68421052631578) internal successors, (6448), 38 states have internal predecessors, (6448), 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) [2023-08-24 14:32:21,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:32:21,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 455 [2023-08-24 14:32:21,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:32:38,435 INFO L124 PetriNetUnfolderBase]: 92447/120447 cut-off events. [2023-08-24 14:32:38,435 INFO L125 PetriNetUnfolderBase]: For 150182/150182 co-relation queries the response was YES. [2023-08-24 14:32:38,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373410 conditions, 120447 events. 92447/120447 cut-off events. For 150182/150182 co-relation queries the response was YES. Maximal size of possible extension queue 2557. Compared 674321 event pairs, 6180 based on Foata normal form. 2/115989 useless extension candidates. Maximal degree in co-relation 373369. Up to 42024 conditions per place. [2023-08-24 14:32:39,143 INFO L140 encePairwiseOnDemand]: 437/455 looper letters, 750 selfloop transitions, 142 changer transitions 30/932 dead transitions. [2023-08-24 14:32:39,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 932 transitions, 5449 flow [2023-08-24 14:32:39,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-24 14:32:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-24 14:32:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 6984 transitions. [2023-08-24 14:32:39,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148500148500148 [2023-08-24 14:32:39,158 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 6984 transitions. [2023-08-24 14:32:39,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 6984 transitions. [2023-08-24 14:32:39,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:32:39,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 6984 transitions. [2023-08-24 14:32:39,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 188.75675675675674) internal successors, (6984), 37 states have internal predecessors, (6984), 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) [2023-08-24 14:32:39,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 455.0) internal successors, (17290), 38 states have internal predecessors, (17290), 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) [2023-08-24 14:32:39,196 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 455.0) internal successors, (17290), 38 states have internal predecessors, (17290), 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) [2023-08-24 14:32:39,196 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 386 flow. Second operand 37 states and 6984 transitions. [2023-08-24 14:32:39,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 932 transitions, 5449 flow [2023-08-24 14:32:39,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 932 transitions, 5429 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-24 14:32:39,364 INFO L231 Difference]: Finished difference. Result has 152 places, 241 transitions, 1697 flow [2023-08-24 14:32:39,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1697, PETRI_PLACES=152, PETRI_TRANSITIONS=241} [2023-08-24 14:32:39,364 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 77 predicate places. [2023-08-24 14:32:39,365 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 241 transitions, 1697 flow [2023-08-24 14:32:39,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 169.68421052631578) internal successors, (6448), 38 states have internal predecessors, (6448), 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) [2023-08-24 14:32:39,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:32:39,366 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:32:39,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 14:32:39,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:32:39,573 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:32:39,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:32:39,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1899960650, now seen corresponding path program 2 times [2023-08-24 14:32:39,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:32:39,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904377514] [2023-08-24 14:32:39,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:32:39,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:32:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:32:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 14:32:40,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:32:40,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904377514] [2023-08-24 14:32:40,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904377514] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 14:32:40,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49608169] [2023-08-24 14:32:40,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 14:32:40,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:32:40,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 14:32:40,629 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 14:32:40,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 14:32:40,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 14:32:40,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 14:32:40,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 61 conjunts are in the unsatisfiable core [2023-08-24 14:32:40,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 14:32:40,854 INFO L322 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-24 14:32:40,854 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2023-08-24 14:32:40,891 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 14:32:40,892 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 14:32:41,107 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-24 14:32:41,135 INFO L351 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 22 treesize of output 10 [2023-08-24 14:32:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 14:32:41,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 14:32:41,310 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_576 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_576) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_576 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_576) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))))) is different from false [2023-08-24 14:32:41,323 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_576 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_576) c_~X_0~0.base) .cse0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_576 (Array Int Int))) (<= c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_576) c_~X_0~0.base) .cse0))))) is different from false [2023-08-24 14:32:41,396 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_576 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_576) c_~X_0~0.base) .cse0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_576 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_576) c_~X_0~0.base) .cse0))))) is different from false [2023-08-24 14:32:41,404 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 14:32:41,405 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 32 [2023-08-24 14:32:41,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-24 14:32:41,424 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 14:32:41,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-08-24 14:32:41,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49608169] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 14:32:41,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 14:32:41,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2023-08-24 14:32:41,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567416164] [2023-08-24 14:32:41,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 14:32:41,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 14:32:41,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:32:41,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 14:32:41,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=322, Unknown=3, NotChecked=114, Total=506 [2023-08-24 14:32:41,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 455 [2023-08-24 14:32:41,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 241 transitions, 1697 flow. Second operand has 23 states, 23 states have (on average 166.8695652173913) internal successors, (3838), 23 states have internal predecessors, (3838), 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) [2023-08-24 14:32:41,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:32:41,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 455 [2023-08-24 14:32:41,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:33:18,803 INFO L124 PetriNetUnfolderBase]: 192898/251712 cut-off events. [2023-08-24 14:33:18,804 INFO L125 PetriNetUnfolderBase]: For 1263795/1263863 co-relation queries the response was YES. [2023-08-24 14:33:20,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029424 conditions, 251712 events. 192898/251712 cut-off events. For 1263795/1263863 co-relation queries the response was YES. Maximal size of possible extension queue 5295. Compared 1524188 event pairs, 42723 based on Foata normal form. 14/242068 useless extension candidates. Maximal degree in co-relation 1029373. Up to 116939 conditions per place. [2023-08-24 14:33:21,986 INFO L140 encePairwiseOnDemand]: 413/455 looper letters, 990 selfloop transitions, 336 changer transitions 24/1360 dead transitions. [2023-08-24 14:33:21,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 1360 transitions, 11303 flow [2023-08-24 14:33:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-24 14:33:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-24 14:33:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 6972 transitions. [2023-08-24 14:33:21,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40323886639676115 [2023-08-24 14:33:21,995 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 6972 transitions. [2023-08-24 14:33:21,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 6972 transitions. [2023-08-24 14:33:21,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 14:33:21,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 6972 transitions. [2023-08-24 14:33:22,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 183.47368421052633) internal successors, (6972), 38 states have internal predecessors, (6972), 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) [2023-08-24 14:33:22,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 455.0) internal successors, (17745), 39 states have internal predecessors, (17745), 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) [2023-08-24 14:33:22,027 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 455.0) internal successors, (17745), 39 states have internal predecessors, (17745), 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) [2023-08-24 14:33:22,027 INFO L175 Difference]: Start difference. First operand has 152 places, 241 transitions, 1697 flow. Second operand 38 states and 6972 transitions. [2023-08-24 14:33:22,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 1360 transitions, 11303 flow [2023-08-24 14:33:56,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 1360 transitions, 11038 flow, removed 110 selfloop flow, removed 3 redundant places. [2023-08-24 14:33:56,214 INFO L231 Difference]: Finished difference. Result has 215 places, 592 transitions, 5689 flow [2023-08-24 14:33:56,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=5689, PETRI_PLACES=215, PETRI_TRANSITIONS=592} [2023-08-24 14:33:56,215 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 140 predicate places. [2023-08-24 14:33:56,216 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 592 transitions, 5689 flow [2023-08-24 14:33:56,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 166.8695652173913) internal successors, (3838), 23 states have internal predecessors, (3838), 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) [2023-08-24 14:33:56,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 14:33:56,216 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 14:33:56,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-24 14:33:56,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:33:56,422 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 14:33:56,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 14:33:56,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1840379924, now seen corresponding path program 3 times [2023-08-24 14:33:56,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 14:33:56,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049659628] [2023-08-24 14:33:56,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 14:33:56,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 14:33:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 14:33:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 14:33:57,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 14:33:57,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049659628] [2023-08-24 14:33:57,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049659628] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 14:33:57,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583976569] [2023-08-24 14:33:57,517 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 14:33:57,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 14:33:57,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 14:33:57,525 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 14:33:57,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 14:33:57,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 14:33:57,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 14:33:57,750 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 79 conjunts are in the unsatisfiable core [2023-08-24 14:33:57,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 14:33:57,816 INFO L351 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 13 treesize of output 9 [2023-08-24 14:33:57,863 INFO L351 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 6 treesize of output 5 [2023-08-24 14:33:57,920 INFO L351 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 6 treesize of output 5 [2023-08-24 14:33:58,060 INFO L351 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 6 treesize of output 5 [2023-08-24 14:33:58,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 14:33:58,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 14:33:58,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 14:33:58,332 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 14:33:58,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 14:33:58,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 14:33:58,443 INFO L351 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 19 treesize of output 7 [2023-08-24 14:33:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 14:33:58,551 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 14:33:58,710 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_658 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_658) c_~X_0~0.base) .cse0)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_658 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_658) c_~X_0~0.base) .cse0)))))) is different from false [2023-08-24 14:33:58,737 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_658) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_658) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))))) is different from false [2023-08-24 14:33:58,754 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_658) c_~X_0~0.base) .cse0))) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_658) c_~X_0~0.base) .cse0) (+ c_~s_6~0 1))))) is different from false [2023-08-24 14:33:58,775 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse0) (+ c_~s_6~0 1))))) (forall ((|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse0))) (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 14:33:58,797 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_656 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse0))))) (forall ((v_ArrVal_656 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse0) (+ c_~s_6~0 1))))))) is different from false [2023-08-24 14:33:58,848 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_656 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse0) (+ c_~s_6~0 c_~t_8~0 1))) (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|))) (forall ((v_ArrVal_656 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse0))) (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 14:33:58,875 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4)) (.cse0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))) (and (forall ((v_ArrVal_656 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (<= (+ c_~s_6~0 .cse0) (select (select (store (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1))) (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|))) (forall ((v_ArrVal_656 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ c_~s_6~0 .cse0 1))) (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 14:33:58,930 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4)) (.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (<= (+ c_~s_6~0 (select (select .cse0 c_~X_0~0.base) .cse1)) (select (select (store (store (store .cse0 |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse2)))) (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|))) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (< (select (select (store (store (store .cse3 |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse2) (+ c_~s_6~0 (select (select .cse3 c_~X_0~0.base) .cse1) 1)))))))) is different from false [2023-08-24 14:33:59,046 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1)))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (< (select (select (store (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ (select (select .cse2 c_~X_0~0.base) .cse1) 1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 14:34:01,145 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_40| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_40| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_40| v_ArrVal_655))) (< (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ (select (select .cse0 c_~X_0~0.base) .cse1) 1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_40| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_40| v_ArrVal_655))) (<= (select (select .cse2 c_~X_0~0.base) .cse1) (select (select (store (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_40| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 14:34:01,250 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_40| Int) (v_ArrVal_654 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_654) |v_thread4Thread1of1ForFork0_~#t5~0.base_40| v_ArrVal_655))) (< (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ (select (select .cse0 c_~X_0~0.base) .cse1) 1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_40| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_40| Int) (v_ArrVal_654 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_654) |v_thread4Thread1of1ForFork0_~#t5~0.base_40| v_ArrVal_655))) (<= (select (select .cse2 c_~X_0~0.base) .cse1) (select (select (store (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1)))) (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_40| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 14:34:13,920 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 14:34:13,920 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 55 [2023-08-24 14:34:14,043 INFO L351 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 692092918 treesize of output 664567798 [2023-08-24 14:34:14,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 563 treesize of output 535 [2023-08-24 14:34:14,928 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1126 treesize of output 1062 [2023-08-24 14:34:14,948 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1062 treesize of output 1030 [2023-08-24 14:34:14,965 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 902 [2023-08-24 14:34:14,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 423 treesize of output 367 [2023-08-24 14:34:15,012 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 478 treesize of output 366 [2023-08-24 14:34:15,759 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 14:34:15,770 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-24 14:34:15,770 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2023-08-24 14:34:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-24 14:34:15,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583976569] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 14:34:15,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 14:34:15,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 18] total 44 [2023-08-24 14:34:15,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077819342] [2023-08-24 14:34:15,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 14:34:15,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-08-24 14:34:15,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 14:34:15,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-08-24 14:34:15,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1074, Unknown=13, NotChecked=836, Total=2070 [2023-08-24 14:34:15,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 455 [2023-08-24 14:34:15,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 592 transitions, 5689 flow. Second operand has 46 states, 46 states have (on average 156.17391304347825) internal successors, (7184), 46 states have internal predecessors, (7184), 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) [2023-08-24 14:34:15,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 14:34:15,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 455 [2023-08-24 14:34:15,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 14:34:30,592 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1)))))))) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread4Thread1of1ForFork0_~#t5~0.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork5_~#t2~0.base|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (< (select (select (store (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ (select (select .cse2 c_~X_0~0.base) .cse1) 1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork5_~#t2~0.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= c_~X_0~0.offset 0))) is different from false [2023-08-24 14:34:31,918 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1)))))))) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread4Thread1of1ForFork0_~#t5~0.base|) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork5_~#t2~0.base|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (< (select (select (store (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ (select (select .cse2 c_~X_0~0.base) .cse1) 1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork5_~#t2~0.base|) (= c_~X_0~0.offset 0))) is different from false