/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-two-queue.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 09:49:23,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 09:49:23,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 09:49:23,086 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 09:49:23,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 09:49:23,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 09:49:23,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 09:49:23,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 09:49:23,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 09:49:23,127 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 09:49:23,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 09:49:23,127 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 09:49:23,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 09:49:23,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 09:49:23,130 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 09:49:23,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 09:49:23,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 09:49:23,130 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 09:49:23,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 09:49:23,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 09:49:23,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 09:49:23,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 09:49:23,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 09:49:23,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 09:49:23,132 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 09:49:23,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 09:49:23,133 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 09:49:23,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 09:49:23,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 09:49:23,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 09:49:23,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 09:49:23,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 09:49:23,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 09:49:23,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 09:49:23,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 09:49:23,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 09:49:23,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 09:49:23,136 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 09:49:23,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 09:49:23,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 09:49:23,136 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 09:49:23,136 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 09:49:23,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 09:49:23,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 09:49:23,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 09:49:23,404 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 09:49:23,405 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 09:49:23,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-two-queue.wvr_bound2.c [2023-08-04 09:49:24,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 09:49:24,840 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 09:49:24,841 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-two-queue.wvr_bound2.c [2023-08-04 09:49:24,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2248c87/5f95bbf217e34e0d8081edee906b4478/FLAG08e64bbf5 [2023-08-04 09:49:24,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb2248c87/5f95bbf217e34e0d8081edee906b4478 [2023-08-04 09:49:24,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 09:49:24,872 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 09:49:24,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 09:49:24,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 09:49:24,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 09:49:24,878 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 09:49:24" (1/1) ... [2023-08-04 09:49:24,879 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f273f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:49:24, skipping insertion in model container [2023-08-04 09:49:24,879 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 09:49:24" (1/1) ... [2023-08-04 09:49:24,905 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 09:49:25,093 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-two-queue.wvr_bound2.c[3149,3162] [2023-08-04 09:49:25,103 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 09:49:25,115 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 09:49:25,133 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-two-queue.wvr_bound2.c[3149,3162] [2023-08-04 09:49:25,141 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 09:49:25,147 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 09:49:25,148 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 09:49:25,153 INFO L206 MainTranslator]: Completed translation [2023-08-04 09:49:25,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:49:25 WrapperNode [2023-08-04 09:49:25,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 09:49:25,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 09:49:25,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 09:49:25,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 09:49:25,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:49:25" (1/1) ... [2023-08-04 09:49:25,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:49:25" (1/1) ... [2023-08-04 09:49:25,189 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 239 [2023-08-04 09:49:25,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 09:49:25,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 09:49:25,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 09:49:25,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 09:49:25,198 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:49:25" (1/1) ... [2023-08-04 09:49:25,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:49:25" (1/1) ... [2023-08-04 09:49:25,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:49:25" (1/1) ... [2023-08-04 09:49:25,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:49:25" (1/1) ... [2023-08-04 09:49:25,210 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:49:25" (1/1) ... [2023-08-04 09:49:25,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:49:25" (1/1) ... [2023-08-04 09:49:25,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:49:25" (1/1) ... [2023-08-04 09:49:25,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:49:25" (1/1) ... [2023-08-04 09:49:25,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 09:49:25,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 09:49:25,221 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 09:49:25,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 09:49:25,222 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:49:25" (1/1) ... [2023-08-04 09:49:25,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 09:49:25,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:49:25,263 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-04 09:49:25,291 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-04 09:49:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 09:49:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 09:49:25,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 09:49:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 09:49:25,308 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 09:49:25,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 09:49:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 09:49:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 09:49:25,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 09:49:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 09:49:25,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-04 09:49:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 09:49:25,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 09:49:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 09:49:25,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 09:49:25,313 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 09:49:25,427 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 09:49:25,428 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 09:49:25,728 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 09:49:25,802 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 09:49:25,802 INFO L302 CfgBuilder]: Removed 8 assume(true) statements. [2023-08-04 09:49:25,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:49:25 BoogieIcfgContainer [2023-08-04 09:49:25,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 09:49:25,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 09:49:25,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 09:49:25,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 09:49:25,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 09:49:24" (1/3) ... [2023-08-04 09:49:25,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bd2ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:49:25, skipping insertion in model container [2023-08-04 09:49:25,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:49:25" (2/3) ... [2023-08-04 09:49:25,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13bd2ce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:49:25, skipping insertion in model container [2023-08-04 09:49:25,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:49:25" (3/3) ... [2023-08-04 09:49:25,816 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-two-queue.wvr_bound2.c [2023-08-04 09:49:25,823 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 09:49:25,831 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 09:49:25,831 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 09:49:25,831 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 09:49:25,896 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 09:49:25,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 200 transitions, 422 flow [2023-08-04 09:49:26,085 INFO L124 PetriNetUnfolderBase]: 40/340 cut-off events. [2023-08-04 09:49:26,086 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:49:26,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 340 events. 40/340 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 877 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2023-08-04 09:49:26,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 200 transitions, 422 flow [2023-08-04 09:49:26,103 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 200 transitions, 422 flow [2023-08-04 09:49:26,106 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:49:26,113 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 200 transitions, 422 flow [2023-08-04 09:49:26,115 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 200 transitions, 422 flow [2023-08-04 09:49:26,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 200 transitions, 422 flow [2023-08-04 09:49:26,166 INFO L124 PetriNetUnfolderBase]: 40/340 cut-off events. [2023-08-04 09:49:26,167 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:49:26,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 340 events. 40/340 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 877 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2023-08-04 09:49:26,175 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2023-08-04 09:49:32,074 INFO L134 LiptonReduction]: Checked pairs total: 4895 [2023-08-04 09:49:32,074 INFO L136 LiptonReduction]: Total number of compositions: 195 [2023-08-04 09:49:32,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 09:49:32,091 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@1791ee31, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:49:32,092 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 09:49:32,103 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:49:32,103 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2023-08-04 09:49:32,103 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:49:32,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:49:32,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:49:32,105 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:49:32,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:49:32,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1968411867, now seen corresponding path program 1 times [2023-08-04 09:49:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:49:32,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813243091] [2023-08-04 09:49:32,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:32,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:49:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:32,385 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-04 09:49:32,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:49:32,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813243091] [2023-08-04 09:49:32,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813243091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:49:32,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:49:32,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:49:32,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572455565] [2023-08-04 09:49:32,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:49:32,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:49:32,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:49:32,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:49:32,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:49:32,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 395 [2023-08-04 09:49:32,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 36 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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-04 09:49:32,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:49:32,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 395 [2023-08-04 09:49:32,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:49:32,556 INFO L124 PetriNetUnfolderBase]: 334/574 cut-off events. [2023-08-04 09:49:32,556 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-08-04 09:49:32,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 574 events. 334/574 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2205 event pairs, 105 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 976. Up to 543 conditions per place. [2023-08-04 09:49:32,560 INFO L140 encePairwiseOnDemand]: 391/395 looper letters, 33 selfloop transitions, 2 changer transitions 3/40 dead transitions. [2023-08-04 09:49:32,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 174 flow [2023-08-04 09:49:32,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:49:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:49:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 554 transitions. [2023-08-04 09:49:32,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675105485232067 [2023-08-04 09:49:32,575 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 554 transitions. [2023-08-04 09:49:32,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 554 transitions. [2023-08-04 09:49:32,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:49:32,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 554 transitions. [2023-08-04 09:49:32,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 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-04 09:49:32,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 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-04 09:49:32,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 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-04 09:49:32,589 INFO L175 Difference]: Start difference. First operand has 33 places, 36 transitions, 94 flow. Second operand 3 states and 554 transitions. [2023-08-04 09:49:32,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 174 flow [2023-08-04 09:49:32,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 174 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:49:32,594 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 92 flow [2023-08-04 09:49:32,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2023-08-04 09:49:32,598 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2023-08-04 09:49:32,598 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 92 flow [2023-08-04 09:49:32,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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-04 09:49:32,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:49:32,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:49:32,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 09:49:32,599 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:49:32,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:49:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash 119408986, now seen corresponding path program 1 times [2023-08-04 09:49:32,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:49:32,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384036892] [2023-08-04 09:49:32,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:32,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:49:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 09:49:32,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:49:32,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384036892] [2023-08-04 09:49:32,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384036892] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:49:32,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17114661] [2023-08-04 09:49:32,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:32,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:32,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:49:32,676 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-04 09:49:32,699 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-04 09:49:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:32,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:49:32,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:49:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 09:49:32,795 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:49:32,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17114661] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:49:32,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:49:32,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:49:32,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670912625] [2023-08-04 09:49:32,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:49:32,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:49:32,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:49:32,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:49:32,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:49:32,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 395 [2023-08-04 09:49:32,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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-04 09:49:32,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:49:32,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 395 [2023-08-04 09:49:32,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:49:32,913 INFO L124 PetriNetUnfolderBase]: 330/563 cut-off events. [2023-08-04 09:49:32,913 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-04 09:49:32,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 563 events. 330/563 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2042 event pairs, 112 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 972. Up to 494 conditions per place. [2023-08-04 09:49:32,916 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 37 selfloop transitions, 2 changer transitions 1/42 dead transitions. [2023-08-04 09:49:32,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 190 flow [2023-08-04 09:49:32,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:49:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:49:32,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 557 transitions. [2023-08-04 09:49:32,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.470042194092827 [2023-08-04 09:49:32,927 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 557 transitions. [2023-08-04 09:49:32,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 557 transitions. [2023-08-04 09:49:32,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:49:32,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 557 transitions. [2023-08-04 09:49:32,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 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-04 09:49:32,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 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-04 09:49:32,933 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 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-04 09:49:32,933 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 92 flow. Second operand 3 states and 557 transitions. [2023-08-04 09:49:32,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 190 flow [2023-08-04 09:49:32,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 180 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 09:49:32,936 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 90 flow [2023-08-04 09:49:32,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2023-08-04 09:49:32,937 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2023-08-04 09:49:32,937 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 90 flow [2023-08-04 09:49:32,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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-04 09:49:32,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:49:32,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:49:32,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 09:49:33,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:33,147 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:49:33,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:49:33,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1987555881, now seen corresponding path program 1 times [2023-08-04 09:49:33,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:49:33,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065608510] [2023-08-04 09:49:33,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:33,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:49:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 09:49:33,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:49:33,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065608510] [2023-08-04 09:49:33,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065608510] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:49:33,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737229084] [2023-08-04 09:49:33,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:33,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:33,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:49:33,217 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-04 09:49:33,220 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-04 09:49:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:33,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:49:33,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:49:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:49:33,302 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:49:33,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737229084] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:49:33,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:49:33,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:49:33,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123571538] [2023-08-04 09:49:33,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:49:33,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:49:33,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:49:33,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:49:33,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:49:33,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 395 [2023-08-04 09:49:33,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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-04 09:49:33,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:49:33,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 395 [2023-08-04 09:49:33,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:49:33,397 INFO L124 PetriNetUnfolderBase]: 218/387 cut-off events. [2023-08-04 09:49:33,397 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-08-04 09:49:33,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 387 events. 218/387 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1224 event pairs, 102 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 233. Up to 266 conditions per place. [2023-08-04 09:49:33,399 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 41 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-04 09:49:33,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 45 transitions, 204 flow [2023-08-04 09:49:33,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:49:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:49:33,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2023-08-04 09:49:33,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47257383966244726 [2023-08-04 09:49:33,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 560 transitions. [2023-08-04 09:49:33,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 560 transitions. [2023-08-04 09:49:33,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:49:33,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 560 transitions. [2023-08-04 09:49:33,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 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-04 09:49:33,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 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-04 09:49:33,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 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-04 09:49:33,406 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 90 flow. Second operand 3 states and 560 transitions. [2023-08-04 09:49:33,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 45 transitions, 204 flow [2023-08-04 09:49:33,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 45 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 09:49:33,408 INFO L231 Difference]: Finished difference. Result has 33 places, 34 transitions, 98 flow [2023-08-04 09:49:33,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=33, PETRI_TRANSITIONS=34} [2023-08-04 09:49:33,409 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2023-08-04 09:49:33,409 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 34 transitions, 98 flow [2023-08-04 09:49:33,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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-04 09:49:33,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:49:33,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:49:33,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 09:49:33,619 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,SelfDestructingSolverStorable2 [2023-08-04 09:49:33,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:49:33,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:49:33,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1065701945, now seen corresponding path program 1 times [2023-08-04 09:49:33,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:49:33,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770706391] [2023-08-04 09:49:33,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:33,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:49:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:49:33,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:49:33,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770706391] [2023-08-04 09:49:33,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770706391] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:49:33,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561594828] [2023-08-04 09:49:33,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:33,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:33,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:49:33,717 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-04 09:49:33,720 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-04 09:49:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:33,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:49:33,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:49:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:49:33,809 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:49:33,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561594828] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:49:33,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:49:33,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-04 09:49:33,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275418003] [2023-08-04 09:49:33,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:49:33,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:49:33,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:49:33,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:49:33,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:49:33,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 395 [2023-08-04 09:49:33,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 34 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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-04 09:49:33,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:49:33,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 395 [2023-08-04 09:49:33,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:49:33,924 INFO L124 PetriNetUnfolderBase]: 209/372 cut-off events. [2023-08-04 09:49:33,924 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-08-04 09:49:33,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841 conditions, 372 events. 209/372 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1151 event pairs, 139 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 379. Up to 327 conditions per place. [2023-08-04 09:49:33,926 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 37 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2023-08-04 09:49:33,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 43 transitions, 198 flow [2023-08-04 09:49:33,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:49:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:49:33,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 557 transitions. [2023-08-04 09:49:33,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.470042194092827 [2023-08-04 09:49:33,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 557 transitions. [2023-08-04 09:49:33,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 557 transitions. [2023-08-04 09:49:33,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:49:33,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 557 transitions. [2023-08-04 09:49:33,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 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-04 09:49:33,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 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-04 09:49:33,939 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 395.0) internal successors, (1580), 4 states have internal predecessors, (1580), 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-04 09:49:33,939 INFO L175 Difference]: Start difference. First operand has 33 places, 34 transitions, 98 flow. Second operand 3 states and 557 transitions. [2023-08-04 09:49:33,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 43 transitions, 198 flow [2023-08-04 09:49:33,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:49:33,942 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 100 flow [2023-08-04 09:49:33,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2023-08-04 09:49:33,943 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2023-08-04 09:49:33,943 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 100 flow [2023-08-04 09:49:33,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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-04 09:49:33,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:49:33,944 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] [2023-08-04 09:49:33,949 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-04 09:49:34,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:34,145 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:49:34,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:49:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1800148265, now seen corresponding path program 1 times [2023-08-04 09:49:34,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:49:34,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163030473] [2023-08-04 09:49:34,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:34,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:49:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:49:34,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:49:34,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163030473] [2023-08-04 09:49:34,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163030473] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:49:34,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596855882] [2023-08-04 09:49:34,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:34,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:34,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:49:34,259 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-04 09:49:34,265 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-04 09:49:34,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:34,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:49:34,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:49:34,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:49:34,379 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:49:34,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:49:34,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596855882] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:49:34,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:49:34,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:49:34,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149298860] [2023-08-04 09:49:34,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:49:34,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:49:34,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:49:34,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:49:34,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:49:34,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 395 [2023-08-04 09:49:34,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 176.2) internal successors, (881), 5 states have internal predecessors, (881), 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-04 09:49:34,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:49:34,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 395 [2023-08-04 09:49:34,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:49:34,456 INFO L124 PetriNetUnfolderBase]: 11/27 cut-off events. [2023-08-04 09:49:34,456 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:49:34,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 27 events. 11/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 4/27 useless extension candidates. Maximal degree in co-relation 59. Up to 16 conditions per place. [2023-08-04 09:49:34,457 INFO L140 encePairwiseOnDemand]: 392/395 looper letters, 0 selfloop transitions, 0 changer transitions 17/17 dead transitions. [2023-08-04 09:49:34,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 17 transitions, 72 flow [2023-08-04 09:49:34,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:49:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:49:34,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 702 transitions. [2023-08-04 09:49:34,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4443037974683544 [2023-08-04 09:49:34,460 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 702 transitions. [2023-08-04 09:49:34,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 702 transitions. [2023-08-04 09:49:34,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:49:34,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 702 transitions. [2023-08-04 09:49:34,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.5) internal successors, (702), 4 states have internal predecessors, (702), 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-04 09:49:34,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 395.0) internal successors, (1975), 5 states have internal predecessors, (1975), 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-04 09:49:34,466 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 395.0) internal successors, (1975), 5 states have internal predecessors, (1975), 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-04 09:49:34,466 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 100 flow. Second operand 4 states and 702 transitions. [2023-08-04 09:49:34,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 17 transitions, 72 flow [2023-08-04 09:49:34,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 17 transitions, 70 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:49:34,467 INFO L231 Difference]: Finished difference. Result has 19 places, 0 transitions, 0 flow [2023-08-04 09:49:34,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=395, PETRI_DIFFERENCE_MINUEND_FLOW=26, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=12, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=19, PETRI_TRANSITIONS=0} [2023-08-04 09:49:34,469 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -14 predicate places. [2023-08-04 09:49:34,469 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 0 transitions, 0 flow [2023-08-04 09:49:34,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.2) internal successors, (881), 5 states have internal predecessors, (881), 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-04 09:49:34,472 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 09:49:34,480 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-04 09:49:34,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:34,678 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 09:49:34,680 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 09:49:34,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 200 transitions, 422 flow [2023-08-04 09:49:34,718 INFO L124 PetriNetUnfolderBase]: 40/340 cut-off events. [2023-08-04 09:49:34,718 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:49:34,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 340 events. 40/340 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 877 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2023-08-04 09:49:34,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 200 transitions, 422 flow [2023-08-04 09:49:34,721 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 200 transitions, 422 flow [2023-08-04 09:49:34,721 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:49:34,721 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 200 transitions, 422 flow [2023-08-04 09:49:34,721 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 200 transitions, 422 flow [2023-08-04 09:49:34,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 200 transitions, 422 flow [2023-08-04 09:49:34,771 INFO L124 PetriNetUnfolderBase]: 40/340 cut-off events. [2023-08-04 09:49:34,772 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:49:34,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 340 events. 40/340 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 877 event pairs, 0 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 218. Up to 8 conditions per place. [2023-08-04 09:49:34,774 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2023-08-04 09:49:39,959 INFO L134 LiptonReduction]: Checked pairs total: 5241 [2023-08-04 09:49:39,959 INFO L136 LiptonReduction]: Total number of compositions: 196 [2023-08-04 09:49:39,961 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 09:49:39,962 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@1791ee31, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:49:39,962 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 09:49:39,966 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:49:39,966 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2023-08-04 09:49:39,966 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:49:39,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:49:39,967 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-04 09:49:39,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 09:49:39,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:49:39,967 INFO L85 PathProgramCache]: Analyzing trace with hash 24838974, now seen corresponding path program 1 times [2023-08-04 09:49:39,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:49:39,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040848849] [2023-08-04 09:49:39,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:39,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:49:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:49:39,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 09:49:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:49:40,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 09:49:40,023 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 09:49:40,023 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 09:49:40,024 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 09:49:40,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 09:49:40,024 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 09:49:40,025 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 09:49:40,025 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 09:49:40,025 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 09:49:40,044 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 09:49:40,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 226 transitions, 500 flow [2023-08-04 09:49:40,146 INFO L124 PetriNetUnfolderBase]: 141/915 cut-off events. [2023-08-04 09:49:40,147 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 09:49:40,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 915 events. 141/915 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4245 event pairs, 2 based on Foata normal form. 0/771 useless extension candidates. Maximal degree in co-relation 573. Up to 32 conditions per place. [2023-08-04 09:49:40,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 206 places, 226 transitions, 500 flow [2023-08-04 09:49:40,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 226 transitions, 500 flow [2023-08-04 09:49:40,155 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:49:40,155 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 226 transitions, 500 flow [2023-08-04 09:49:40,155 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 226 transitions, 500 flow [2023-08-04 09:49:40,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 226 transitions, 500 flow [2023-08-04 09:49:40,235 INFO L124 PetriNetUnfolderBase]: 141/915 cut-off events. [2023-08-04 09:49:40,235 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 09:49:40,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1012 conditions, 915 events. 141/915 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4245 event pairs, 2 based on Foata normal form. 0/771 useless extension candidates. Maximal degree in co-relation 573. Up to 32 conditions per place. [2023-08-04 09:49:40,254 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-08-04 09:49:45,109 INFO L134 LiptonReduction]: Checked pairs total: 25206 [2023-08-04 09:49:45,109 INFO L136 LiptonReduction]: Total number of compositions: 192 [2023-08-04 09:49:45,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 09:49:45,112 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@1791ee31, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:49:45,112 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 09:49:45,114 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:49:45,114 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2023-08-04 09:49:45,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:49:45,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:49:45,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:49:45,115 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:49:45,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:49:45,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1359658389, now seen corresponding path program 1 times [2023-08-04 09:49:45,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:49:45,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913149048] [2023-08-04 09:49:45,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:45,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:49:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:45,162 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-04 09:49:45,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:49:45,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913149048] [2023-08-04 09:49:45,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913149048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:49:45,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:49:45,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:49:45,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556413347] [2023-08-04 09:49:45,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:49:45,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:49:45,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:49:45,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:49:45,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:49:45,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 418 [2023-08-04 09:49:45,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 60 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-04 09:49:45,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:49:45,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 418 [2023-08-04 09:49:45,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:49:47,092 INFO L124 PetriNetUnfolderBase]: 16934/24195 cut-off events. [2023-08-04 09:49:47,092 INFO L125 PetriNetUnfolderBase]: For 2188/2188 co-relation queries the response was YES. [2023-08-04 09:49:47,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47764 conditions, 24195 events. 16934/24195 cut-off events. For 2188/2188 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 148276 event pairs, 8831 based on Foata normal form. 0/22435 useless extension candidates. Maximal degree in co-relation 12372. Up to 22095 conditions per place. [2023-08-04 09:49:47,259 INFO L140 encePairwiseOnDemand]: 414/418 looper letters, 49 selfloop transitions, 2 changer transitions 2/65 dead transitions. [2023-08-04 09:49:47,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 280 flow [2023-08-04 09:49:47,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:49:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:49:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2023-08-04 09:49:47,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48724082934609253 [2023-08-04 09:49:47,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 611 transitions. [2023-08-04 09:49:47,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 611 transitions. [2023-08-04 09:49:47,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:49:47,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 611 transitions. [2023-08-04 09:49:47,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 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-04 09:49:47,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:49:47,267 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:49:47,267 INFO L175 Difference]: Start difference. First operand has 55 places, 60 transitions, 168 flow. Second operand 3 states and 611 transitions. [2023-08-04 09:49:47,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 280 flow [2023-08-04 09:49:47,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:49:47,275 INFO L231 Difference]: Finished difference. Result has 57 places, 58 transitions, 166 flow [2023-08-04 09:49:47,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=57, PETRI_TRANSITIONS=58} [2023-08-04 09:49:47,276 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2023-08-04 09:49:47,276 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 58 transitions, 166 flow [2023-08-04 09:49:47,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 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-04 09:49:47,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:49:47,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:49:47,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 09:49:47,277 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:49:47,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:49:47,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1527154211, now seen corresponding path program 1 times [2023-08-04 09:49:47,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:49:47,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303671156] [2023-08-04 09:49:47,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:47,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:49:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:47,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 09:49:47,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:49:47,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303671156] [2023-08-04 09:49:47,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303671156] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:49:47,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564834661] [2023-08-04 09:49:47,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:47,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:47,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:49:47,337 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-04 09:49:47,340 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-04 09:49:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:47,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:49:47,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:49:47,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 09:49:47,426 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:49:47,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564834661] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:49:47,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:49:47,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:49:47,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102634649] [2023-08-04 09:49:47,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:49:47,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:49:47,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:49:47,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:49:47,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:49:47,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 418 [2023-08-04 09:49:47,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 58 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 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-04 09:49:47,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:49:47,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 418 [2023-08-04 09:49:47,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:49:49,238 INFO L124 PetriNetUnfolderBase]: 16914/23904 cut-off events. [2023-08-04 09:49:49,238 INFO L125 PetriNetUnfolderBase]: For 1838/1838 co-relation queries the response was YES. [2023-08-04 09:49:49,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47332 conditions, 23904 events. 16914/23904 cut-off events. For 1838/1838 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 142405 event pairs, 8806 based on Foata normal form. 0/22187 useless extension candidates. Maximal degree in co-relation 47281. Up to 21726 conditions per place. [2023-08-04 09:49:49,350 INFO L140 encePairwiseOnDemand]: 415/418 looper letters, 58 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-08-04 09:49:49,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 314 flow [2023-08-04 09:49:49,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:49:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:49:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2023-08-04 09:49:49,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49282296650717705 [2023-08-04 09:49:49,353 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 618 transitions. [2023-08-04 09:49:49,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 618 transitions. [2023-08-04 09:49:49,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:49:49,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 618 transitions. [2023-08-04 09:49:49,355 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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-04 09:49:49,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:49:49,357 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:49:49,357 INFO L175 Difference]: Start difference. First operand has 57 places, 58 transitions, 166 flow. Second operand 3 states and 618 transitions. [2023-08-04 09:49:49,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 314 flow [2023-08-04 09:49:49,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 72 transitions, 306 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 09:49:49,364 INFO L231 Difference]: Finished difference. Result has 55 places, 59 transitions, 170 flow [2023-08-04 09:49:49,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=55, PETRI_TRANSITIONS=59} [2023-08-04 09:49:49,365 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 0 predicate places. [2023-08-04 09:49:49,367 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 59 transitions, 170 flow [2023-08-04 09:49:49,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.33333333333334) internal successors, (568), 3 states have internal predecessors, (568), 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-04 09:49:49,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:49:49,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:49:49,376 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-04 09:49:49,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:49,576 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:49:49,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:49:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2116922390, now seen corresponding path program 1 times [2023-08-04 09:49:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:49:49,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727057567] [2023-08-04 09:49:49,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:49,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:49:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 09:49:49,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:49:49,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727057567] [2023-08-04 09:49:49,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727057567] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:49:49,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709814916] [2023-08-04 09:49:49,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:49,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:49,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:49:49,630 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-04 09:49:49,632 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-04 09:49:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:49,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:49:49,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:49:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:49:49,717 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:49:49,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709814916] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:49:49,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:49:49,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:49:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891136438] [2023-08-04 09:49:49,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:49:49,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:49:49,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:49:49,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:49:49,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:49:49,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 418 [2023-08-04 09:49:49,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 59 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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-04 09:49:49,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:49:49,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 418 [2023-08-04 09:49:49,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:49:50,947 INFO L124 PetriNetUnfolderBase]: 13778/19469 cut-off events. [2023-08-04 09:49:50,947 INFO L125 PetriNetUnfolderBase]: For 1445/1445 co-relation queries the response was YES. [2023-08-04 09:49:50,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39774 conditions, 19469 events. 13778/19469 cut-off events. For 1445/1445 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 113732 event pairs, 7032 based on Foata normal form. 0/18696 useless extension candidates. Maximal degree in co-relation 11410. Up to 13322 conditions per place. [2023-08-04 09:49:51,056 INFO L140 encePairwiseOnDemand]: 415/418 looper letters, 67 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2023-08-04 09:49:51,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 81 transitions, 362 flow [2023-08-04 09:49:51,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:49:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:49:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2023-08-04 09:49:51,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49920255183413076 [2023-08-04 09:49:51,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 626 transitions. [2023-08-04 09:49:51,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 626 transitions. [2023-08-04 09:49:51,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:49:51,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 626 transitions. [2023-08-04 09:49:51,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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-04 09:49:51,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:49:51,063 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:49:51,063 INFO L175 Difference]: Start difference. First operand has 55 places, 59 transitions, 170 flow. Second operand 3 states and 626 transitions. [2023-08-04 09:49:51,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 81 transitions, 362 flow [2023-08-04 09:49:51,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 81 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:49:51,069 INFO L231 Difference]: Finished difference. Result has 57 places, 60 transitions, 180 flow [2023-08-04 09:49:51,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2023-08-04 09:49:51,071 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2023-08-04 09:49:51,071 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 180 flow [2023-08-04 09:49:51,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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-04 09:49:51,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:49:51,071 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] [2023-08-04 09:49:51,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 09:49:51,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:51,280 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:49:51,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:49:51,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1128958464, now seen corresponding path program 1 times [2023-08-04 09:49:51,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:49:51,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889453499] [2023-08-04 09:49:51,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:51,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:49:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:51,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:49:51,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:49:51,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889453499] [2023-08-04 09:49:51,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889453499] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:49:51,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343659176] [2023-08-04 09:49:51,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:51,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:51,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:49:51,448 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-04 09:49:51,474 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-04 09:49:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:51,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:49:51,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:49:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:49:51,565 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:49:51,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343659176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:49:51,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:49:51,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-04 09:49:51,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718526795] [2023-08-04 09:49:51,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:49:51,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:49:51,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:49:51,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:49:51,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:49:51,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 418 [2023-08-04 09:49:51,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 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-04 09:49:51,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:49:51,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 418 [2023-08-04 09:49:51,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:49:52,783 INFO L124 PetriNetUnfolderBase]: 13381/19250 cut-off events. [2023-08-04 09:49:52,783 INFO L125 PetriNetUnfolderBase]: For 3826/3826 co-relation queries the response was YES. [2023-08-04 09:49:52,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40688 conditions, 19250 events. 13381/19250 cut-off events. For 3826/3826 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 114077 event pairs, 8135 based on Foata normal form. 0/19082 useless extension candidates. Maximal degree in co-relation 12199. Up to 14746 conditions per place. [2023-08-04 09:49:52,868 INFO L140 encePairwiseOnDemand]: 415/418 looper letters, 68 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2023-08-04 09:49:52,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 374 flow [2023-08-04 09:49:52,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:49:52,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:49:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2023-08-04 09:49:52,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49920255183413076 [2023-08-04 09:49:52,872 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 626 transitions. [2023-08-04 09:49:52,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 626 transitions. [2023-08-04 09:49:52,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:49:52,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 626 transitions. [2023-08-04 09:49:52,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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-04 09:49:52,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:49:52,876 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:49:52,876 INFO L175 Difference]: Start difference. First operand has 57 places, 60 transitions, 180 flow. Second operand 3 states and 626 transitions. [2023-08-04 09:49:52,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 374 flow [2023-08-04 09:49:52,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:49:52,911 INFO L231 Difference]: Finished difference. Result has 59 places, 61 transitions, 190 flow [2023-08-04 09:49:52,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=59, PETRI_TRANSITIONS=61} [2023-08-04 09:49:52,912 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2023-08-04 09:49:52,912 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 190 flow [2023-08-04 09:49:52,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 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-04 09:49:52,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:49:52,912 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] [2023-08-04 09:49:52,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 09:49:53,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:53,118 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:49:53,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:49:53,119 INFO L85 PathProgramCache]: Analyzing trace with hash 752306592, now seen corresponding path program 1 times [2023-08-04 09:49:53,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:49:53,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411395107] [2023-08-04 09:49:53,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:53,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:49:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:49:53,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:49:53,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411395107] [2023-08-04 09:49:53,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411395107] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:49:53,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482356041] [2023-08-04 09:49:53,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:53,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:53,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:49:53,171 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:49:53,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 09:49:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:53,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:49:53,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:49:53,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:49:53,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:49:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:49:53,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482356041] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:49:53,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:49:53,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:49:53,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588779210] [2023-08-04 09:49:53,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:49:53,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:49:53,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:49:53,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:49:53,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:49:53,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 418 [2023-08-04 09:49:53,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 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-04 09:49:53,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:49:53,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 418 [2023-08-04 09:49:53,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:49:54,354 INFO L124 PetriNetUnfolderBase]: 12185/17423 cut-off events. [2023-08-04 09:49:54,355 INFO L125 PetriNetUnfolderBase]: For 3290/3290 co-relation queries the response was YES. [2023-08-04 09:49:54,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37215 conditions, 17423 events. 12185/17423 cut-off events. For 3290/3290 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 100796 event pairs, 4239 based on Foata normal form. 4/17378 useless extension candidates. Maximal degree in co-relation 27304. Up to 16137 conditions per place. [2023-08-04 09:49:54,470 INFO L140 encePairwiseOnDemand]: 414/418 looper letters, 59 selfloop transitions, 3 changer transitions 1/75 dead transitions. [2023-08-04 09:49:54,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 344 flow [2023-08-04 09:49:54,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:49:54,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:49:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 801 transitions. [2023-08-04 09:49:54,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47906698564593303 [2023-08-04 09:49:54,473 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 801 transitions. [2023-08-04 09:49:54,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 801 transitions. [2023-08-04 09:49:54,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:49:54,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 801 transitions. [2023-08-04 09:49:54,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 200.25) internal successors, (801), 4 states have internal predecessors, (801), 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-04 09:49:54,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 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-04 09:49:54,482 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 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-04 09:49:54,482 INFO L175 Difference]: Start difference. First operand has 59 places, 61 transitions, 190 flow. Second operand 4 states and 801 transitions. [2023-08-04 09:49:54,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 344 flow [2023-08-04 09:49:54,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:49:54,546 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 202 flow [2023-08-04 09:49:54,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2023-08-04 09:49:54,547 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 8 predicate places. [2023-08-04 09:49:54,547 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 202 flow [2023-08-04 09:49:54,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.0) internal successors, (950), 5 states have internal predecessors, (950), 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-04 09:49:54,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:49:54,548 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:49:54,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 09:49:54,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-04 09:49:54,749 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:49:54,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:49:54,750 INFO L85 PathProgramCache]: Analyzing trace with hash 768134946, now seen corresponding path program 1 times [2023-08-04 09:49:54,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:49:54,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24677930] [2023-08-04 09:49:54,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:54,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:49:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 09:49:54,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:49:54,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24677930] [2023-08-04 09:49:54,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24677930] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:49:54,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926441228] [2023-08-04 09:49:54,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:54,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:54,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:49:54,822 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:49:54,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 09:49:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:54,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:49:54,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:49:54,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 09:49:54,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:49:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 09:49:54,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926441228] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:49:54,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:49:54,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:49:54,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242690396] [2023-08-04 09:49:54,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:49:54,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:49:54,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:49:54,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:49:54,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:49:54,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 418 [2023-08-04 09:49:54,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 190.2) internal successors, (951), 5 states have internal predecessors, (951), 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-04 09:49:54,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:49:54,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 418 [2023-08-04 09:49:54,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:49:55,963 INFO L124 PetriNetUnfolderBase]: 11625/16379 cut-off events. [2023-08-04 09:49:55,963 INFO L125 PetriNetUnfolderBase]: For 1679/1679 co-relation queries the response was YES. [2023-08-04 09:49:55,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35142 conditions, 16379 events. 11625/16379 cut-off events. For 1679/1679 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 91301 event pairs, 3682 based on Foata normal form. 64/16425 useless extension candidates. Maximal degree in co-relation 25343. Up to 12308 conditions per place. [2023-08-04 09:49:56,033 INFO L140 encePairwiseOnDemand]: 414/418 looper letters, 75 selfloop transitions, 3 changer transitions 1/91 dead transitions. [2023-08-04 09:49:56,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 91 transitions, 420 flow [2023-08-04 09:49:56,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:49:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:49:56,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 817 transitions. [2023-08-04 09:49:56,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48863636363636365 [2023-08-04 09:49:56,038 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 817 transitions. [2023-08-04 09:49:56,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 817 transitions. [2023-08-04 09:49:56,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:49:56,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 817 transitions. [2023-08-04 09:49:56,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 204.25) internal successors, (817), 4 states have internal predecessors, (817), 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-04 09:49:56,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 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-04 09:49:56,043 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 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-04 09:49:56,043 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 202 flow. Second operand 4 states and 817 transitions. [2023-08-04 09:49:56,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 91 transitions, 420 flow [2023-08-04 09:49:56,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 411 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 09:49:56,093 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 207 flow [2023-08-04 09:49:56,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2023-08-04 09:49:56,094 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 10 predicate places. [2023-08-04 09:49:56,094 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 207 flow [2023-08-04 09:49:56,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.2) internal successors, (951), 5 states have internal predecessors, (951), 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-04 09:49:56,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:49:56,095 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:49:56,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 09:49:56,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:56,300 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:49:56,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:49:56,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1634425622, now seen corresponding path program 1 times [2023-08-04 09:49:56,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:49:56,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405763703] [2023-08-04 09:49:56,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:49:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:49:56,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:49:56,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405763703] [2023-08-04 09:49:56,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405763703] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:49:56,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696145013] [2023-08-04 09:49:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:56,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:56,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:49:56,362 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:49:56,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-04 09:49:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:56,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:49:56,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:49:56,477 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:49:56,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:49:56,491 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:49:56,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696145013] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:49:56,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:49:56,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:49:56,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742352624] [2023-08-04 09:49:56,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:49:56,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:49:56,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:49:56,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:49:56,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:49:56,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 418 [2023-08-04 09:49:56,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 190.4) internal successors, (952), 5 states have internal predecessors, (952), 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-04 09:49:56,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:49:56,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 418 [2023-08-04 09:49:56,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:49:57,214 INFO L124 PetriNetUnfolderBase]: 8137/11595 cut-off events. [2023-08-04 09:49:57,214 INFO L125 PetriNetUnfolderBase]: For 4135/4135 co-relation queries the response was YES. [2023-08-04 09:49:57,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25514 conditions, 11595 events. 8137/11595 cut-off events. For 4135/4135 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 61985 event pairs, 2353 based on Foata normal form. 256/11813 useless extension candidates. Maximal degree in co-relation 23553. Up to 4431 conditions per place. [2023-08-04 09:49:57,291 INFO L140 encePairwiseOnDemand]: 414/418 looper letters, 83 selfloop transitions, 4 changer transitions 0/99 dead transitions. [2023-08-04 09:49:57,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 99 transitions, 466 flow [2023-08-04 09:49:57,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:49:57,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:49:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 825 transitions. [2023-08-04 09:49:57,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4934210526315789 [2023-08-04 09:49:57,294 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 825 transitions. [2023-08-04 09:49:57,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 825 transitions. [2023-08-04 09:49:57,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:49:57,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 825 transitions. [2023-08-04 09:49:57,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 206.25) internal successors, (825), 4 states have internal predecessors, (825), 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-04 09:49:57,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 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-04 09:49:57,299 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 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-04 09:49:57,299 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 207 flow. Second operand 4 states and 825 transitions. [2023-08-04 09:49:57,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 99 transitions, 466 flow [2023-08-04 09:49:57,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 99 transitions, 456 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 09:49:57,323 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 218 flow [2023-08-04 09:49:57,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2023-08-04 09:49:57,324 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 12 predicate places. [2023-08-04 09:49:57,324 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 218 flow [2023-08-04 09:49:57,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.4) internal successors, (952), 5 states have internal predecessors, (952), 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-04 09:49:57,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:49:57,325 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:49:57,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-04 09:49:57,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 09:49:57,530 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:49:57,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:49:57,530 INFO L85 PathProgramCache]: Analyzing trace with hash 2045456872, now seen corresponding path program 1 times [2023-08-04 09:49:57,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:49:57,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184240142] [2023-08-04 09:49:57,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:57,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:49:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:49:57,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:49:57,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184240142] [2023-08-04 09:49:57,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184240142] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:49:57,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923088174] [2023-08-04 09:49:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:57,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:49:57,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:49:57,592 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:49:57,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-04 09:49:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:57,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:49:57,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:49:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:49:57,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:49:57,707 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:49:57,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923088174] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:49:57,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:49:57,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 09:49:57,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386233686] [2023-08-04 09:49:57,708 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:49:57,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:49:57,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:49:57,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:49:57,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:49:57,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 418 [2023-08-04 09:49:57,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 190.8) internal successors, (954), 5 states have internal predecessors, (954), 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-04 09:49:57,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:49:57,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 418 [2023-08-04 09:49:57,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:49:58,412 INFO L124 PetriNetUnfolderBase]: 8121/11616 cut-off events. [2023-08-04 09:49:58,412 INFO L125 PetriNetUnfolderBase]: For 5856/5856 co-relation queries the response was YES. [2023-08-04 09:49:58,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26666 conditions, 11616 events. 8121/11616 cut-off events. For 5856/5856 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 62585 event pairs, 5681 based on Foata normal form. 17/11531 useless extension candidates. Maximal degree in co-relation 24684. Up to 10024 conditions per place. [2023-08-04 09:49:58,468 INFO L140 encePairwiseOnDemand]: 414/418 looper letters, 83 selfloop transitions, 3 changer transitions 2/100 dead transitions. [2023-08-04 09:49:58,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 100 transitions, 478 flow [2023-08-04 09:49:58,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:49:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:49:58,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 825 transitions. [2023-08-04 09:49:58,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4934210526315789 [2023-08-04 09:49:58,479 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 825 transitions. [2023-08-04 09:49:58,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 825 transitions. [2023-08-04 09:49:58,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:49:58,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 825 transitions. [2023-08-04 09:49:58,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 206.25) internal successors, (825), 4 states have internal predecessors, (825), 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-04 09:49:58,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 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-04 09:49:58,485 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 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-04 09:49:58,485 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 218 flow. Second operand 4 states and 825 transitions. [2023-08-04 09:49:58,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 100 transitions, 478 flow [2023-08-04 09:49:58,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 474 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 09:49:58,520 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 222 flow [2023-08-04 09:49:58,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-08-04 09:49:58,521 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2023-08-04 09:49:58,521 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 222 flow [2023-08-04 09:49:58,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.8) internal successors, (954), 5 states have internal predecessors, (954), 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-04 09:49:58,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:49:58,522 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:49:58,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 09:49:58,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 09:49:58,728 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:49:58,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:49:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1677078178, now seen corresponding path program 1 times [2023-08-04 09:49:58,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:49:58,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506694499] [2023-08-04 09:49:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:49:58,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:49:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:49:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 09:49:58,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:49:58,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506694499] [2023-08-04 09:49:58,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506694499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:49:58,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:49:58,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 09:49:58,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784907113] [2023-08-04 09:49:58,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:49:58,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:49:58,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:49:58,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:49:58,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:49:58,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 418 [2023-08-04 09:49:58,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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-04 09:49:58,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:49:58,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 418 [2023-08-04 09:49:58,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:49:59,860 INFO L124 PetriNetUnfolderBase]: 10870/16452 cut-off events. [2023-08-04 09:49:59,860 INFO L125 PetriNetUnfolderBase]: For 9038/9038 co-relation queries the response was YES. [2023-08-04 09:49:59,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36342 conditions, 16452 events. 10870/16452 cut-off events. For 9038/9038 co-relation queries the response was YES. Maximal size of possible extension queue 658. Compared 108265 event pairs, 2086 based on Foata normal form. 1/16392 useless extension candidates. Maximal degree in co-relation 35974. Up to 11323 conditions per place. [2023-08-04 09:49:59,974 INFO L140 encePairwiseOnDemand]: 412/418 looper letters, 81 selfloop transitions, 5 changer transitions 1/99 dead transitions. [2023-08-04 09:49:59,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 99 transitions, 562 flow [2023-08-04 09:49:59,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:49:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:49:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 638 transitions. [2023-08-04 09:49:59,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2023-08-04 09:49:59,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 638 transitions. [2023-08-04 09:49:59,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 638 transitions. [2023-08-04 09:49:59,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:49:59,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 638 transitions. [2023-08-04 09:49:59,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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-04 09:49:59,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:49:59,981 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:49:59,981 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 222 flow. Second operand 3 states and 638 transitions. [2023-08-04 09:49:59,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 99 transitions, 562 flow [2023-08-04 09:50:00,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 99 transitions, 546 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 09:50:00,015 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 247 flow [2023-08-04 09:50:00,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2023-08-04 09:50:00,016 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 16 predicate places. [2023-08-04 09:50:00,016 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 247 flow [2023-08-04 09:50:00,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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-04 09:50:00,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:50:00,017 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:50:00,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 09:50:00,017 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:50:00,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:50:00,017 INFO L85 PathProgramCache]: Analyzing trace with hash 977817718, now seen corresponding path program 1 times [2023-08-04 09:50:00,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:50:00,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695412549] [2023-08-04 09:50:00,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:50:00,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:50:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:50:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:50:00,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:50:00,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695412549] [2023-08-04 09:50:00,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695412549] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:50:00,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:50:00,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:50:00,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313466356] [2023-08-04 09:50:00,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:50:00,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:50:00,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:50:00,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:50:00,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:50:00,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 418 [2023-08-04 09:50:00,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 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-04 09:50:00,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:50:00,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 418 [2023-08-04 09:50:00,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:50:02,130 INFO L124 PetriNetUnfolderBase]: 21062/29241 cut-off events. [2023-08-04 09:50:02,130 INFO L125 PetriNetUnfolderBase]: For 17001/17001 co-relation queries the response was YES. [2023-08-04 09:50:02,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74293 conditions, 29241 events. 21062/29241 cut-off events. For 17001/17001 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 177211 event pairs, 7362 based on Foata normal form. 0/27499 useless extension candidates. Maximal degree in co-relation 73822. Up to 16167 conditions per place. [2023-08-04 09:50:02,365 INFO L140 encePairwiseOnDemand]: 410/418 looper letters, 90 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2023-08-04 09:50:02,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 622 flow [2023-08-04 09:50:02,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:50:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:50:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2023-08-04 09:50:02,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023923444976076 [2023-08-04 09:50:02,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 630 transitions. [2023-08-04 09:50:02,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 630 transitions. [2023-08-04 09:50:02,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:50:02,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 630 transitions. [2023-08-04 09:50:02,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-04 09:50:02,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:50:02,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:50:02,371 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 247 flow. Second operand 3 states and 630 transitions. [2023-08-04 09:50:02,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 622 flow [2023-08-04 09:50:02,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 615 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:50:02,484 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 306 flow [2023-08-04 09:50:02,484 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2023-08-04 09:50:02,484 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 19 predicate places. [2023-08-04 09:50:02,484 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 306 flow [2023-08-04 09:50:02,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 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-04 09:50:02,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:50:02,485 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:50:02,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 09:50:02,485 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:50:02,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:50:02,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1916394234, now seen corresponding path program 1 times [2023-08-04 09:50:02,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:50:02,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860239090] [2023-08-04 09:50:02,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:50:02,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:50:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:50:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:50:02,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:50:02,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860239090] [2023-08-04 09:50:02,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860239090] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:50:02,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:50:02,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 09:50:02,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333929711] [2023-08-04 09:50:02,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:50:02,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 09:50:02,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:50:02,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 09:50:02,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 09:50:02,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 418 [2023-08-04 09:50:02,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 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-04 09:50:02,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:50:02,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 418 [2023-08-04 09:50:02,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:50:04,643 INFO L124 PetriNetUnfolderBase]: 17746/25696 cut-off events. [2023-08-04 09:50:04,644 INFO L125 PetriNetUnfolderBase]: For 29505/29505 co-relation queries the response was YES. [2023-08-04 09:50:04,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72455 conditions, 25696 events. 17746/25696 cut-off events. For 29505/29505 co-relation queries the response was YES. Maximal size of possible extension queue 960. Compared 162635 event pairs, 12157 based on Foata normal form. 662/26093 useless extension candidates. Maximal degree in co-relation 71891. Up to 22208 conditions per place. [2023-08-04 09:50:04,778 INFO L140 encePairwiseOnDemand]: 411/418 looper letters, 56 selfloop transitions, 2 changer transitions 34/106 dead transitions. [2023-08-04 09:50:04,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 106 transitions, 652 flow [2023-08-04 09:50:04,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:50:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:50:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 800 transitions. [2023-08-04 09:50:04,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4784688995215311 [2023-08-04 09:50:04,780 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 800 transitions. [2023-08-04 09:50:04,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 800 transitions. [2023-08-04 09:50:04,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:50:04,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 800 transitions. [2023-08-04 09:50:04,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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-04 09:50:04,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 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-04 09:50:04,785 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 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-04 09:50:04,785 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 306 flow. Second operand 4 states and 800 transitions. [2023-08-04 09:50:04,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 106 transitions, 652 flow [2023-08-04 09:50:04,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 106 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 09:50:04,941 INFO L231 Difference]: Finished difference. Result has 77 places, 72 transitions, 310 flow [2023-08-04 09:50:04,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=77, PETRI_TRANSITIONS=72} [2023-08-04 09:50:04,942 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 22 predicate places. [2023-08-04 09:50:04,942 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 310 flow [2023-08-04 09:50:04,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 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-04 09:50:04,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:50:04,943 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:50:04,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-04 09:50:04,943 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:50:04,943 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:50:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash -689878827, now seen corresponding path program 1 times [2023-08-04 09:50:04,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:50:04,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493602585] [2023-08-04 09:50:04,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:50:04,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:50:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:50:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-04 09:50:05,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:50:05,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493602585] [2023-08-04 09:50:05,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493602585] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:50:05,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:50:05,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:50:05,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217912375] [2023-08-04 09:50:05,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:50:05,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:50:05,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:50:05,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:50:05,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:50:05,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 418 [2023-08-04 09:50:05,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 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-04 09:50:05,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:50:05,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 418 [2023-08-04 09:50:05,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:50:06,878 INFO L124 PetriNetUnfolderBase]: 21516/31026 cut-off events. [2023-08-04 09:50:06,878 INFO L125 PetriNetUnfolderBase]: For 28219/28239 co-relation queries the response was YES. [2023-08-04 09:50:07,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87249 conditions, 31026 events. 21516/31026 cut-off events. For 28219/28239 co-relation queries the response was YES. Maximal size of possible extension queue 1044. Compared 195255 event pairs, 10956 based on Foata normal form. 3/29521 useless extension candidates. Maximal degree in co-relation 87220. Up to 20255 conditions per place. [2023-08-04 09:50:07,154 INFO L140 encePairwiseOnDemand]: 410/418 looper letters, 99 selfloop transitions, 6 changer transitions 0/115 dead transitions. [2023-08-04 09:50:07,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 115 transitions, 717 flow [2023-08-04 09:50:07,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:50:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:50:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2023-08-04 09:50:07,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023923444976076 [2023-08-04 09:50:07,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 630 transitions. [2023-08-04 09:50:07,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 630 transitions. [2023-08-04 09:50:07,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:50:07,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 630 transitions. [2023-08-04 09:50:07,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 210.0) internal successors, (630), 3 states have internal predecessors, (630), 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-04 09:50:07,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:50:07,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:50:07,160 INFO L175 Difference]: Start difference. First operand has 77 places, 72 transitions, 310 flow. Second operand 3 states and 630 transitions. [2023-08-04 09:50:07,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 115 transitions, 717 flow [2023-08-04 09:50:07,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 115 transitions, 713 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 09:50:07,378 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 374 flow [2023-08-04 09:50:07,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=374, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2023-08-04 09:50:07,378 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 24 predicate places. [2023-08-04 09:50:07,378 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 374 flow [2023-08-04 09:50:07,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 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-04 09:50:07,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:50:07,379 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:50:07,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-04 09:50:07,379 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:50:07,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:50:07,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1897941875, now seen corresponding path program 2 times [2023-08-04 09:50:07,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:50:07,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77529918] [2023-08-04 09:50:07,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:50:07,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:50:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:50:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:50:07,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:50:07,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77529918] [2023-08-04 09:50:07,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77529918] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:50:07,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853745755] [2023-08-04 09:50:07,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 09:50:07,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:50:07,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:50:07,481 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:50:07,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-04 09:50:07,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 09:50:07,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:50:07,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 09:50:07,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:50:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:50:07,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:50:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:50:07,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853745755] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:50:07,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:50:07,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2023-08-04 09:50:07,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569487327] [2023-08-04 09:50:07,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:50:07,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-04 09:50:07,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:50:07,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-04 09:50:07,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-08-04 09:50:07,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 418 [2023-08-04 09:50:07,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 374 flow. Second operand has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 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-04 09:50:07,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:50:07,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 418 [2023-08-04 09:50:07,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:50:14,454 INFO L124 PetriNetUnfolderBase]: 59961/85479 cut-off events. [2023-08-04 09:50:14,454 INFO L125 PetriNetUnfolderBase]: For 131434/132946 co-relation queries the response was YES. [2023-08-04 09:50:14,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267862 conditions, 85479 events. 59961/85479 cut-off events. For 131434/132946 co-relation queries the response was YES. Maximal size of possible extension queue 2453. Compared 602518 event pairs, 2975 based on Foata normal form. 692/83199 useless extension candidates. Maximal degree in co-relation 267826. Up to 34640 conditions per place. [2023-08-04 09:50:15,132 INFO L140 encePairwiseOnDemand]: 401/418 looper letters, 269 selfloop transitions, 37 changer transitions 1/315 dead transitions. [2023-08-04 09:50:15,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 315 transitions, 2178 flow [2023-08-04 09:50:15,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 09:50:15,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 09:50:15,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1655 transitions. [2023-08-04 09:50:15,140 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49491626794258375 [2023-08-04 09:50:15,141 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1655 transitions. [2023-08-04 09:50:15,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1655 transitions. [2023-08-04 09:50:15,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:50:15,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1655 transitions. [2023-08-04 09:50:15,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 206.875) internal successors, (1655), 8 states have internal predecessors, (1655), 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-04 09:50:15,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 418.0) internal successors, (3762), 9 states have internal predecessors, (3762), 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-04 09:50:15,149 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 418.0) internal successors, (3762), 9 states have internal predecessors, (3762), 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-04 09:50:15,149 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 374 flow. Second operand 8 states and 1655 transitions. [2023-08-04 09:50:15,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 315 transitions, 2178 flow [2023-08-04 09:50:16,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 315 transitions, 2078 flow, removed 26 selfloop flow, removed 2 redundant places. [2023-08-04 09:50:16,067 INFO L231 Difference]: Finished difference. Result has 91 places, 110 transitions, 706 flow [2023-08-04 09:50:16,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=706, PETRI_PLACES=91, PETRI_TRANSITIONS=110} [2023-08-04 09:50:16,068 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 36 predicate places. [2023-08-04 09:50:16,068 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 110 transitions, 706 flow [2023-08-04 09:50:16,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 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-04 09:50:16,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:50:16,069 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:50:16,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-04 09:50:16,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:50:16,269 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:50:16,269 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:50:16,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1078270790, now seen corresponding path program 1 times [2023-08-04 09:50:16,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:50:16,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121119815] [2023-08-04 09:50:16,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:50:16,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:50:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:50:16,313 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 09:50:16,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:50:16,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121119815] [2023-08-04 09:50:16,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121119815] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:50:16,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:50:16,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:50:16,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832227625] [2023-08-04 09:50:16,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:50:16,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:50:16,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:50:16,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:50:16,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:50:16,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 418 [2023-08-04 09:50:16,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 110 transitions, 706 flow. Second operand has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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-04 09:50:16,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:50:16,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 418 [2023-08-04 09:50:16,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:50:23,576 INFO L124 PetriNetUnfolderBase]: 54815/78509 cut-off events. [2023-08-04 09:50:23,576 INFO L125 PetriNetUnfolderBase]: For 239236/242557 co-relation queries the response was YES. [2023-08-04 09:50:24,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301200 conditions, 78509 events. 54815/78509 cut-off events. For 239236/242557 co-relation queries the response was YES. Maximal size of possible extension queue 2387. Compared 555443 event pairs, 22859 based on Foata normal form. 1896/79395 useless extension candidates. Maximal degree in co-relation 301156. Up to 54287 conditions per place. [2023-08-04 09:50:24,336 INFO L140 encePairwiseOnDemand]: 410/418 looper letters, 143 selfloop transitions, 6 changer transitions 0/163 dead transitions. [2023-08-04 09:50:24,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 163 transitions, 1355 flow [2023-08-04 09:50:24,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:50:24,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:50:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 625 transitions. [2023-08-04 09:50:24,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984051036682616 [2023-08-04 09:50:24,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 625 transitions. [2023-08-04 09:50:24,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 625 transitions. [2023-08-04 09:50:24,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:50:24,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 625 transitions. [2023-08-04 09:50:24,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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-04 09:50:24,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:50:24,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 418.0) internal successors, (1672), 4 states have internal predecessors, (1672), 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-04 09:50:24,342 INFO L175 Difference]: Start difference. First operand has 91 places, 110 transitions, 706 flow. Second operand 3 states and 625 transitions. [2023-08-04 09:50:24,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 163 transitions, 1355 flow [2023-08-04 09:50:25,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 163 transitions, 1340 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-04 09:50:25,132 INFO L231 Difference]: Finished difference. Result has 94 places, 116 transitions, 785 flow [2023-08-04 09:50:25,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=94, PETRI_TRANSITIONS=116} [2023-08-04 09:50:25,132 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 39 predicate places. [2023-08-04 09:50:25,132 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 116 transitions, 785 flow [2023-08-04 09:50:25,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.0) internal successors, (576), 3 states have internal predecessors, (576), 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-04 09:50:25,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:50:25,133 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:50:25,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-04 09:50:25,133 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:50:25,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:50:25,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1610919898, now seen corresponding path program 1 times [2023-08-04 09:50:25,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:50:25,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577640889] [2023-08-04 09:50:25,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:50:25,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:50:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:50:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:50:25,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:50:25,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577640889] [2023-08-04 09:50:25,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577640889] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:50:25,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:50:25,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:50:25,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474335500] [2023-08-04 09:50:25,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:50:25,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 09:50:25,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:50:25,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 09:50:25,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 09:50:25,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 418 [2023-08-04 09:50:25,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 116 transitions, 785 flow. Second operand has 4 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 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-04 09:50:25,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:50:25,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 418 [2023-08-04 09:50:25,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:50:32,168 INFO L124 PetriNetUnfolderBase]: 54028/76749 cut-off events. [2023-08-04 09:50:32,168 INFO L125 PetriNetUnfolderBase]: For 278082/280008 co-relation queries the response was YES. [2023-08-04 09:50:32,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314858 conditions, 76749 events. 54028/76749 cut-off events. For 278082/280008 co-relation queries the response was YES. Maximal size of possible extension queue 2069. Compared 518089 event pairs, 12212 based on Foata normal form. 176/76864 useless extension candidates. Maximal degree in co-relation 314813. Up to 70066 conditions per place. [2023-08-04 09:50:33,004 INFO L140 encePairwiseOnDemand]: 405/418 looper letters, 125 selfloop transitions, 5 changer transitions 38/176 dead transitions. [2023-08-04 09:50:33,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 176 transitions, 1530 flow [2023-08-04 09:50:33,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:50:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:50:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 809 transitions. [2023-08-04 09:50:33,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4838516746411483 [2023-08-04 09:50:33,007 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 809 transitions. [2023-08-04 09:50:33,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 809 transitions. [2023-08-04 09:50:33,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:50:33,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 809 transitions. [2023-08-04 09:50:33,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 202.25) internal successors, (809), 4 states have internal predecessors, (809), 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-04 09:50:33,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 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-04 09:50:33,010 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 418.0) internal successors, (2090), 5 states have internal predecessors, (2090), 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-04 09:50:33,011 INFO L175 Difference]: Start difference. First operand has 94 places, 116 transitions, 785 flow. Second operand 4 states and 809 transitions. [2023-08-04 09:50:33,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 176 transitions, 1530 flow [2023-08-04 09:50:34,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 176 transitions, 1502 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-04 09:50:34,002 INFO L231 Difference]: Finished difference. Result has 97 places, 116 transitions, 796 flow [2023-08-04 09:50:34,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=796, PETRI_PLACES=97, PETRI_TRANSITIONS=116} [2023-08-04 09:50:34,002 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 42 predicate places. [2023-08-04 09:50:34,002 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 116 transitions, 796 flow [2023-08-04 09:50:34,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 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-04 09:50:34,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:50:34,003 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:50:34,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-04 09:50:34,003 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:50:34,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:50:34,003 INFO L85 PathProgramCache]: Analyzing trace with hash -564894498, now seen corresponding path program 2 times [2023-08-04 09:50:34,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:50:34,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331285836] [2023-08-04 09:50:34,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:50:34,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:50:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:50:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 09:50:34,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:50:34,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331285836] [2023-08-04 09:50:34,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331285836] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:50:34,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417591562] [2023-08-04 09:50:34,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 09:50:34,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:50:34,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:50:34,099 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:50:34,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-04 09:50:34,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 09:50:34,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:50:34,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-04 09:50:34,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:50:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:50:34,268 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:50:34,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417591562] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:50:34,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:50:34,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-08-04 09:50:34,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582030880] [2023-08-04 09:50:34,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:50:34,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 09:50:34,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:50:34,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 09:50:34,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-04 09:50:34,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 418 [2023-08-04 09:50:34,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 116 transitions, 796 flow. Second operand has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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-04 09:50:34,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:50:34,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 418 [2023-08-04 09:50:34,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:50:40,888 INFO L124 PetriNetUnfolderBase]: 44917/65301 cut-off events. [2023-08-04 09:50:40,889 INFO L125 PetriNetUnfolderBase]: For 255259/259591 co-relation queries the response was YES. [2023-08-04 09:50:41,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260150 conditions, 65301 events. 44917/65301 cut-off events. For 255259/259591 co-relation queries the response was YES. Maximal size of possible extension queue 2172. Compared 466963 event pairs, 21398 based on Foata normal form. 137/63638 useless extension candidates. Maximal degree in co-relation 259520. Up to 59497 conditions per place. [2023-08-04 09:50:41,764 INFO L140 encePairwiseOnDemand]: 410/418 looper letters, 95 selfloop transitions, 2 changer transitions 19/136 dead transitions. [2023-08-04 09:50:41,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 136 transitions, 1127 flow [2023-08-04 09:50:41,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:50:41,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:50:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 967 transitions. [2023-08-04 09:50:41,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4626794258373206 [2023-08-04 09:50:41,766 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 967 transitions. [2023-08-04 09:50:41,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 967 transitions. [2023-08-04 09:50:41,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:50:41,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 967 transitions. [2023-08-04 09:50:41,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 193.4) internal successors, (967), 5 states have internal predecessors, (967), 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-04 09:50:41,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 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-04 09:50:41,770 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 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-04 09:50:41,770 INFO L175 Difference]: Start difference. First operand has 97 places, 116 transitions, 796 flow. Second operand 5 states and 967 transitions. [2023-08-04 09:50:41,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 136 transitions, 1127 flow [2023-08-04 09:50:42,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 136 transitions, 1093 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-04 09:50:42,316 INFO L231 Difference]: Finished difference. Result has 100 places, 117 transitions, 784 flow [2023-08-04 09:50:42,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=784, PETRI_PLACES=100, PETRI_TRANSITIONS=117} [2023-08-04 09:50:42,317 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 45 predicate places. [2023-08-04 09:50:42,317 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 117 transitions, 784 flow [2023-08-04 09:50:42,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 188.0) internal successors, (752), 4 states have internal predecessors, (752), 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-04 09:50:42,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:50:42,317 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:50:42,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-04 09:50:42,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-04 09:50:42,519 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:50:42,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:50:42,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1439512622, now seen corresponding path program 1 times [2023-08-04 09:50:42,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:50:42,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978512847] [2023-08-04 09:50:42,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:50:42,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:50:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:50:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:50:42,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:50:42,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978512847] [2023-08-04 09:50:42,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978512847] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:50:42,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632570812] [2023-08-04 09:50:42,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:50:42,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:50:42,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:50:42,629 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:50:42,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-04 09:50:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:50:42,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 09:50:42,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:50:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:50:42,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:50:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:50:42,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632570812] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:50:42,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:50:42,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2023-08-04 09:50:42,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999398402] [2023-08-04 09:50:42,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:50:42,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-04 09:50:42,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:50:42,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-04 09:50:42,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-08-04 09:50:42,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 418 [2023-08-04 09:50:42,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 117 transitions, 784 flow. Second operand has 9 states, 9 states have (on average 182.33333333333334) internal successors, (1641), 9 states have internal predecessors, (1641), 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-04 09:50:42,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:50:42,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 418 [2023-08-04 09:50:42,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:50:51,911 INFO L124 PetriNetUnfolderBase]: 64120/89797 cut-off events. [2023-08-04 09:50:51,911 INFO L125 PetriNetUnfolderBase]: For 324311/325285 co-relation queries the response was YES. [2023-08-04 09:50:52,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371685 conditions, 89797 events. 64120/89797 cut-off events. For 324311/325285 co-relation queries the response was YES. Maximal size of possible extension queue 2418. Compared 606535 event pairs, 8345 based on Foata normal form. 827/90560 useless extension candidates. Maximal degree in co-relation 371646. Up to 51331 conditions per place. [2023-08-04 09:50:52,806 INFO L140 encePairwiseOnDemand]: 401/418 looper letters, 253 selfloop transitions, 37 changer transitions 0/298 dead transitions. [2023-08-04 09:50:52,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 298 transitions, 2454 flow [2023-08-04 09:50:52,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 09:50:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 09:50:52,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1602 transitions. [2023-08-04 09:50:52,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47906698564593303 [2023-08-04 09:50:52,809 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1602 transitions. [2023-08-04 09:50:52,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1602 transitions. [2023-08-04 09:50:52,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:50:52,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1602 transitions. [2023-08-04 09:50:52,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 200.25) internal successors, (1602), 8 states have internal predecessors, (1602), 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-04 09:50:52,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 418.0) internal successors, (3762), 9 states have internal predecessors, (3762), 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-04 09:50:52,814 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 418.0) internal successors, (3762), 9 states have internal predecessors, (3762), 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-04 09:50:52,814 INFO L175 Difference]: Start difference. First operand has 100 places, 117 transitions, 784 flow. Second operand 8 states and 1602 transitions. [2023-08-04 09:50:52,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 298 transitions, 2454 flow [2023-08-04 09:50:53,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 298 transitions, 2432 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-04 09:50:53,264 INFO L231 Difference]: Finished difference. Result has 108 places, 141 transitions, 1141 flow [2023-08-04 09:50:53,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=418, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1141, PETRI_PLACES=108, PETRI_TRANSITIONS=141} [2023-08-04 09:50:53,265 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 53 predicate places. [2023-08-04 09:50:53,265 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 141 transitions, 1141 flow [2023-08-04 09:50:53,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 182.33333333333334) internal successors, (1641), 9 states have internal predecessors, (1641), 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-04 09:50:53,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:50:53,266 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:50:53,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-04 09:50:53,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:50:53,470 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:50:53,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:50:53,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1991912464, now seen corresponding path program 1 times [2023-08-04 09:50:53,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:50:53,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483769333] [2023-08-04 09:50:53,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:50:53,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:50:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:50:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 09:50:55,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:50:55,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483769333] [2023-08-04 09:50:55,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483769333] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:50:55,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225235071] [2023-08-04 09:50:55,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:50:55,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:50:55,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:50:55,663 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:50:55,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-04 09:50:55,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:50:55,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 60 conjunts are in the unsatisfiable core [2023-08-04 09:50:55,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:50:55,966 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 11 treesize of output 7 [2023-08-04 09:50:56,092 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-04 09:50:56,169 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-04 09:50:56,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:50:56,424 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 25 treesize of output 25 [2023-08-04 09:50:56,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:50:56,509 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 25 treesize of output 25 [2023-08-04 09:50:57,055 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-08-04 09:50:57,056 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 52 treesize of output 18 [2023-08-04 09:50:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 09:50:57,313 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:50:58,105 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse3 (* c_~q1_front~0 4)) (.cse4 (* c_~q1_back~0 4))) (and (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (select (select .cse0 c_~q2~0.base) .cse1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse2 (select .cse0 ~q1~0.base))) (or (< (+ 1 (select .cse2 (+ .cse3 ~q1~0.offset))) c_~N~0) (not (= c_~j~0 (select .cse2 (+ .cse4 ~q1~0.offset)))))))))) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (+ (select (select .cse5 c_~q2~0.base) .cse1) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse6 (select .cse5 ~q1~0.base))) (or (< (select .cse6 (+ .cse3 ~q1~0.offset)) c_~N~0) (not (= c_~j~0 (select .cse6 (+ .cse4 ~q1~0.offset)))))))))))) is different from false [2023-08-04 09:50:59,290 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:50:59,290 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 118 treesize of output 82 [2023-08-04 09:50:59,330 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:50:59,330 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 333 treesize of output 385 [2023-08-04 09:50:59,382 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:50:59,382 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 208 [2023-08-04 09:50:59,415 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:50:59,416 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 152 [2023-08-04 09:51:17,044 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:51:17,045 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 118 treesize of output 82 [2023-08-04 09:51:17,098 INFO L322 Elim1Store]: treesize reduction 46, result has 50.5 percent of original size [2023-08-04 09:51:17,098 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 247 treesize of output 261 [2023-08-04 09:51:17,147 INFO L322 Elim1Store]: treesize reduction 36, result has 55.6 percent of original size [2023-08-04 09:51:17,147 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 157 treesize of output 177 [2023-08-04 09:51:17,177 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:51:17,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 173 treesize of output 177 [2023-08-04 09:51:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 8 not checked. [2023-08-04 09:51:21,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225235071] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:51:21,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:51:21,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 17] total 56 [2023-08-04 09:51:21,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985470850] [2023-08-04 09:51:21,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:51:21,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-08-04 09:51:21,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:51:21,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-08-04 09:51:21,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2884, Unknown=7, NotChecked=108, Total=3192 [2023-08-04 09:51:21,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 418 [2023-08-04 09:51:21,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 141 transitions, 1141 flow. Second operand has 57 states, 57 states have (on average 86.6842105263158) internal successors, (4941), 57 states have internal predecessors, (4941), 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-04 09:51:21,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:51:21,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 418 [2023-08-04 09:51:21,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:51:31,497 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| c_~q2~0.base)) (.cse8 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (let ((.cse16 (= c_~q2_front~0 c_~q2_back~0)) (.cse15 (= c_~q1_back~0 c_~q1_front~0)) (.cse13 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0) 1)) (.cse6 (+ c_~i~0 1)) (.cse0 (< c_~q2_back~0 0)) (.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse5 (* c_~q1_front~0 4)) (.cse4 (* c_~q1_back~0 4)) (.cse12 (<= c_~n2~0 c_~q2_back~0)) (.cse23 (not (= c_~i~0 (select .cse18 .cse8))))) (and (<= 0 c_~i~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~j~0 c_~i~0) (or .cse0 (and (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse1 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse3 (select .cse1 ~q1~0.base))) (or (< (select (select .cse1 c_~q2~0.base) .cse2) c_~i~0) (not (= (select .cse3 (+ .cse4 ~q1~0.offset)) c_~j~0)) (< (select .cse3 (+ .cse5 ~q1~0.offset)) .cse6))))) (not (= (select (select .cse7 c_~q2~0.base) .cse8) c_~i~0))))) (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse10 (select .cse9 ~q1~0.base))) (or (< (select (select .cse9 c_~q2~0.base) .cse2) .cse6) (not (= (select .cse10 (+ .cse4 ~q1~0.offset)) c_~j~0)) (< (select .cse10 (+ .cse5 ~q1~0.offset)) c_~i~0))))) (not (= (select (select .cse11 c_~q2~0.base) .cse8) c_~i~0)))))) .cse12) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= .cse13 |c_#pthreadsForks|) (or .cse0 (let ((.cse14 (< c_~j~0 c_~i~0))) (and (or .cse14 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< c_~j~0 .cse6) .cse15 (or .cse16 .cse14))) .cse12 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) .cse16 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (= |c_ULTIMATE.start_main_~asdf~0#1| 0) (or (let ((.cse17 (select .cse18 .cse2))) (and (< .cse17 c_~i~0) (or (< c_~i~0 (+ c_~N~0 1)) (< (+ .cse17 1) c_~N~0)))) (< c_~i~0 c_~N~0)) (<= c_~j~0 0) .cse15 (<= |c_#pthreadsForks| .cse13) (or .cse0 (and (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse20 (select .cse19 ~q1~0.base))) (or (< (select (select .cse19 c_~q2~0.base) .cse2) c_~i~0) (< (select .cse20 (+ .cse5 ~q1~0.offset)) .cse6) (not (= c_~j~0 (select .cse20 (+ .cse4 ~q1~0.offset)))))))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse22 (select .cse21 ~q1~0.base))) (or (< (select (select .cse21 c_~q2~0.base) .cse2) .cse6) (not (= c_~j~0 (select .cse22 (+ .cse4 ~q1~0.offset)))) (< (select .cse22 (+ .cse5 ~q1~0.offset)) c_~i~0)))))) .cse12 .cse23) (or .cse0 (and (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (select (select .cse24 c_~q2~0.base) .cse2) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse25 (select .cse24 ~q1~0.base))) (or (< (+ 1 (select .cse25 (+ .cse5 ~q1~0.offset))) c_~N~0) (not (= c_~j~0 (select .cse25 (+ .cse4 ~q1~0.offset)))))))))) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (+ (select (select .cse26 c_~q2~0.base) .cse2) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse27 (select .cse26 ~q1~0.base))) (or (< (select .cse27 (+ .cse5 ~q1~0.offset)) c_~N~0) (not (= c_~j~0 (select .cse27 (+ .cse4 ~q1~0.offset))))))))))) .cse12 .cse23) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)))) is different from false [2023-08-04 09:51:32,023 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| c_~q2~0.base)) (.cse8 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (let ((.cse13 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0) 1)) (.cse6 (+ c_~i~0 1)) (.cse0 (< c_~q2_back~0 0)) (.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse5 (* c_~q1_front~0 4)) (.cse4 (* c_~q1_back~0 4)) (.cse12 (<= c_~n2~0 c_~q2_back~0)) (.cse20 (not (= c_~i~0 (select .cse15 .cse8))))) (and (<= 0 c_~i~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~j~0 c_~i~0) (or .cse0 (and (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse1 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse3 (select .cse1 ~q1~0.base))) (or (< (select (select .cse1 c_~q2~0.base) .cse2) c_~i~0) (not (= (select .cse3 (+ .cse4 ~q1~0.offset)) c_~j~0)) (< (select .cse3 (+ .cse5 ~q1~0.offset)) .cse6))))) (not (= (select (select .cse7 c_~q2~0.base) .cse8) c_~i~0))))) (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse10 (select .cse9 ~q1~0.base))) (or (< (select (select .cse9 c_~q2~0.base) .cse2) .cse6) (not (= (select .cse10 (+ .cse4 ~q1~0.offset)) c_~j~0)) (< (select .cse10 (+ .cse5 ~q1~0.offset)) c_~i~0))))) (not (= (select (select .cse11 c_~q2~0.base) .cse8) c_~i~0)))))) .cse12) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= .cse13 |c_#pthreadsForks|) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (= c_~q2_front~0 c_~q2_back~0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (= |c_ULTIMATE.start_main_~asdf~0#1| 0) (or (let ((.cse14 (select .cse15 .cse2))) (and (< .cse14 c_~i~0) (or (< c_~i~0 (+ c_~N~0 1)) (< (+ .cse14 1) c_~N~0)))) (< c_~i~0 c_~N~0)) (<= c_~j~0 0) (= c_~q1_back~0 c_~q1_front~0) (<= |c_#pthreadsForks| .cse13) (or .cse0 (and (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse17 (select .cse16 ~q1~0.base))) (or (< (select (select .cse16 c_~q2~0.base) .cse2) c_~i~0) (< (select .cse17 (+ .cse5 ~q1~0.offset)) .cse6) (not (= c_~j~0 (select .cse17 (+ .cse4 ~q1~0.offset)))))))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse19 (select .cse18 ~q1~0.base))) (or (< (select (select .cse18 c_~q2~0.base) .cse2) .cse6) (not (= c_~j~0 (select .cse19 (+ .cse4 ~q1~0.offset)))) (< (select .cse19 (+ .cse5 ~q1~0.offset)) c_~i~0)))))) .cse12 .cse20) (or .cse0 (and (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (select (select .cse21 c_~q2~0.base) .cse2) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse22 (select .cse21 ~q1~0.base))) (or (< (+ 1 (select .cse22 (+ .cse5 ~q1~0.offset))) c_~N~0) (not (= c_~j~0 (select .cse22 (+ .cse4 ~q1~0.offset)))))))))) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (+ (select (select .cse23 c_~q2~0.base) .cse2) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse24 (select .cse23 ~q1~0.base))) (or (< (select .cse24 (+ .cse5 ~q1~0.offset)) c_~N~0) (not (= c_~j~0 (select .cse24 (+ .cse4 ~q1~0.offset))))))))))) .cse12 .cse20) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)))) is different from false [2023-08-04 09:51:41,211 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 103 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 09:51:41,349 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse18 (select |c_#memory_int| c_~q2~0.base)) (.cse8 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (let ((.cse16 (= c_~q2_front~0 c_~q2_back~0)) (.cse15 (= c_~q1_back~0 c_~q1_front~0)) (.cse13 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0) 1)) (.cse6 (+ c_~i~0 1)) (.cse0 (< c_~q2_back~0 0)) (.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse5 (* c_~q1_front~0 4)) (.cse4 (* c_~q1_back~0 4)) (.cse12 (<= c_~n2~0 c_~q2_back~0)) (.cse23 (not (= c_~i~0 (select .cse18 .cse8))))) (and (<= 0 c_~i~0) (not (= |c_ULTIMATE.start_main_~asdf~0#1| 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~j~0 c_~i~0) (or .cse0 (and (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse1 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse3 (select .cse1 ~q1~0.base))) (or (< (select (select .cse1 c_~q2~0.base) .cse2) c_~i~0) (not (= (select .cse3 (+ .cse4 ~q1~0.offset)) c_~j~0)) (< (select .cse3 (+ .cse5 ~q1~0.offset)) .cse6))))) (not (= (select (select .cse7 c_~q2~0.base) .cse8) c_~i~0))))) (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse10 (select .cse9 ~q1~0.base))) (or (< (select (select .cse9 c_~q2~0.base) .cse2) .cse6) (not (= (select .cse10 (+ .cse4 ~q1~0.offset)) c_~j~0)) (< (select .cse10 (+ .cse5 ~q1~0.offset)) c_~i~0))))) (not (= (select (select .cse11 c_~q2~0.base) .cse8) c_~i~0)))))) .cse12) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= .cse13 |c_#pthreadsForks|) (or .cse0 (let ((.cse14 (< c_~j~0 c_~i~0))) (and (or .cse14 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< c_~j~0 .cse6) .cse15 (or .cse16 .cse14))) .cse12 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) .cse16 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (let ((.cse17 (select .cse18 .cse2))) (and (< .cse17 c_~i~0) (or (< c_~i~0 (+ c_~N~0 1)) (< (+ .cse17 1) c_~N~0)))) (< c_~i~0 c_~N~0)) (<= c_~j~0 0) .cse15 (<= |c_#pthreadsForks| .cse13) (or .cse0 (and (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse20 (select .cse19 ~q1~0.base))) (or (< (select (select .cse19 c_~q2~0.base) .cse2) c_~i~0) (< (select .cse20 (+ .cse5 ~q1~0.offset)) .cse6) (not (= c_~j~0 (select .cse20 (+ .cse4 ~q1~0.offset)))))))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse22 (select .cse21 ~q1~0.base))) (or (< (select (select .cse21 c_~q2~0.base) .cse2) .cse6) (not (= c_~j~0 (select .cse22 (+ .cse4 ~q1~0.offset)))) (< (select .cse22 (+ .cse5 ~q1~0.offset)) c_~i~0)))))) .cse12 .cse23) (or .cse0 (and (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (select (select .cse24 c_~q2~0.base) .cse2) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse25 (select .cse24 ~q1~0.base))) (or (< (+ 1 (select .cse25 (+ .cse5 ~q1~0.offset))) c_~N~0) (not (= c_~j~0 (select .cse25 (+ .cse4 ~q1~0.offset)))))))))) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (+ (select (select .cse26 c_~q2~0.base) .cse2) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse27 (select .cse26 ~q1~0.base))) (or (< (select .cse27 (+ .cse5 ~q1~0.offset)) c_~N~0) (not (= c_~j~0 (select .cse27 (+ .cse4 ~q1~0.offset))))))))))) .cse12 .cse23) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)))) is different from false [2023-08-04 09:51:41,367 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse16 (= c_~q2_front~0 c_~q2_back~0)) (.cse15 (= c_~q1_back~0 c_~q1_front~0)) (.cse1 (< c_~q2_back~0 0)) (.cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse7 (+ c_~i~0 1)) (.cse5 (* c_~q1_back~0 4)) (.cse6 (* c_~q1_front~0 4)) (.cse13 (<= c_~n2~0 c_~q2_back~0)) (.cse9 (+ (* c_~q2_back~0 4) c_~q2~0.offset)) (.cse0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0) 1))) (and (<= (+ |c_ULTIMATE.start_main_#t~pre19#1| 1) |c_#pthreadsForks|) (<= 0 c_~i~0) (<= |c_ULTIMATE.start_main_#t~pre19#1| .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~j~0 c_~i~0) (or .cse1 (and (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse2 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse4 (select .cse2 ~q1~0.base))) (or (< (select (select .cse2 c_~q2~0.base) .cse3) c_~i~0) (not (= (select .cse4 (+ .cse5 ~q1~0.offset)) c_~j~0)) (< (select .cse4 (+ .cse6 ~q1~0.offset)) .cse7))))) (not (= (select (select .cse8 c_~q2~0.base) .cse9) c_~i~0))))) (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse10 (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse11 (select .cse10 ~q1~0.base))) (or (< (select (select .cse10 c_~q2~0.base) .cse3) .cse7) (not (= (select .cse11 (+ .cse5 ~q1~0.offset)) c_~j~0)) (< (select .cse11 (+ .cse6 ~q1~0.offset)) c_~i~0))))) (not (= (select (select .cse12 c_~q2~0.base) .cse9) c_~i~0)))))) .cse13) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (or .cse1 (let ((.cse14 (< c_~j~0 c_~i~0))) (and (or .cse14 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (< c_~j~0 .cse7) .cse15 (or .cse16 .cse14))) .cse13 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) .cse16 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= c_~j~0 0) .cse15 (or .cse1 (and (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse18 (select .cse17 ~q1~0.base))) (or (< (select (select .cse17 c_~q2~0.base) .cse3) c_~i~0) (< (select .cse18 (+ .cse6 ~q1~0.offset)) .cse7) (not (= c_~j~0 (select .cse18 (+ .cse5 ~q1~0.offset)))))))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse20 (select .cse19 ~q1~0.base))) (or (< (select (select .cse19 c_~q2~0.base) .cse3) .cse7) (not (= c_~j~0 (select .cse20 (+ .cse5 ~q1~0.offset)))) (< (select .cse20 (+ .cse6 ~q1~0.offset)) c_~i~0)))))) .cse13 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) .cse9)))) (<= .cse0 |c_ULTIMATE.start_main_#t~pre19#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2023-08-04 09:51:42,890 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| c_~q2~0.base)) (.cse8 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (let ((.cse13 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0) 1)) (.cse6 (+ c_~i~0 1)) (.cse0 (< c_~q2_back~0 0)) (.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse5 (* c_~q1_front~0 4)) (.cse4 (* c_~q1_back~0 4)) (.cse12 (<= c_~n2~0 c_~q2_back~0)) (.cse20 (not (= c_~i~0 (select .cse15 .cse8))))) (and (<= 0 c_~i~0) (not (= |c_ULTIMATE.start_main_~asdf~0#1| 0)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~j~0 c_~i~0) (or .cse0 (and (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse1 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse3 (select .cse1 ~q1~0.base))) (or (< (select (select .cse1 c_~q2~0.base) .cse2) c_~i~0) (not (= (select .cse3 (+ .cse4 ~q1~0.offset)) c_~j~0)) (< (select .cse3 (+ .cse5 ~q1~0.offset)) .cse6))))) (not (= (select (select .cse7 c_~q2~0.base) .cse8) c_~i~0))))) (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse10 (select .cse9 ~q1~0.base))) (or (< (select (select .cse9 c_~q2~0.base) .cse2) .cse6) (not (= (select .cse10 (+ .cse4 ~q1~0.offset)) c_~j~0)) (< (select .cse10 (+ .cse5 ~q1~0.offset)) c_~i~0))))) (not (= (select (select .cse11 c_~q2~0.base) .cse8) c_~i~0)))))) .cse12) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= .cse13 |c_#pthreadsForks|) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (= c_~q2_front~0 c_~q2_back~0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (let ((.cse14 (select .cse15 .cse2))) (and (< .cse14 c_~i~0) (or (< c_~i~0 (+ c_~N~0 1)) (< (+ .cse14 1) c_~N~0)))) (< c_~i~0 c_~N~0)) (<= c_~j~0 0) (= c_~q1_back~0 c_~q1_front~0) (<= |c_#pthreadsForks| .cse13) (or .cse0 (and (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse17 (select .cse16 ~q1~0.base))) (or (< (select (select .cse16 c_~q2~0.base) .cse2) c_~i~0) (< (select .cse17 (+ .cse5 ~q1~0.offset)) .cse6) (not (= c_~j~0 (select .cse17 (+ .cse4 ~q1~0.offset)))))))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse19 (select .cse18 ~q1~0.base))) (or (< (select (select .cse18 c_~q2~0.base) .cse2) .cse6) (not (= c_~j~0 (select .cse19 (+ .cse4 ~q1~0.offset)))) (< (select .cse19 (+ .cse5 ~q1~0.offset)) c_~i~0)))))) .cse12 .cse20) (or .cse0 (and (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (select (select .cse21 c_~q2~0.base) .cse2) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse22 (select .cse21 ~q1~0.base))) (or (< (+ 1 (select .cse22 (+ .cse5 ~q1~0.offset))) c_~N~0) (not (= c_~j~0 (select .cse22 (+ .cse4 ~q1~0.offset)))))))))) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (+ (select (select .cse23 c_~q2~0.base) .cse2) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse24 (select .cse23 ~q1~0.base))) (or (< (select .cse24 (+ .cse5 ~q1~0.offset)) c_~N~0) (not (= c_~j~0 (select .cse24 (+ .cse4 ~q1~0.offset))))))))))) .cse12 .cse20) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)))) is different from false [2023-08-04 09:51:42,907 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~q2_back~0 0)) (.cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse7 (+ c_~i~0 1)) (.cse5 (* c_~q1_back~0 4)) (.cse6 (* c_~q1_front~0 4)) (.cse13 (<= c_~n2~0 c_~q2_back~0)) (.cse9 (+ (* c_~q2_back~0 4) c_~q2~0.offset)) (.cse0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0) 1))) (and (<= (+ |c_ULTIMATE.start_main_#t~pre19#1| 1) |c_#pthreadsForks|) (<= 0 c_~i~0) (<= |c_ULTIMATE.start_main_#t~pre19#1| .cse0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (= c_~j~0 c_~i~0) (or .cse1 (and (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse2 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse4 (select .cse2 ~q1~0.base))) (or (< (select (select .cse2 c_~q2~0.base) .cse3) c_~i~0) (not (= (select .cse4 (+ .cse5 ~q1~0.offset)) c_~j~0)) (< (select .cse4 (+ .cse6 ~q1~0.offset)) .cse7))))) (not (= (select (select .cse8 c_~q2~0.base) .cse9) c_~i~0))))) (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse10 (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse11 (select .cse10 ~q1~0.base))) (or (< (select (select .cse10 c_~q2~0.base) .cse3) .cse7) (not (= (select .cse11 (+ .cse5 ~q1~0.offset)) c_~j~0)) (< (select .cse11 (+ .cse6 ~q1~0.offset)) c_~i~0))))) (not (= (select (select .cse12 c_~q2~0.base) .cse9) c_~i~0)))))) .cse13) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (= c_~q2_front~0 c_~q2_back~0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (<= c_~j~0 0) (= c_~q1_back~0 c_~q1_front~0) (or .cse1 (and (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse15 (select .cse14 ~q1~0.base))) (or (< (select (select .cse14 c_~q2~0.base) .cse3) c_~i~0) (< (select .cse15 (+ .cse6 ~q1~0.offset)) .cse7) (not (= c_~j~0 (select .cse15 (+ .cse5 ~q1~0.offset)))))))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse17 (select .cse16 ~q1~0.base))) (or (< (select (select .cse16 c_~q2~0.base) .cse3) .cse7) (not (= c_~j~0 (select .cse17 (+ .cse5 ~q1~0.offset)))) (< (select .cse17 (+ .cse6 ~q1~0.offset)) c_~i~0)))))) .cse13 (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) .cse9)))) (<= .cse0 |c_ULTIMATE.start_main_#t~pre19#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2023-08-04 09:51:48,985 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse1 (select |c_#memory_int| c_~q2~0.base))) (and (or (let ((.cse0 (select .cse1 .cse2))) (and (< .cse0 c_~i~0) (or (< c_~i~0 (+ c_~N~0 1)) (< (+ .cse0 1) c_~N~0)))) (< c_~i~0 c_~N~0)) (or (< c_~q2_back~0 0) (let ((.cse5 (* c_~q1_front~0 4)) (.cse6 (* c_~q1_back~0 4))) (and (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (select (select .cse3 c_~q2~0.base) .cse2) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse4 (select .cse3 ~q1~0.base))) (or (< (+ 1 (select .cse4 (+ .cse5 ~q1~0.offset))) c_~N~0) (not (= c_~j~0 (select .cse4 (+ .cse6 ~q1~0.offset)))))))))) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (+ (select (select .cse7 c_~q2~0.base) .cse2) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse8 (select .cse7 ~q1~0.base))) (or (< (select .cse8 (+ .cse5 ~q1~0.offset)) c_~N~0) (not (= c_~j~0 (select .cse8 (+ .cse6 ~q1~0.offset)))))))))))) (<= c_~n2~0 c_~q2_back~0) (not (= c_~i~0 (select .cse1 (+ (* c_~q2_back~0 4) c_~q2~0.offset))))))) is different from false [2023-08-04 09:51:58,893 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~q2~0.base))) (let ((.cse0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0) 1)) (.cse4 (< c_~q2_back~0 0)) (.cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse7 (* c_~q1_front~0 4)) (.cse9 (* c_~q1_back~0 4)) (.cse12 (<= c_~n2~0 c_~q2_back~0)) (.cse13 (not (= c_~i~0 (select .cse2 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))))) (and (<= (+ c_thread1Thread2of2ForFork0_thidvar0 1) |c_#pthreadsForks|) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= .cse0 c_thread1Thread2of2ForFork0_thidvar0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (let ((.cse1 (select .cse2 .cse3))) (and (< .cse1 c_~i~0) (or (< c_~i~0 (+ c_~N~0 1)) (< (+ .cse1 1) c_~N~0)))) (< c_~i~0 c_~N~0)) (= |c_ULTIMATE.start_main_~asdf~1#1| 0) (<= c_thread1Thread2of2ForFork0_thidvar0 .cse0) (or .cse4 (let ((.cse8 (+ c_~i~0 1))) (and (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse6 (select .cse5 ~q1~0.base))) (or (< (select (select .cse5 c_~q2~0.base) .cse3) c_~i~0) (< (select .cse6 (+ .cse7 ~q1~0.offset)) .cse8) (not (= c_~j~0 (select .cse6 (+ .cse9 ~q1~0.offset)))))))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse11 (select .cse10 ~q1~0.base))) (or (< (select (select .cse10 c_~q2~0.base) .cse3) .cse8) (not (= c_~j~0 (select .cse11 (+ .cse9 ~q1~0.offset)))) (< (select .cse11 (+ .cse7 ~q1~0.offset)) c_~i~0))))))) .cse12 .cse13) (or .cse4 (and (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (select (select .cse14 c_~q2~0.base) .cse3) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse15 (select .cse14 ~q1~0.base))) (or (< (+ 1 (select .cse15 (+ .cse7 ~q1~0.offset))) c_~N~0) (not (= c_~j~0 (select .cse15 (+ .cse9 ~q1~0.offset)))))))))) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (+ (select (select .cse16 c_~q2~0.base) .cse3) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse17 (select .cse16 ~q1~0.base))) (or (< (select .cse17 (+ .cse7 ~q1~0.offset)) c_~N~0) (not (= c_~j~0 (select .cse17 (+ .cse9 ~q1~0.offset))))))))))) .cse12 .cse13)))) is different from false [2023-08-04 09:52:04,295 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| c_~q2~0.base)) (.cse8 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (let ((.cse13 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0) 1)) (.cse6 (+ c_~i~0 1)) (.cse0 (< c_~q2_back~0 0)) (.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse5 (* c_~q1_front~0 4)) (.cse4 (* c_~q1_back~0 4)) (.cse12 (<= c_~n2~0 c_~q2_back~0)) (.cse20 (not (= c_~i~0 (select .cse15 .cse8))))) (and (<= (+ c_thread1Thread2of2ForFork0_thidvar0 1) |c_#pthreadsForks|) (or .cse0 (and (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse1 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse3 (select .cse1 ~q1~0.base))) (or (< (select (select .cse1 c_~q2~0.base) .cse2) c_~i~0) (not (= (select .cse3 (+ .cse4 ~q1~0.offset)) c_~j~0)) (< (select .cse3 (+ .cse5 ~q1~0.offset)) .cse6))))) (not (= (select (select .cse7 c_~q2~0.base) .cse8) c_~i~0))))) (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse9 (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse10 (select .cse9 ~q1~0.base))) (or (< (select (select .cse9 c_~q2~0.base) .cse2) .cse6) (not (= (select .cse10 (+ .cse4 ~q1~0.offset)) c_~j~0)) (< (select .cse10 (+ .cse5 ~q1~0.offset)) c_~i~0))))) (not (= (select (select .cse11 c_~q2~0.base) .cse8) c_~i~0)))))) .cse12) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= .cse13 c_thread1Thread2of2ForFork0_thidvar0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or (let ((.cse14 (select .cse15 .cse2))) (and (< .cse14 c_~i~0) (or (< c_~i~0 (+ c_~N~0 1)) (< (+ .cse14 1) c_~N~0)))) (< c_~i~0 c_~N~0)) (= |c_ULTIMATE.start_main_~asdf~1#1| 0) (<= c_thread1Thread2of2ForFork0_thidvar0 .cse13) (or .cse0 (and (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse17 (select .cse16 ~q1~0.base))) (or (< (select (select .cse16 c_~q2~0.base) .cse2) c_~i~0) (< (select .cse17 (+ .cse5 ~q1~0.offset)) .cse6) (not (= c_~j~0 (select .cse17 (+ .cse4 ~q1~0.offset)))))))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse19 (select .cse18 ~q1~0.base))) (or (< (select (select .cse18 c_~q2~0.base) .cse2) .cse6) (not (= c_~j~0 (select .cse19 (+ .cse4 ~q1~0.offset)))) (< (select .cse19 (+ .cse5 ~q1~0.offset)) c_~i~0)))))) .cse12 .cse20) (or .cse0 (and (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (select (select .cse21 c_~q2~0.base) .cse2) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse22 (select .cse21 ~q1~0.base))) (or (< (+ 1 (select .cse22 (+ .cse5 ~q1~0.offset))) c_~N~0) (not (= c_~j~0 (select .cse22 (+ .cse4 ~q1~0.offset)))))))))) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (+ (select (select .cse23 c_~q2~0.base) .cse2) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse24 (select .cse23 ~q1~0.base))) (or (< (select .cse24 (+ .cse5 ~q1~0.offset)) c_~N~0) (not (= c_~j~0 (select .cse24 (+ .cse4 ~q1~0.offset))))))))))) .cse12 .cse20)))) is different from false [2023-08-04 09:52:05,215 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| c_~q2~0.base))) (let ((.cse0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0) 1)) (.cse2 (+ c_~i~0 1)) (.cse1 (< c_~q2_back~0 0)) (.cse6 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse9 (* c_~q1_front~0 4)) (.cse10 (* c_~q1_back~0 4)) (.cse13 (<= c_~n2~0 c_~q2_back~0)) (.cse14 (not (= c_~i~0 (select .cse5 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))))) (and (<= (+ c_thread1Thread2of2ForFork0_thidvar0 1) |c_#pthreadsForks|) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= .cse0 c_thread1Thread2of2ForFork0_thidvar0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or .cse1 (let ((.cse3 (< c_~j~0 c_~i~0))) (and (< c_~j~0 .cse2) (= c_~q1_back~0 c_~q1_front~0) (or (= c_~q2_front~0 c_~q2_back~0) .cse3) (or (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse3))) (< 0 c_~q2_back~0)) (or (let ((.cse4 (select .cse5 .cse6))) (and (< .cse4 c_~i~0) (or (< c_~i~0 (+ c_~N~0 1)) (< (+ .cse4 1) c_~N~0)))) (< c_~i~0 c_~N~0)) (= |c_ULTIMATE.start_main_~asdf~1#1| 0) (<= c_thread1Thread2of2ForFork0_thidvar0 .cse0) (or .cse1 (and (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse8 (select .cse7 ~q1~0.base))) (or (< (select (select .cse7 c_~q2~0.base) .cse6) c_~i~0) (< (select .cse8 (+ .cse9 ~q1~0.offset)) .cse2) (not (= c_~j~0 (select .cse8 (+ .cse10 ~q1~0.offset)))))))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse12 (select .cse11 ~q1~0.base))) (or (< (select (select .cse11 c_~q2~0.base) .cse6) .cse2) (not (= c_~j~0 (select .cse12 (+ .cse10 ~q1~0.offset)))) (< (select .cse12 (+ .cse9 ~q1~0.offset)) c_~i~0)))))) .cse13 .cse14) (or .cse1 (and (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (select (select .cse15 c_~q2~0.base) .cse6) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse16 (select .cse15 ~q1~0.base))) (or (< (+ 1 (select .cse16 (+ .cse9 ~q1~0.offset))) c_~N~0) (not (= c_~j~0 (select .cse16 (+ .cse10 ~q1~0.offset)))))))))) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (+ (select (select .cse17 c_~q2~0.base) .cse6) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse18 (select .cse17 ~q1~0.base))) (or (< (select .cse18 (+ .cse9 ~q1~0.offset)) c_~N~0) (not (= c_~j~0 (select .cse18 (+ .cse10 ~q1~0.offset))))))))))) .cse13 .cse14)))) is different from false [2023-08-04 09:52:34,977 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse16 (< c_~j~0 c_~i~0)) (.cse7 (+ c_~i~0 1)) (.cse30 (select |c_#memory_int| c_~q2~0.base)) (.cse31 (* c_~q2_front~0 4)) (.cse15 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))) (let ((.cse0 (+ .cse15 1)) (.cse14 (select .cse30 .cse31)) (.cse17 (< c_~j~0 .cse7)) (.cse19 (or (= c_~q2_front~0 c_~q2_back~0) .cse16)) (.cse18 (= c_~q1_back~0 c_~q1_front~0)) (.cse20 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0) 1)) (.cse1 (< c_~q2_back~0 0)) (.cse3 (+ c_~q2~0.offset .cse31)) (.cse5 (* c_~q1_back~0 4)) (.cse6 (* c_~q1_front~0 4)) (.cse13 (<= c_~n2~0 c_~q2_back~0)) (.cse9 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (and (= c_~q2~0.offset 0) (<= .cse0 |c_#pthreadsForks|) (<= .cse0 |c_ULTIMATE.start_main_#t~pre22#1|) (= c_~j~0 c_~i~0) (<= c_~q2_front~0 0) (or .cse1 (and (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse2 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse4 (select .cse2 ~q1~0.base))) (or (< (select (select .cse2 c_~q2~0.base) .cse3) c_~i~0) (not (= (select .cse4 (+ .cse5 ~q1~0.offset)) c_~j~0)) (< (select .cse4 (+ .cse6 ~q1~0.offset)) .cse7))))) (not (= (select (select .cse8 c_~q2~0.base) .cse9) c_~i~0))))) (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse10 (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse11 (select .cse10 ~q1~0.base))) (or (< (select (select .cse10 c_~q2~0.base) .cse3) .cse7) (not (= (select .cse11 (+ .cse5 ~q1~0.offset)) c_~j~0)) (< (select .cse11 (+ .cse6 ~q1~0.offset)) c_~i~0))))) (not (= (select (select .cse12 c_~q2~0.base) .cse9) c_~i~0)))))) .cse13) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= 0 .cse14) (<= (+ c_thread1Thread2of2ForFork0_thidvar0 1) .cse15) (or .cse1 (and (or .cse16 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse17 .cse18 .cse19) .cse13 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= .cse20 c_thread1Thread2of2ForFork0_thidvar0) (exists ((~q1~0.offset Int) (v_~q1_front~0_135 Int) (~q1~0.base Int)) (let ((.cse21 (select (select |c_#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_135 4) ~q1~0.offset)))) (and (<= c_~i~0 .cse21) (<= .cse21 0)))) (<= (+ 2 c_~q2~0.base) |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= |c_ULTIMATE.start_main_~asdf~1#1| 0)) (< .cse14 c_~N~0) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (select (select .cse22 c_~q2~0.base) .cse3) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse23 (select .cse22 ~q1~0.base))) (or (< (+ 1 (select .cse23 (+ .cse6 ~q1~0.offset))) c_~N~0) (not (= c_~j~0 (select .cse23 (+ .cse5 ~q1~0.offset)))))))))) (<= 0 c_~q2_front~0) (or .cse1 (and .cse17 .cse18 .cse19 (or (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse16)) (< 0 c_~q2_back~0)) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (+ (select (select .cse24 c_~q2~0.base) .cse3) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse25 (select .cse24 ~q1~0.base))) (or (< (select .cse25 (+ .cse6 ~q1~0.offset)) c_~N~0) (not (= c_~j~0 (select .cse25 (+ .cse5 ~q1~0.offset)))))))))) (<= c_~j~0 0) .cse18 (<= c_thread1Thread2of2ForFork0_thidvar0 .cse20) (or .cse1 (and (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse27 (select .cse26 ~q1~0.base))) (or (< (select (select .cse26 c_~q2~0.base) .cse3) c_~i~0) (< (select .cse27 (+ .cse6 ~q1~0.offset)) .cse7) (not (= c_~j~0 (select .cse27 (+ .cse5 ~q1~0.offset)))))))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse29 (select .cse28 ~q1~0.base))) (or (< (select (select .cse28 c_~q2~0.base) .cse3) .cse7) (not (= c_~j~0 (select .cse29 (+ .cse5 ~q1~0.offset)))) (< (select .cse29 (+ .cse6 ~q1~0.offset)) c_~i~0)))))) .cse13 (not (= c_~i~0 (select .cse30 .cse9))))))) is different from false [2023-08-04 09:53:12,446 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse16 (< c_~j~0 c_~i~0)) (.cse7 (+ c_~i~0 1)) (.cse26 (select |c_#memory_int| c_~q2~0.base)) (.cse27 (* c_~q2_front~0 4))) (let ((.cse0 (+ c_thread1Thread2of2ForFork0_thidvar0 1)) (.cse14 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)) (.cse15 (select .cse26 .cse27)) (.cse17 (< c_~j~0 .cse7)) (.cse19 (or (= c_~q2_front~0 c_~q2_back~0) .cse16)) (.cse18 (= c_~q1_back~0 c_~q1_front~0)) (.cse20 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0) 1)) (.cse1 (< c_~q2_back~0 0)) (.cse3 (+ c_~q2~0.offset .cse27)) (.cse5 (* c_~q1_back~0 4)) (.cse6 (* c_~q1_front~0 4)) (.cse13 (<= c_~n2~0 c_~q2_back~0)) (.cse9 (+ (* c_~q2_back~0 4) c_~q2~0.offset))) (and (= c_~q2~0.offset 0) (= c_~j~0 c_~i~0) (<= .cse0 |c_#pthreadsForks|) (<= c_~q2_front~0 0) (or .cse1 (and (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse2 (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse4 (select .cse2 ~q1~0.base))) (or (< (select (select .cse2 c_~q2~0.base) .cse3) c_~i~0) (not (= (select .cse4 (+ .cse5 ~q1~0.offset)) c_~j~0)) (< (select .cse4 (+ .cse6 ~q1~0.offset)) .cse7))))) (not (= (select (select .cse8 c_~q2~0.base) .cse9) c_~i~0))))) (forall ((v_ArrVal_679 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_679))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse10 (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse11 (select .cse10 ~q1~0.base))) (or (< (select (select .cse10 c_~q2~0.base) .cse3) .cse7) (not (= (select .cse11 (+ .cse5 ~q1~0.offset)) c_~j~0)) (< (select .cse11 (+ .cse6 ~q1~0.offset)) c_~i~0))))) (not (= (select (select .cse12 c_~q2~0.base) .cse9) c_~i~0)))))) .cse13) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (+ .cse14 1) c_thread2Thread2of2ForFork1_thidvar0) (<= 0 .cse15) (<= .cse0 .cse14) (or .cse1 (and (or .cse16 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse17 .cse18 .cse19) .cse13 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= .cse20 c_thread1Thread2of2ForFork0_thidvar0) (exists ((~q1~0.offset Int) (v_~q1_front~0_135 Int) (~q1~0.base Int)) (let ((.cse21 (select (select |c_#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_135 4) ~q1~0.offset)))) (and (<= c_~i~0 .cse21) (<= .cse21 0)))) (<= (+ 2 c_~q2~0.base) |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse15 c_~N~0) (<= 0 c_~q2_front~0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or .cse1 (and .cse17 .cse18 .cse19 (or (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse16)) (< 0 c_~q2_back~0)) (<= c_~j~0 0) .cse18 (<= c_thread1Thread2of2ForFork0_thidvar0 .cse20) (or .cse1 (and (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse23 (select .cse22 ~q1~0.base))) (or (< (select (select .cse22 c_~q2~0.base) .cse3) c_~i~0) (< (select .cse23 (+ .cse6 ~q1~0.offset)) .cse7) (not (= c_~j~0 (select .cse23 (+ .cse5 ~q1~0.offset)))))))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse25 (select .cse24 ~q1~0.base))) (or (< (select (select .cse24 c_~q2~0.base) .cse3) .cse7) (not (= c_~j~0 (select .cse25 (+ .cse5 ~q1~0.offset)))) (< (select .cse25 (+ .cse6 ~q1~0.offset)) c_~i~0)))))) .cse13 (not (= c_~i~0 (select .cse26 .cse9))))))) is different from false [2023-08-04 09:53:15,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:54:20,215 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse10 (* c_~q1_front~0 4)) (.cse11 (* c_~q1_back~0 4))) (let ((.cse0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0) 1)) (.cse2 (< c_~q2_back~0 0)) (.cse1 (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (select (select .cse12 c_~q2~0.base) .cse7) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse13 (select .cse12 ~q1~0.base))) (or (< (+ 1 (select .cse13 (+ .cse10 ~q1~0.offset))) c_~N~0) (not (= c_~j~0 (select .cse13 (+ .cse11 ~q1~0.offset))))))))))) (.cse4 (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (+ (select (select .cse8 c_~q2~0.base) .cse7) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse9 (select .cse8 ~q1~0.base))) (or (< (select .cse9 (+ .cse10 ~q1~0.offset)) c_~N~0) (not (= c_~j~0 (select .cse9 (+ .cse11 ~q1~0.offset))))))))))) (.cse6 (select |c_#memory_int| c_~q2~0.base))) (and (or (= c_~j~0 c_~i~0) (< c_~j~0 c_~N~0)) (<= (+ c_thread1Thread2of2ForFork0_thidvar0 1) |c_#pthreadsForks|) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= .cse0 c_thread1Thread2of2ForFork0_thidvar0) .cse1 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or .cse2 (let ((.cse3 (< c_~j~0 c_~i~0))) (and (< c_~j~0 (+ c_~i~0 1)) (= c_~q1_back~0 c_~q1_front~0) (or (= c_~q2_front~0 c_~q2_back~0) .cse3) (or (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse3))) (< 0 c_~q2_back~0)) .cse4 (or (let ((.cse5 (select .cse6 .cse7))) (and (< .cse5 c_~i~0) (or (< c_~i~0 (+ c_~N~0 1)) (< (+ .cse5 1) c_~N~0)))) (< c_~i~0 c_~N~0)) (<= c_thread1Thread2of2ForFork0_thidvar0 .cse0) (or .cse2 (and .cse1 .cse4) (<= c_~n2~0 c_~q2_back~0) (not (= c_~i~0 (select .cse6 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))))))) is different from false [2023-08-04 09:54:42,241 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse22 (select |c_#memory_int| c_~q2~0.base)) (.cse23 (* c_~q2_front~0 4))) (let ((.cse2 (+ c_thread1Thread2of2ForFork0_thidvar0 1)) (.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)) (.cse4 (select .cse22 .cse23)) (.cse0 (+ (div |c_ULTIMATE.start_main_#t~mem25#1| 4294967296) 2)) (.cse1 (+ |c_ULTIMATE.start_main_#t~mem25#1| 1)) (.cse14 (= c_~q1_back~0 c_~q1_front~0)) (.cse5 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0) 1)) (.cse12 (< c_~q2_back~0 0)) (.cse8 (+ c_~q2~0.offset .cse23)) (.cse13 (+ c_~i~0 1)) (.cse11 (* c_~q1_back~0 4)) (.cse10 (* c_~q1_front~0 4))) (and (= c_~q2~0.offset 0) (or (<= .cse0 0) (<= .cse1 c_thread1Thread2of2ForFork0_thidvar0)) (= c_~j~0 c_~i~0) (<= .cse2 |c_#pthreadsForks|) (<= c_~q2_front~0 0) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= (+ .cse3 1) c_thread2Thread2of2ForFork1_thidvar0) (= |c_ULTIMATE.start_main_~asdf~2#1| 0) (<= 0 .cse4) (<= .cse2 .cse3) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= .cse5 c_thread1Thread2of2ForFork0_thidvar0) (exists ((~q1~0.offset Int) (v_~q1_front~0_135 Int) (~q1~0.base Int)) (let ((.cse6 (select (select |c_#memory_int| ~q1~0.base) (+ (* v_~q1_front~0_135 4) ~q1~0.offset)))) (and (<= c_~i~0 .cse6) (<= .cse6 0)))) (<= (+ 2 c_~q2~0.base) |c_ULTIMATE.start_main_~#t2~0#1.base|) (< .cse4 c_~N~0) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (select (select .cse7 c_~q2~0.base) .cse8) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse9 (select .cse7 ~q1~0.base))) (or (< (+ 1 (select .cse9 (+ .cse10 ~q1~0.offset))) c_~N~0) (not (= c_~j~0 (select .cse9 (+ .cse11 ~q1~0.offset)))))))))) (<= 0 c_~q2_front~0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (or .cse12 (let ((.cse15 (< c_~j~0 c_~i~0))) (and (< c_~j~0 .cse13) .cse14 (or (= c_~q2_front~0 c_~q2_back~0) .cse15) (or (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse15))) (< 0 c_~q2_back~0)) (or (< 0 .cse0) (<= c_thread1Thread2of2ForFork0_thidvar0 .cse1)) (forall ((v_ArrVal_681 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (or (< (+ (select (select .cse16 c_~q2~0.base) .cse8) 1) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse17 (select .cse16 ~q1~0.base))) (or (< (select .cse17 (+ .cse10 ~q1~0.offset)) c_~N~0) (not (= c_~j~0 (select .cse17 (+ .cse11 ~q1~0.offset)))))))))) (<= c_~j~0 0) .cse14 (<= c_thread1Thread2of2ForFork0_thidvar0 .cse5) (or .cse12 (and (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse19 (select .cse18 ~q1~0.base))) (or (< (select (select .cse18 c_~q2~0.base) .cse8) c_~i~0) (< (select .cse19 (+ .cse10 ~q1~0.offset)) .cse13) (not (= c_~j~0 (select .cse19 (+ .cse11 ~q1~0.offset)))))))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_681 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_681))) (let ((.cse21 (select .cse20 ~q1~0.base))) (or (< (select (select .cse20 c_~q2~0.base) .cse8) .cse13) (not (= c_~j~0 (select .cse21 (+ .cse11 ~q1~0.offset)))) (< (select .cse21 (+ .cse10 ~q1~0.offset)) c_~i~0)))))) (<= c_~n2~0 c_~q2_back~0) (not (= c_~i~0 (select .cse22 (+ (* c_~q2_back~0 4) c_~q2~0.offset)))))))) is different from false [2023-08-04 09:55:05,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-04 09:55:20,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:55:52,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:58:35,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]