/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 01:41:32,483 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 01:41:32,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 01:41:32,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 01:41:32,576 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 01:41:32,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 01:41:32,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 01:41:32,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 01:41:32,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 01:41:32,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 01:41:32,597 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 01:41:32,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 01:41:32,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 01:41:32,599 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 01:41:32,599 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 01:41:32,599 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 01:41:32,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 01:41:32,600 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 01:41:32,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 01:41:32,601 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 01:41:32,601 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 01:41:32,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 01:41:32,605 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 01:41:32,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 01:41:32,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 01:41:32,606 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 01:41:32,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 01:41:32,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 01:41:32,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 01:41:32,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 01:41:32,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 01:41:32,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 01:41:32,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 01:41:32,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 01:41:32,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 01:41:32,608 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-08-24 01:41:32,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 01:41:32,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 01:41:32,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 01:41:32,947 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 01:41:32,947 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 01:41:32,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-08-24 01:41:34,092 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 01:41:34,346 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 01:41:34,346 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-08-24 01:41:34,364 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf611472e/8b305ba55b254e3588979577b6afe9e6/FLAG9aad76eef [2023-08-24 01:41:34,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf611472e/8b305ba55b254e3588979577b6afe9e6 [2023-08-24 01:41:34,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 01:41:34,387 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 01:41:34,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 01:41:34,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 01:41:34,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 01:41:34,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 01:41:34" (1/1) ... [2023-08-24 01:41:34,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@243b1844 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:41:34, skipping insertion in model container [2023-08-24 01:41:34,399 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 01:41:34" (1/1) ... [2023-08-24 01:41:34,435 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 01:41:34,640 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-08-24 01:41:34,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 01:41:34,664 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 01:41:34,695 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-08-24 01:41:34,699 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 01:41:34,706 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 01:41:34,706 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 01:41:34,712 INFO L206 MainTranslator]: Completed translation [2023-08-24 01:41:34,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:41:34 WrapperNode [2023-08-24 01:41:34,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 01:41:34,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 01:41:34,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 01:41:34,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 01:41:34,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:41:34" (1/1) ... [2023-08-24 01:41:34,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:41:34" (1/1) ... [2023-08-24 01:41:34,794 INFO L138 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 304 [2023-08-24 01:41:34,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 01:41:34,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 01:41:34,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 01:41:34,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 01:41:34,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:41:34" (1/1) ... [2023-08-24 01:41:34,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:41:34" (1/1) ... [2023-08-24 01:41:34,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:41:34" (1/1) ... [2023-08-24 01:41:34,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:41:34" (1/1) ... [2023-08-24 01:41:34,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:41:34" (1/1) ... [2023-08-24 01:41:34,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:41:34" (1/1) ... [2023-08-24 01:41:34,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:41:34" (1/1) ... [2023-08-24 01:41:34,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:41:34" (1/1) ... [2023-08-24 01:41:34,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 01:41:34,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 01:41:34,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 01:41:34,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 01:41:34,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:41:34" (1/1) ... [2023-08-24 01:41:34,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 01:41:34,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:41:34,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 01:41:34,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 01:41:34,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 01:41:34,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 01:41:34,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 01:41:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 01:41:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 01:41:34,923 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 01:41:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 01:41:34,923 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 01:41:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 01:41:34,923 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 01:41:34,923 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 01:41:34,924 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 01:41:34,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 01:41:34,924 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-24 01:41:34,924 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-24 01:41:34,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-24 01:41:34,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-24 01:41:34,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 01:41:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 01:41:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 01:41:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 01:41:34,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 01:41:34,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 01:41:34,928 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 01:41:35,070 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 01:41:35,071 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 01:41:35,542 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 01:41:35,733 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 01:41:35,733 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-24 01:41:35,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 01:41:35 BoogieIcfgContainer [2023-08-24 01:41:35,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 01:41:35,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 01:41:35,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 01:41:35,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 01:41:35,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 01:41:34" (1/3) ... [2023-08-24 01:41:35,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7ad2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 01:41:35, skipping insertion in model container [2023-08-24 01:41:35,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:41:34" (2/3) ... [2023-08-24 01:41:35,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7ad2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 01:41:35, skipping insertion in model container [2023-08-24 01:41:35,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 01:41:35" (3/3) ... [2023-08-24 01:41:35,742 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2023-08-24 01:41:35,757 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 01:41:35,757 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 01:41:35,757 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 01:41:35,851 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-08-24 01:41:35,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 264 places, 263 transitions, 598 flow [2023-08-24 01:41:35,978 INFO L124 PetriNetUnfolderBase]: 18/235 cut-off events. [2023-08-24 01:41:35,979 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 01:41:35,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 235 events. 18/235 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 305 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2023-08-24 01:41:35,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 264 places, 263 transitions, 598 flow [2023-08-24 01:41:35,994 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 227 transitions, 502 flow [2023-08-24 01:41:36,001 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 01:41:36,012 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 227 transitions, 502 flow [2023-08-24 01:41:36,019 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 227 transitions, 502 flow [2023-08-24 01:41:36,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 227 transitions, 502 flow [2023-08-24 01:41:36,081 INFO L124 PetriNetUnfolderBase]: 18/227 cut-off events. [2023-08-24 01:41:36,082 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 01:41:36,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 227 events. 18/227 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 302 event pairs, 0 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 204. Up to 3 conditions per place. [2023-08-24 01:41:36,090 INFO L119 LiptonReduction]: Number of co-enabled transitions 7920 [2023-08-24 01:41:42,307 INFO L134 LiptonReduction]: Checked pairs total: 33760 [2023-08-24 01:41:42,307 INFO L136 LiptonReduction]: Total number of compositions: 188 [2023-08-24 01:41:42,319 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 01:41:42,325 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4b7365e2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 01:41:42,325 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-08-24 01:41:42,336 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 01:41:42,336 INFO L124 PetriNetUnfolderBase]: 9/64 cut-off events. [2023-08-24 01:41:42,336 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 01:41:42,336 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:41:42,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:41:42,337 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 01:41:42,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:41:42,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1898109785, now seen corresponding path program 1 times [2023-08-24 01:41:42,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:41:42,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646589959] [2023-08-24 01:41:42,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:41:42,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:41:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:41:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:41:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:41:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646589959] [2023-08-24 01:41:43,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646589959] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 01:41:43,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 01:41:43,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 01:41:43,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681081435] [2023-08-24 01:41:43,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:41:43,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 01:41:43,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:41:43,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 01:41:43,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 01:41:43,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 455 [2023-08-24 01:41:43,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:43,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:41:43,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 455 [2023-08-24 01:41:43,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:41:46,495 INFO L124 PetriNetUnfolderBase]: 24447/33183 cut-off events. [2023-08-24 01:41:46,495 INFO L125 PetriNetUnfolderBase]: For 5662/5662 co-relation queries the response was YES. [2023-08-24 01:41:46,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69959 conditions, 33183 events. 24447/33183 cut-off events. For 5662/5662 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 178552 event pairs, 7197 based on Foata normal form. 1/25597 useless extension candidates. Maximal degree in co-relation 68487. Up to 12303 conditions per place. [2023-08-24 01:41:46,762 INFO L140 encePairwiseOnDemand]: 448/455 looper letters, 109 selfloop transitions, 8 changer transitions 1/138 dead transitions. [2023-08-24 01:41:46,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 138 transitions, 641 flow [2023-08-24 01:41:46,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 01:41:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 01:41:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 975 transitions. [2023-08-24 01:41:46,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2023-08-24 01:41:46,784 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 975 transitions. [2023-08-24 01:41:46,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 975 transitions. [2023-08-24 01:41:46,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:41:46,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 975 transitions. [2023-08-24 01:41:46,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 243.75) internal successors, (975), 4 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:46,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 455.0) internal successors, (2275), 5 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:46,806 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 455.0) internal successors, (2275), 5 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:46,808 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 178 flow. Second operand 4 states and 975 transitions. [2023-08-24 01:41:46,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 138 transitions, 641 flow [2023-08-24 01:41:46,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 138 transitions, 555 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-24 01:41:46,914 INFO L231 Difference]: Finished difference. Result has 68 places, 72 transitions, 199 flow [2023-08-24 01:41:46,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=68, PETRI_TRANSITIONS=72} [2023-08-24 01:41:46,919 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2023-08-24 01:41:46,920 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 72 transitions, 199 flow [2023-08-24 01:41:46,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:46,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:41:46,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:41:46,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 01:41:46,922 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 01:41:46,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:41:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1410762776, now seen corresponding path program 1 times [2023-08-24 01:41:46,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:41:46,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219369929] [2023-08-24 01:41:46,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:41:46,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:41:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:41:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:41:47,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:41:47,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219369929] [2023-08-24 01:41:47,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219369929] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 01:41:47,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 01:41:47,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 01:41:47,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603241684] [2023-08-24 01:41:47,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:41:47,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 01:41:47,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:41:47,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 01:41:47,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 01:41:47,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 455 [2023-08-24 01:41:47,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:47,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:41:47,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 455 [2023-08-24 01:41:47,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:41:51,120 INFO L124 PetriNetUnfolderBase]: 40211/54719 cut-off events. [2023-08-24 01:41:51,120 INFO L125 PetriNetUnfolderBase]: For 11876/11876 co-relation queries the response was YES. [2023-08-24 01:41:51,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120973 conditions, 54719 events. 40211/54719 cut-off events. For 11876/11876 co-relation queries the response was YES. Maximal size of possible extension queue 1378. Compared 312439 event pairs, 15979 based on Foata normal form. 1/42240 useless extension candidates. Maximal degree in co-relation 43215. Up to 22845 conditions per place. [2023-08-24 01:41:51,390 INFO L140 encePairwiseOnDemand]: 448/455 looper letters, 115 selfloop transitions, 11 changer transitions 1/147 dead transitions. [2023-08-24 01:41:51,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 147 transitions, 654 flow [2023-08-24 01:41:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 01:41:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 01:41:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 977 transitions. [2023-08-24 01:41:51,394 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5368131868131868 [2023-08-24 01:41:51,394 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 977 transitions. [2023-08-24 01:41:51,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 977 transitions. [2023-08-24 01:41:51,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:41:51,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 977 transitions. [2023-08-24 01:41:51,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 244.25) internal successors, (977), 4 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:51,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 455.0) internal successors, (2275), 5 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:51,401 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 455.0) internal successors, (2275), 5 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:51,402 INFO L175 Difference]: Start difference. First operand has 68 places, 72 transitions, 199 flow. Second operand 4 states and 977 transitions. [2023-08-24 01:41:51,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 147 transitions, 654 flow [2023-08-24 01:41:51,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 147 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 01:41:51,417 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 278 flow [2023-08-24 01:41:51,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2023-08-24 01:41:51,419 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2023-08-24 01:41:51,419 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 278 flow [2023-08-24 01:41:51,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 222.0) internal successors, (888), 4 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:51,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:41:51,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:41:51,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 01:41:51,420 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 01:41:51,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:41:51,422 INFO L85 PathProgramCache]: Analyzing trace with hash -322165593, now seen corresponding path program 1 times [2023-08-24 01:41:51,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:41:51,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423392474] [2023-08-24 01:41:51,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:41:51,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:41:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:41:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:41:51,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:41:51,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423392474] [2023-08-24 01:41:51,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423392474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 01:41:51,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 01:41:51,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 01:41:51,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821726712] [2023-08-24 01:41:51,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:41:51,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 01:41:51,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:41:51,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 01:41:51,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 01:41:51,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 01:41:51,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:51,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:41:51,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 01:41:51,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:41:57,103 INFO L124 PetriNetUnfolderBase]: 52244/71422 cut-off events. [2023-08-24 01:41:57,103 INFO L125 PetriNetUnfolderBase]: For 34593/34593 co-relation queries the response was YES. [2023-08-24 01:41:57,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169705 conditions, 71422 events. 52244/71422 cut-off events. For 34593/34593 co-relation queries the response was YES. Maximal size of possible extension queue 1847. Compared 428320 event pairs, 34723 based on Foata normal form. 0/55814 useless extension candidates. Maximal degree in co-relation 71375. Up to 50266 conditions per place. [2023-08-24 01:41:57,403 INFO L140 encePairwiseOnDemand]: 449/455 looper letters, 121 selfloop transitions, 5 changer transitions 0/146 dead transitions. [2023-08-24 01:41:57,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 146 transitions, 753 flow [2023-08-24 01:41:57,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 01:41:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 01:41:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1112 transitions. [2023-08-24 01:41:57,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4887912087912088 [2023-08-24 01:41:57,407 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1112 transitions. [2023-08-24 01:41:57,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1112 transitions. [2023-08-24 01:41:57,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:41:57,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1112 transitions. [2023-08-24 01:41:57,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 222.4) internal successors, (1112), 5 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:57,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 455.0) internal successors, (2730), 6 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:57,415 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 455.0) internal successors, (2730), 6 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:57,415 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 278 flow. Second operand 5 states and 1112 transitions. [2023-08-24 01:41:57,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 146 transitions, 753 flow [2023-08-24 01:41:57,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 146 transitions, 749 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-24 01:41:57,449 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 324 flow [2023-08-24 01:41:57,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2023-08-24 01:41:57,450 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2023-08-24 01:41:57,450 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 324 flow [2023-08-24 01:41:57,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:57,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:41:57,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:41:57,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 01:41:57,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 01:41:57,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:41:57,452 INFO L85 PathProgramCache]: Analyzing trace with hash 348277624, now seen corresponding path program 1 times [2023-08-24 01:41:57,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:41:57,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692143125] [2023-08-24 01:41:57,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:41:57,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:41:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:41:57,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:41:57,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:41:57,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692143125] [2023-08-24 01:41:57,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692143125] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 01:41:57,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 01:41:57,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 01:41:57,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482586413] [2023-08-24 01:41:57,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:41:57,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 01:41:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:41:57,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 01:41:57,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 01:41:57,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 01:41:57,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:41:57,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:41:57,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 01:41:57,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:42:01,833 INFO L124 PetriNetUnfolderBase]: 43919/60156 cut-off events. [2023-08-24 01:42:01,834 INFO L125 PetriNetUnfolderBase]: For 33722/33722 co-relation queries the response was YES. [2023-08-24 01:42:01,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147051 conditions, 60156 events. 43919/60156 cut-off events. For 33722/33722 co-relation queries the response was YES. Maximal size of possible extension queue 1583. Compared 353513 event pairs, 30832 based on Foata normal form. 0/51689 useless extension candidates. Maximal degree in co-relation 134975. Up to 50266 conditions per place. [2023-08-24 01:42:02,125 INFO L140 encePairwiseOnDemand]: 449/455 looper letters, 58 selfloop transitions, 2 changer transitions 51/131 dead transitions. [2023-08-24 01:42:02,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 131 transitions, 677 flow [2023-08-24 01:42:02,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 01:42:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 01:42:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1103 transitions. [2023-08-24 01:42:02,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4848351648351648 [2023-08-24 01:42:02,129 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1103 transitions. [2023-08-24 01:42:02,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1103 transitions. [2023-08-24 01:42:02,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:42:02,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1103 transitions. [2023-08-24 01:42:02,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 220.6) internal successors, (1103), 5 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:02,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 455.0) internal successors, (2730), 6 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:02,137 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 455.0) internal successors, (2730), 6 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:02,138 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 324 flow. Second operand 5 states and 1103 transitions. [2023-08-24 01:42:02,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 131 transitions, 677 flow [2023-08-24 01:42:02,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 131 transitions, 673 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 01:42:02,158 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 302 flow [2023-08-24 01:42:02,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2023-08-24 01:42:02,159 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2023-08-24 01:42:02,159 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 302 flow [2023-08-24 01:42:02,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:02,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:42:02,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:42:02,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 01:42:02,161 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 01:42:02,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:42:02,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2068381003, now seen corresponding path program 1 times [2023-08-24 01:42:02,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:42:02,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264969881] [2023-08-24 01:42:02,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:42:02,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:42:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:42:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:42:02,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:42:02,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264969881] [2023-08-24 01:42:02,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264969881] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 01:42:02,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033854070] [2023-08-24 01:42:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:42:02,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:42:02,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:42:02,417 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 01:42:02,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 01:42:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:42:02,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-24 01:42:02,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 01:42:02,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:42:02,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 01:42:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:42:02,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033854070] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 01:42:02,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 01:42:02,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-24 01:42:02,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851228748] [2023-08-24 01:42:02,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 01:42:02,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-24 01:42:02,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:42:02,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-24 01:42:02,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-08-24 01:42:02,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 01:42:02,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 302 flow. Second operand has 11 states, 11 states have (on average 205.45454545454547) internal successors, (2260), 11 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:02,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:42:02,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 01:42:02,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:42:08,152 INFO L124 PetriNetUnfolderBase]: 50674/69405 cut-off events. [2023-08-24 01:42:08,152 INFO L125 PetriNetUnfolderBase]: For 48897/48897 co-relation queries the response was YES. [2023-08-24 01:42:08,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175332 conditions, 69405 events. 50674/69405 cut-off events. For 48897/48897 co-relation queries the response was YES. Maximal size of possible extension queue 1840. Compared 425307 event pairs, 17153 based on Foata normal form. 3638/68767 useless extension candidates. Maximal degree in co-relation 175311. Up to 28288 conditions per place. [2023-08-24 01:42:08,567 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 159 selfloop transitions, 8 changer transitions 0/187 dead transitions. [2023-08-24 01:42:08,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 187 transitions, 1059 flow [2023-08-24 01:42:08,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 01:42:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 01:42:08,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1544 transitions. [2023-08-24 01:42:08,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847723704866562 [2023-08-24 01:42:08,571 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1544 transitions. [2023-08-24 01:42:08,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1544 transitions. [2023-08-24 01:42:08,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:42:08,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1544 transitions. [2023-08-24 01:42:08,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 220.57142857142858) internal successors, (1544), 7 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:08,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:08,580 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:08,580 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 302 flow. Second operand 7 states and 1544 transitions. [2023-08-24 01:42:08,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 187 transitions, 1059 flow [2023-08-24 01:42:08,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 187 transitions, 1035 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-24 01:42:08,604 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 368 flow [2023-08-24 01:42:08,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-08-24 01:42:08,605 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 13 predicate places. [2023-08-24 01:42:08,605 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 368 flow [2023-08-24 01:42:08,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 205.45454545454547) internal successors, (2260), 11 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:08,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:42:08,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:42:08,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 01:42:08,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:42:08,812 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 01:42:08,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:42:08,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2027202032, now seen corresponding path program 1 times [2023-08-24 01:42:08,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:42:08,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451382228] [2023-08-24 01:42:08,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:42:08,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:42:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:42:09,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:42:09,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:42:09,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451382228] [2023-08-24 01:42:09,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451382228] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 01:42:09,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162998217] [2023-08-24 01:42:09,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:42:09,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:42:09,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:42:09,072 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 01:42:09,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 01:42:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:42:09,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-24 01:42:09,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 01:42:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:42:09,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 01:42:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:42:09,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162998217] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 01:42:09,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 01:42:09,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-24 01:42:09,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166333439] [2023-08-24 01:42:09,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 01:42:09,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 01:42:09,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:42:09,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 01:42:09,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-08-24 01:42:09,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 01:42:09,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 368 flow. Second operand has 12 states, 12 states have (on average 205.41666666666666) internal successors, (2465), 12 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:09,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:42:09,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 01:42:09,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:42:13,944 INFO L124 PetriNetUnfolderBase]: 40749/56293 cut-off events. [2023-08-24 01:42:13,944 INFO L125 PetriNetUnfolderBase]: For 64553/64553 co-relation queries the response was YES. [2023-08-24 01:42:14,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156626 conditions, 56293 events. 40749/56293 cut-off events. For 64553/64553 co-relation queries the response was YES. Maximal size of possible extension queue 1569. Compared 337020 event pairs, 12988 based on Foata normal form. 2458/55322 useless extension candidates. Maximal degree in co-relation 143695. Up to 26698 conditions per place. [2023-08-24 01:42:14,412 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 100 selfloop transitions, 5 changer transitions 51/176 dead transitions. [2023-08-24 01:42:14,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 176 transitions, 1023 flow [2023-08-24 01:42:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 01:42:14,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 01:42:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1535 transitions. [2023-08-24 01:42:14,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48194662480376765 [2023-08-24 01:42:14,415 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1535 transitions. [2023-08-24 01:42:14,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1535 transitions. [2023-08-24 01:42:14,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:42:14,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1535 transitions. [2023-08-24 01:42:14,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 219.28571428571428) internal successors, (1535), 7 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:14,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:14,424 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:14,424 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 368 flow. Second operand 7 states and 1535 transitions. [2023-08-24 01:42:14,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 176 transitions, 1023 flow [2023-08-24 01:42:14,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 176 transitions, 1007 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-24 01:42:14,449 INFO L231 Difference]: Finished difference. Result has 96 places, 85 transitions, 362 flow [2023-08-24 01:42:14,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=96, PETRI_TRANSITIONS=85} [2023-08-24 01:42:14,450 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 21 predicate places. [2023-08-24 01:42:14,450 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 85 transitions, 362 flow [2023-08-24 01:42:14,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 205.41666666666666) internal successors, (2465), 12 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:14,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:42:14,451 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:42:14,460 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-24 01:42:14,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-24 01:42:14,657 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 01:42:14,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:42:14,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1593234664, now seen corresponding path program 1 times [2023-08-24 01:42:14,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:42:14,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831963903] [2023-08-24 01:42:14,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:42:14,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:42:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:42:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:42:14,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:42:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831963903] [2023-08-24 01:42:14,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831963903] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 01:42:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583648458] [2023-08-24 01:42:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:42:14,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:42:14,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:42:14,890 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 01:42:14,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 01:42:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:42:15,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-24 01:42:15,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 01:42:15,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:42:15,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 01:42:15,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:42:15,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583648458] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 01:42:15,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 01:42:15,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-24 01:42:15,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118282135] [2023-08-24 01:42:15,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 01:42:15,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 01:42:15,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:42:15,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 01:42:15,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-08-24 01:42:15,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 01:42:15,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 85 transitions, 362 flow. Second operand has 12 states, 12 states have (on average 206.66666666666666) internal successors, (2480), 12 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:15,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:42:15,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 01:42:15,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:42:18,430 INFO L124 PetriNetUnfolderBase]: 28494/38679 cut-off events. [2023-08-24 01:42:18,430 INFO L125 PetriNetUnfolderBase]: For 63978/63978 co-relation queries the response was YES. [2023-08-24 01:42:18,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122051 conditions, 38679 events. 28494/38679 cut-off events. For 63978/63978 co-relation queries the response was YES. Maximal size of possible extension queue 1081. Compared 210950 event pairs, 15424 based on Foata normal form. 1152/37794 useless extension candidates. Maximal degree in co-relation 122010. Up to 32675 conditions per place. [2023-08-24 01:42:18,640 INFO L140 encePairwiseOnDemand]: 447/455 looper letters, 88 selfloop transitions, 8 changer transitions 0/116 dead transitions. [2023-08-24 01:42:18,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 116 transitions, 693 flow [2023-08-24 01:42:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 01:42:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 01:42:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1481 transitions. [2023-08-24 01:42:18,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4649921507064364 [2023-08-24 01:42:18,644 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1481 transitions. [2023-08-24 01:42:18,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1481 transitions. [2023-08-24 01:42:18,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:42:18,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1481 transitions. [2023-08-24 01:42:18,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 211.57142857142858) internal successors, (1481), 7 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:18,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:18,653 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 455.0) internal successors, (3640), 8 states have internal predecessors, (3640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:18,653 INFO L175 Difference]: Start difference. First operand has 96 places, 85 transitions, 362 flow. Second operand 7 states and 1481 transitions. [2023-08-24 01:42:18,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 116 transitions, 693 flow [2023-08-24 01:42:18,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 116 transitions, 651 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-24 01:42:18,696 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 370 flow [2023-08-24 01:42:18,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=370, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2023-08-24 01:42:18,697 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 17 predicate places. [2023-08-24 01:42:18,697 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 370 flow [2023-08-24 01:42:18,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 206.66666666666666) internal successors, (2480), 12 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:18,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:42:18,698 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:42:18,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 01:42:18,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:42:18,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 01:42:18,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:42:18,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1296418912, now seen corresponding path program 1 times [2023-08-24 01:42:18,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:42:18,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079267629] [2023-08-24 01:42:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:42:18,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:42:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:42:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:42:19,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:42:19,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079267629] [2023-08-24 01:42:19,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079267629] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 01:42:19,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347760884] [2023-08-24 01:42:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:42:19,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:42:19,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:42:19,104 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 01:42:19,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 01:42:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:42:19,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-24 01:42:19,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 01:42:19,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:42:19,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 01:42:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:42:19,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347760884] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 01:42:19,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 01:42:19,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2023-08-24 01:42:19,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232592440] [2023-08-24 01:42:19,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 01:42:19,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 01:42:19,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:42:19,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 01:42:19,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-24 01:42:19,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 455 [2023-08-24 01:42:19,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 370 flow. Second operand has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:19,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:42:19,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 455 [2023-08-24 01:42:19,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:42:21,941 INFO L124 PetriNetUnfolderBase]: 21901/29332 cut-off events. [2023-08-24 01:42:21,941 INFO L125 PetriNetUnfolderBase]: For 41930/41930 co-relation queries the response was YES. [2023-08-24 01:42:22,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92309 conditions, 29332 events. 21901/29332 cut-off events. For 41930/41930 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 148272 event pairs, 11661 based on Foata normal form. 816/28769 useless extension candidates. Maximal degree in co-relation 92269. Up to 25062 conditions per place. [2023-08-24 01:42:22,081 INFO L140 encePairwiseOnDemand]: 448/455 looper letters, 93 selfloop transitions, 7 changer transitions 0/120 dead transitions. [2023-08-24 01:42:22,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 120 transitions, 716 flow [2023-08-24 01:42:22,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 01:42:22,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 01:42:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1280 transitions. [2023-08-24 01:42:22,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46886446886446886 [2023-08-24 01:42:22,084 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1280 transitions. [2023-08-24 01:42:22,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1280 transitions. [2023-08-24 01:42:22,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:42:22,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1280 transitions. [2023-08-24 01:42:22,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:22,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 455.0) internal successors, (3185), 7 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:22,091 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 455.0) internal successors, (3185), 7 states have internal predecessors, (3185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:22,091 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 370 flow. Second operand 6 states and 1280 transitions. [2023-08-24 01:42:22,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 120 transitions, 716 flow [2023-08-24 01:42:22,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 120 transitions, 691 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-24 01:42:22,119 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 386 flow [2023-08-24 01:42:22,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=386, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2023-08-24 01:42:22,120 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 19 predicate places. [2023-08-24 01:42:22,120 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 386 flow [2023-08-24 01:42:22,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:22,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:42:22,120 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:42:22,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 01:42:22,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:42:22,326 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 01:42:22,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:42:22,327 INFO L85 PathProgramCache]: Analyzing trace with hash 477685320, now seen corresponding path program 1 times [2023-08-24 01:42:22,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:42:22,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545225540] [2023-08-24 01:42:22,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:42:22,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:42:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:42:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 01:42:23,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:42:23,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545225540] [2023-08-24 01:42:23,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545225540] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 01:42:23,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231467472] [2023-08-24 01:42:23,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:42:23,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:42:23,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:42:23,650 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 01:42:23,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 01:42:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:42:24,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 62 conjunts are in the unsatisfiable core [2023-08-24 01:42:24,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 01:42:24,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:42:24,303 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 01:42:24,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:42:24,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 01:42:24,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:42:24,539 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 01:42:24,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:42:24,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 01:42:24,658 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 01:42:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 01:42:24,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 01:42:25,125 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0) (+ 1 c_~s_2~0))))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0))))))) is different from false [2023-08-24 01:42:26,121 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0) (+ 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 01:42:27,496 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 01:42:27,576 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_496 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_496 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 01:42:29,697 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_495) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_496 (Array Int Int)) (v_ArrVal_495 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_495) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_497) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_498) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 01:42:29,748 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 01:42:29,749 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 922 treesize of output 630 [2023-08-24 01:42:29,761 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 306 treesize of output 290 [2023-08-24 01:42:29,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 258 [2023-08-24 01:42:29,779 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 123 [2023-08-24 01:42:29,791 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 122 [2023-08-24 01:42:30,129 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 01:42:30,130 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 01:42:30,130 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 01:42:30,131 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 01:42:30,308 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 01:42:30,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231467472] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 01:42:30,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 01:42:30,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 36 [2023-08-24 01:42:30,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234275015] [2023-08-24 01:42:30,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 01:42:30,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-24 01:42:30,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:42:30,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-24 01:42:30,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=907, Unknown=20, NotChecked=330, Total=1406 [2023-08-24 01:42:30,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 455 [2023-08-24 01:42:30,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 386 flow. Second operand has 38 states, 38 states have (on average 169.68421052631578) internal successors, (6448), 38 states have internal predecessors, (6448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:30,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:42:30,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 455 [2023-08-24 01:42:30,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:42:45,657 INFO L124 PetriNetUnfolderBase]: 92447/120447 cut-off events. [2023-08-24 01:42:45,657 INFO L125 PetriNetUnfolderBase]: For 150182/150182 co-relation queries the response was YES. [2023-08-24 01:42:46,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373410 conditions, 120447 events. 92447/120447 cut-off events. For 150182/150182 co-relation queries the response was YES. Maximal size of possible extension queue 2557. Compared 674321 event pairs, 6180 based on Foata normal form. 2/115989 useless extension candidates. Maximal degree in co-relation 373369. Up to 42024 conditions per place. [2023-08-24 01:42:46,352 INFO L140 encePairwiseOnDemand]: 437/455 looper letters, 750 selfloop transitions, 142 changer transitions 30/932 dead transitions. [2023-08-24 01:42:46,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 932 transitions, 5449 flow [2023-08-24 01:42:46,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-24 01:42:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-24 01:42:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 6984 transitions. [2023-08-24 01:42:46,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4148500148500148 [2023-08-24 01:42:46,367 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 6984 transitions. [2023-08-24 01:42:46,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 6984 transitions. [2023-08-24 01:42:46,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:42:46,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 6984 transitions. [2023-08-24 01:42:46,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 188.75675675675674) internal successors, (6984), 37 states have internal predecessors, (6984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:46,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 455.0) internal successors, (17290), 38 states have internal predecessors, (17290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:46,404 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 455.0) internal successors, (17290), 38 states have internal predecessors, (17290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:46,404 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 386 flow. Second operand 37 states and 6984 transitions. [2023-08-24 01:42:46,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 932 transitions, 5449 flow [2023-08-24 01:42:46,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 932 transitions, 5429 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-24 01:42:46,597 INFO L231 Difference]: Finished difference. Result has 152 places, 241 transitions, 1697 flow [2023-08-24 01:42:46,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1697, PETRI_PLACES=152, PETRI_TRANSITIONS=241} [2023-08-24 01:42:46,598 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 77 predicate places. [2023-08-24 01:42:46,598 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 241 transitions, 1697 flow [2023-08-24 01:42:46,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 169.68421052631578) internal successors, (6448), 38 states have internal predecessors, (6448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:46,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:42:46,600 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:42:46,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 01:42:46,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:42:46,809 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 01:42:46,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:42:46,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1899960650, now seen corresponding path program 2 times [2023-08-24 01:42:46,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:42:46,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685691710] [2023-08-24 01:42:46,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:42:46,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:42:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:42:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 01:42:47,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:42:47,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685691710] [2023-08-24 01:42:47,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685691710] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 01:42:47,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913615943] [2023-08-24 01:42:47,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 01:42:47,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:42:47,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:42:47,869 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 01:42:47,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 01:42:48,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 01:42:48,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 01:42:48,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 61 conjunts are in the unsatisfiable core [2023-08-24 01:42:48,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 01:42:48,090 INFO L322 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-08-24 01:42:48,090 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2023-08-24 01:42:48,119 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 01:42:48,119 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 01:42:48,302 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-24 01:42:48,328 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-08-24 01:42:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 01:42:48,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 01:42:48,536 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_576 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_576) c_~X_0~0.base) .cse0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_576 (Array Int Int))) (<= c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_576) c_~X_0~0.base) .cse0))))) is different from false [2023-08-24 01:42:48,599 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_576 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_576) c_~X_0~0.base) .cse0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_576 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_576) c_~X_0~0.base) .cse0))))) is different from false [2023-08-24 01:42:48,608 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 01:42:48,608 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 32 [2023-08-24 01:42:48,614 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-24 01:42:48,624 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 01:42:48,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2023-08-24 01:42:48,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913615943] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 01:42:48,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 01:42:48,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2023-08-24 01:42:48,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849250118] [2023-08-24 01:42:48,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 01:42:48,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 01:42:48,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:42:48,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 01:42:48,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=353, Unknown=6, NotChecked=78, Total=506 [2023-08-24 01:42:48,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 455 [2023-08-24 01:42:48,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 241 transitions, 1697 flow. Second operand has 23 states, 23 states have (on average 166.8695652173913) internal successors, (3838), 23 states have internal predecessors, (3838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:42:48,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:42:48,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 455 [2023-08-24 01:42:48,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:43:25,312 INFO L124 PetriNetUnfolderBase]: 192809/251577 cut-off events. [2023-08-24 01:43:25,312 INFO L125 PetriNetUnfolderBase]: For 1263687/1263755 co-relation queries the response was YES. [2023-08-24 01:43:27,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029085 conditions, 251577 events. 192809/251577 cut-off events. For 1263687/1263755 co-relation queries the response was YES. Maximal size of possible extension queue 5295. Compared 1522818 event pairs, 42723 based on Foata normal form. 14/241939 useless extension candidates. Maximal degree in co-relation 1029034. Up to 116935 conditions per place. [2023-08-24 01:43:28,273 INFO L140 encePairwiseOnDemand]: 420/455 looper letters, 990 selfloop transitions, 318 changer transitions 24/1342 dead transitions. [2023-08-24 01:43:28,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 1342 transitions, 11200 flow [2023-08-24 01:43:28,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-24 01:43:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-24 01:43:28,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 6793 transitions. [2023-08-24 01:43:28,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4035046035046035 [2023-08-24 01:43:28,282 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 6793 transitions. [2023-08-24 01:43:28,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 6793 transitions. [2023-08-24 01:43:28,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 01:43:28,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 6793 transitions. [2023-08-24 01:43:28,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 183.59459459459458) internal successors, (6793), 37 states have internal predecessors, (6793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:43:28,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 455.0) internal successors, (17290), 38 states have internal predecessors, (17290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:43:28,311 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 455.0) internal successors, (17290), 38 states have internal predecessors, (17290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:43:28,311 INFO L175 Difference]: Start difference. First operand has 152 places, 241 transitions, 1697 flow. Second operand 37 states and 6793 transitions. [2023-08-24 01:43:28,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 1342 transitions, 11200 flow [2023-08-24 01:44:02,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 1342 transitions, 10935 flow, removed 110 selfloop flow, removed 3 redundant places. [2023-08-24 01:44:02,910 INFO L231 Difference]: Finished difference. Result has 213 places, 574 transitions, 5518 flow [2023-08-24 01:44:02,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=455, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=5518, PETRI_PLACES=213, PETRI_TRANSITIONS=574} [2023-08-24 01:44:02,911 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 138 predicate places. [2023-08-24 01:44:02,911 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 574 transitions, 5518 flow [2023-08-24 01:44:02,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 166.8695652173913) internal successors, (3838), 23 states have internal predecessors, (3838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:44:02,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 01:44:02,912 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 01:44:02,918 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-24 01:44:03,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:44:03,118 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-08-24 01:44:03,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 01:44:03,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1840379924, now seen corresponding path program 3 times [2023-08-24 01:44:03,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 01:44:03,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604743633] [2023-08-24 01:44:03,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 01:44:03,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 01:44:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 01:44:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 01:44:04,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 01:44:04,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604743633] [2023-08-24 01:44:04,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604743633] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 01:44:04,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457735499] [2023-08-24 01:44:04,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 01:44:04,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 01:44:04,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 01:44:04,245 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 01:44:04,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 01:44:04,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 01:44:04,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 01:44:04,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 79 conjunts are in the unsatisfiable core [2023-08-24 01:44:04,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 01:44:04,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-24 01:44:04,558 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 01:44:04,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 01:44:04,727 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 01:44:04,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:44:04,860 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 01:44:04,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:44:04,977 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 01:44:05,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 01:44:05,042 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 01:44:05,072 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-08-24 01:44:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 01:44:05,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 01:44:05,315 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_658 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_658) c_~X_0~0.base) .cse0)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_658 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_658) c_~X_0~0.base) .cse0)))))) is different from false [2023-08-24 01:44:05,342 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_658) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |c_thread1Thread1of1ForFork5_~#t3~0.base| v_ArrVal_658) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))))) is different from false [2023-08-24 01:44:05,426 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse0) (+ c_~s_6~0 1))))) (forall ((|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse0))) (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 01:44:06,068 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_656 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (<= c_~s_6~0 (select (select (store (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse0))))) (forall ((v_ArrVal_656 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse0) (+ c_~s_6~0 1))))))) is different from false [2023-08-24 01:44:07,928 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4)) (.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (<= (+ c_~s_6~0 (select (select .cse0 c_~X_0~0.base) .cse1)) (select (select (store (store (store .cse0 |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse2)))) (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|))) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (< (select (select (store (store (store .cse3 |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse2) (+ c_~s_6~0 (select (select .cse3 c_~X_0~0.base) .cse1) 1)))))))) is different from false [2023-08-24 01:44:07,999 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1)))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (< (select (select (store (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ (select (select .cse2 c_~X_0~0.base) .cse1) 1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 01:44:10,073 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_40| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_40| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_40| v_ArrVal_655))) (< (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ (select (select .cse0 c_~X_0~0.base) .cse1) 1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_40| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_40| v_ArrVal_655))) (<= (select (select .cse2 c_~X_0~0.base) .cse1) (select (select (store (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_40| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 01:44:10,175 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_40| Int) (v_ArrVal_654 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_654) |v_thread4Thread1of1ForFork0_~#t5~0.base_40| v_ArrVal_655))) (< (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ (select (select .cse0 c_~X_0~0.base) .cse1) 1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_40| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_40| Int) (v_ArrVal_654 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_654) |v_thread4Thread1of1ForFork0_~#t5~0.base_40| v_ArrVal_655))) (<= (select (select .cse2 c_~X_0~0.base) .cse1) (select (select (store (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1)))) (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_40| |c_#StackHeapBarrier|))))) is different from false [2023-08-24 01:44:25,413 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 01:44:25,413 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 55 [2023-08-24 01:44:25,538 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 692092918 treesize of output 664567798 [2023-08-24 01:44:26,476 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 563 treesize of output 535 [2023-08-24 01:44:26,504 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1126 treesize of output 1062 [2023-08-24 01:44:26,528 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1062 treesize of output 1030 [2023-08-24 01:44:26,551 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1030 treesize of output 902 [2023-08-24 01:44:26,571 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 423 treesize of output 367 [2023-08-24 01:44:26,591 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 478 treesize of output 366 [2023-08-24 01:44:27,399 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 01:44:27,412 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-24 01:44:27,412 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 1 [2023-08-24 01:44:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-24 01:44:27,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457735499] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 01:44:27,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 01:44:27,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 18] total 44 [2023-08-24 01:44:27,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978797413] [2023-08-24 01:44:27,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 01:44:27,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-08-24 01:44:27,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 01:44:27,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-08-24 01:44:27,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1246, Unknown=35, NotChecked=632, Total=2070 [2023-08-24 01:44:27,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 455 [2023-08-24 01:44:27,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 574 transitions, 5518 flow. Second operand has 46 states, 46 states have (on average 156.17391304347825) internal successors, (7184), 46 states have internal predecessors, (7184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 01:44:27,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 01:44:27,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 455 [2023-08-24 01:44:27,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 01:44:42,907 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1)))))))) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread4Thread1of1ForFork0_~#t5~0.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork5_~#t2~0.base|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (< (select (select (store (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ (select (select .cse2 c_~X_0~0.base) .cse1) 1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork5_~#t2~0.base|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= c_~X_0~0.offset 0))) is different from false [2023-08-24 01:44:44,315 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|) (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (select (select (store (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1)))))))) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread4Thread1of1ForFork0_~#t5~0.base|) (not (= c_~X_0~0.base |c_thread1Thread1of1ForFork5_~#t2~0.base|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_35| Int)) (or (forall ((v_ArrVal_656 (Array Int Int)) (v_ArrVal_655 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0.base_33| Int)) (or (<= |v_thread1Thread1of1ForFork5_~#t3~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_655))) (< (select (select (store (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_35| v_ArrVal_656) |c_thread1Thread1of1ForFork5_~#t2~0.base| v_ArrVal_657) |v_thread1Thread1of1ForFork5_~#t3~0.base_33| v_ArrVal_658) c_~X_0~0.base) .cse1) (+ (select (select .cse2 c_~X_0~0.base) .cse1) 1)))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_35| |c_#StackHeapBarrier|))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork5_~#t2~0.base|) (= c_~X_0~0.offset 0))) is different from false [2023-08-24 01:44:47,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:44:49,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:44:50,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:44:52,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:44:54,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:44:57,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:44:58,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:00,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:01,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:03,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:04,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:06,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:07,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:09,136 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-24 01:45:12,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:16,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:17,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:19,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:21,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:23,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:24,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:27,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:28,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:30,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:31,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:33,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:34,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:36,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:38,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:39,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:41,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:43,170 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 [1] [2023-08-24 01:45:44,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:46,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:48,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:49,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:53,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:55,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:45:57,049 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 [1] [2023-08-24 01:45:59,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:01,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:02,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:04,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:05,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:07,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:08,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:10,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:11,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:13,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:14,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:16,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:17,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:20,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:22,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:24,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:26,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:27,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:29,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:32,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:34,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:35,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:39,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:40,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:42,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:44,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:45,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:49,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:51,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:52,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 01:46:54,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]