/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/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 03:36:49,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 03:36:49,825 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 03:36:49,830 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 03:36:49,831 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 03:36:49,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 03:36:49,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 03:36:49,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 03:36:49,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 03:36:49,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 03:36:49,873 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 03:36:49,873 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 03:36:49,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 03:36:49,875 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 03:36:49,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 03:36:49,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 03:36:49,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 03:36:49,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 03:36:49,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 03:36:49,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 03:36:49,876 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 03:36:49,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 03:36:49,877 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 03:36:49,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 03:36:49,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 03:36:49,878 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 03:36:49,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 03:36:49,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 03:36:49,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 03:36:49,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 03:36:49,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 03:36:49,880 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 03:36:49,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 03:36:49,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 03:36:49,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 03:36:49,881 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 03:36:50,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 03:36:50,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 03:36:50,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 03:36:50,191 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 03:36:50,191 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 03:36:50,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-08-24 03:36:51,406 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 03:36:51,657 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 03:36:51,658 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-08-24 03:36:51,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a04190d/d4a329ea2a5f46c9922810e4d704010c/FLAG9f8dd64a1 [2023-08-24 03:36:51,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39a04190d/d4a329ea2a5f46c9922810e4d704010c [2023-08-24 03:36:51,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 03:36:51,690 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 03:36:51,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 03:36:51,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 03:36:51,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 03:36:51,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 03:36:51" (1/1) ... [2023-08-24 03:36:51,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c817867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:36:51, skipping insertion in model container [2023-08-24 03:36:51,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 03:36:51" (1/1) ... [2023-08-24 03:36:51,726 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 03:36:51,911 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/popl20-send-receive.wvr.c[3107,3120] [2023-08-24 03:36:51,921 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 03:36:51,931 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 03:36:51,964 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/popl20-send-receive.wvr.c[3107,3120] [2023-08-24 03:36:51,966 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 03:36:51,975 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 03:36:51,975 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 03:36:51,981 INFO L206 MainTranslator]: Completed translation [2023-08-24 03:36:51,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:36:51 WrapperNode [2023-08-24 03:36:51,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 03:36:51,983 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 03:36:51,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 03:36:51,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 03:36:51,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:36:51" (1/1) ... [2023-08-24 03:36:52,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:36:51" (1/1) ... [2023-08-24 03:36:52,038 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 165 [2023-08-24 03:36:52,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 03:36:52,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 03:36:52,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 03:36:52,039 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 03:36:52,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:36:51" (1/1) ... [2023-08-24 03:36:52,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:36:51" (1/1) ... [2023-08-24 03:36:52,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:36:51" (1/1) ... [2023-08-24 03:36:52,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:36:51" (1/1) ... [2023-08-24 03:36:52,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:36:51" (1/1) ... [2023-08-24 03:36:52,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:36:51" (1/1) ... [2023-08-24 03:36:52,074 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:36:51" (1/1) ... [2023-08-24 03:36:52,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:36:51" (1/1) ... [2023-08-24 03:36:52,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 03:36:52,087 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 03:36:52,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 03:36:52,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 03:36:52,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:36:51" (1/1) ... [2023-08-24 03:36:52,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 03:36:52,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:36:52,112 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 03:36:52,134 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 03:36:52,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 03:36:52,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 03:36:52,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 03:36:52,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 03:36:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 03:36:52,153 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 03:36:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 03:36:52,153 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 03:36:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 03:36:52,153 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 03:36:52,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 03:36:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 03:36:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 03:36:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 03:36:52,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 03:36:52,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 03:36:52,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 03:36:52,157 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 03:36:52,241 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 03:36:52,243 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 03:36:52,567 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 03:36:52,651 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 03:36:52,651 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-24 03:36:52,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 03:36:52 BoogieIcfgContainer [2023-08-24 03:36:52,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 03:36:52,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 03:36:52,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 03:36:52,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 03:36:52,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 03:36:51" (1/3) ... [2023-08-24 03:36:52,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119c2d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 03:36:52, skipping insertion in model container [2023-08-24 03:36:52,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:36:51" (2/3) ... [2023-08-24 03:36:52,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119c2d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 03:36:52, skipping insertion in model container [2023-08-24 03:36:52,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 03:36:52" (3/3) ... [2023-08-24 03:36:52,662 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2023-08-24 03:36:52,677 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 03:36:52,677 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 03:36:52,679 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 03:36:52,751 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-24 03:36:52,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 136 transitions, 296 flow [2023-08-24 03:36:52,907 INFO L124 PetriNetUnfolderBase]: 10/133 cut-off events. [2023-08-24 03:36:52,907 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 03:36:52,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 10/133 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-08-24 03:36:52,912 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 136 transitions, 296 flow [2023-08-24 03:36:52,919 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 123 transitions, 264 flow [2023-08-24 03:36:52,922 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 03:36:52,951 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 123 transitions, 264 flow [2023-08-24 03:36:52,954 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 123 transitions, 264 flow [2023-08-24 03:36:52,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 123 transitions, 264 flow [2023-08-24 03:36:52,984 INFO L124 PetriNetUnfolderBase]: 10/123 cut-off events. [2023-08-24 03:36:52,984 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 03:36:52,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 10/123 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-08-24 03:36:52,986 INFO L119 LiptonReduction]: Number of co-enabled transitions 1262 [2023-08-24 03:36:56,931 INFO L134 LiptonReduction]: Checked pairs total: 2063 [2023-08-24 03:36:56,931 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-24 03:36:56,942 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 03:36:56,947 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;@1fb7cb48, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 03:36:56,948 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 03:36:56,954 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 03:36:56,954 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2023-08-24 03:36:56,954 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 03:36:56,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:36:56,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:36:56,956 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:36:56,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:36:56,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1116037830, now seen corresponding path program 1 times [2023-08-24 03:36:56,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:36:56,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534354437] [2023-08-24 03:36:56,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:36:56,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:36:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:36:57,325 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 03:36:57,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:36:57,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534354437] [2023-08-24 03:36:57,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534354437] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 03:36:57,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 03:36:57,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 03:36:57,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719815322] [2023-08-24 03:36:57,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 03:36:57,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 03:36:57,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:36:57,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 03:36:57,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 03:36:57,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 248 [2023-08-24 03:36:57,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 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 03:36:57,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:36:57,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 248 [2023-08-24 03:36:57,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:36:57,546 INFO L124 PetriNetUnfolderBase]: 214/342 cut-off events. [2023-08-24 03:36:57,546 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-08-24 03:36:57,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 342 events. 214/342 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1036 event pairs, 15 based on Foata normal form. 0/305 useless extension candidates. Maximal degree in co-relation 616. Up to 121 conditions per place. [2023-08-24 03:36:57,550 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 48 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2023-08-24 03:36:57,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 242 flow [2023-08-24 03:36:57,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 03:36:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 03:36:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2023-08-24 03:36:57,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49193548387096775 [2023-08-24 03:36:57,570 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2023-08-24 03:36:57,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2023-08-24 03:36:57,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:36:57,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2023-08-24 03:36:57,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 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 03:36:57,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 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 03:36:57,591 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 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 03:36:57,593 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 5 states and 610 transitions. [2023-08-24 03:36:57,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 242 flow [2023-08-24 03:36:57,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 53 transitions, 219 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-24 03:36:57,601 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 82 flow [2023-08-24 03:36:57,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2023-08-24 03:36:57,607 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-24 03:36:57,607 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 82 flow [2023-08-24 03:36:57,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 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 03:36:57,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:36:57,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:36:57,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 03:36:57,609 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:36:57,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:36:57,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1567348952, now seen corresponding path program 2 times [2023-08-24 03:36:57,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:36:57,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320112255] [2023-08-24 03:36:57,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:36:57,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:36:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:36:57,730 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 03:36:57,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:36:57,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320112255] [2023-08-24 03:36:57,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320112255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 03:36:57,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 03:36:57,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 03:36:57,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155605777] [2023-08-24 03:36:57,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 03:36:57,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 03:36:57,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:36:57,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 03:36:57,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 03:36:57,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 248 [2023-08-24 03:36:57,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 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 03:36:57,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:36:57,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 248 [2023-08-24 03:36:57,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:36:57,843 INFO L124 PetriNetUnfolderBase]: 209/341 cut-off events. [2023-08-24 03:36:57,843 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2023-08-24 03:36:57,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 341 events. 209/341 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1074 event pairs, 30 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 452. Up to 167 conditions per place. [2023-08-24 03:36:57,846 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 44 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2023-08-24 03:36:57,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 51 transitions, 258 flow [2023-08-24 03:36:57,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 03:36:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 03:36:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-08-24 03:36:57,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4870967741935484 [2023-08-24 03:36:57,850 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-08-24 03:36:57,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-08-24 03:36:57,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:36:57,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-08-24 03:36:57,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 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 03:36:57,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 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 03:36:57,855 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 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 03:36:57,855 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 82 flow. Second operand 5 states and 604 transitions. [2023-08-24 03:36:57,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 51 transitions, 258 flow [2023-08-24 03:36:57,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 51 transitions, 253 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 03:36:57,858 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 123 flow [2023-08-24 03:36:57,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2023-08-24 03:36:57,859 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-08-24 03:36:57,860 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 123 flow [2023-08-24 03:36:57,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 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 03:36:57,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:36:57,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:36:57,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 03:36:57,861 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:36:57,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:36:57,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1909084888, now seen corresponding path program 3 times [2023-08-24 03:36:57,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:36:57,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824931223] [2023-08-24 03:36:57,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:36:57,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:36:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:36:58,095 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 03:36:58,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:36:58,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824931223] [2023-08-24 03:36:58,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824931223] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 03:36:58,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 03:36:58,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 03:36:58,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668020099] [2023-08-24 03:36:58,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 03:36:58,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 03:36:58,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:36:58,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 03:36:58,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 03:36:58,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 248 [2023-08-24 03:36:58,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 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 03:36:58,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:36:58,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 248 [2023-08-24 03:36:58,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:36:58,282 INFO L124 PetriNetUnfolderBase]: 328/534 cut-off events. [2023-08-24 03:36:58,282 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2023-08-24 03:36:58,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 534 events. 328/534 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1999 event pairs, 14 based on Foata normal form. 24/557 useless extension candidates. Maximal degree in co-relation 781. Up to 202 conditions per place. [2023-08-24 03:36:58,287 INFO L140 encePairwiseOnDemand]: 242/248 looper letters, 51 selfloop transitions, 6 changer transitions 15/72 dead transitions. [2023-08-24 03:36:58,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 72 transitions, 418 flow [2023-08-24 03:36:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 03:36:58,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 03:36:58,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 721 transitions. [2023-08-24 03:36:58,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845430107526882 [2023-08-24 03:36:58,290 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 721 transitions. [2023-08-24 03:36:58,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 721 transitions. [2023-08-24 03:36:58,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:36:58,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 721 transitions. [2023-08-24 03:36:58,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 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 03:36:58,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 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 03:36:58,296 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 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 03:36:58,296 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 123 flow. Second operand 6 states and 721 transitions. [2023-08-24 03:36:58,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 72 transitions, 418 flow [2023-08-24 03:36:58,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 413 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 03:36:58,301 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 128 flow [2023-08-24 03:36:58,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=128, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2023-08-24 03:36:58,303 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2023-08-24 03:36:58,305 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 128 flow [2023-08-24 03:36:58,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 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 03:36:58,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:36:58,307 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] [2023-08-24 03:36:58,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 03:36:58,307 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:36:58,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:36:58,307 INFO L85 PathProgramCache]: Analyzing trace with hash -957600211, now seen corresponding path program 1 times [2023-08-24 03:36:58,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:36:58,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783220319] [2023-08-24 03:36:58,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:36:58,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:36:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:36:58,500 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 03:36:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:36:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783220319] [2023-08-24 03:36:58,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783220319] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 03:36:58,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 03:36:58,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 03:36:58,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111189306] [2023-08-24 03:36:58,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 03:36:58,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 03:36:58,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:36:58,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 03:36:58,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 03:36:58,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 248 [2023-08-24 03:36:58,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 03:36:58,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:36:58,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 248 [2023-08-24 03:36:58,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:36:58,574 INFO L124 PetriNetUnfolderBase]: 80/163 cut-off events. [2023-08-24 03:36:58,574 INFO L125 PetriNetUnfolderBase]: For 349/375 co-relation queries the response was YES. [2023-08-24 03:36:58,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 163 events. 80/163 cut-off events. For 349/375 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 464 event pairs, 15 based on Foata normal form. 36/194 useless extension candidates. Maximal degree in co-relation 463. Up to 121 conditions per place. [2023-08-24 03:36:58,577 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-24 03:36:58,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 175 flow [2023-08-24 03:36:58,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 03:36:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 03:36:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-24 03:36:58,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48655913978494625 [2023-08-24 03:36:58,579 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-24 03:36:58,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-24 03:36:58,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:36:58,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-24 03:36:58,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 03:36:58,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 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 03:36:58,583 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 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 03:36:58,583 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 128 flow. Second operand 3 states and 362 transitions. [2023-08-24 03:36:58,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 175 flow [2023-08-24 03:36:58,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 153 flow, removed 1 selfloop flow, removed 10 redundant places. [2023-08-24 03:36:58,588 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 104 flow [2023-08-24 03:36:58,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-24 03:36:58,590 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2023-08-24 03:36:58,590 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 104 flow [2023-08-24 03:36:58,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 03:36:58,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:36:58,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:36:58,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 03:36:58,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:36:58,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:36:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2068012950, now seen corresponding path program 1 times [2023-08-24 03:36:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:36:58,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754684627] [2023-08-24 03:36:58,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:36:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:36:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:36:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 03:36:58,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:36:58,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754684627] [2023-08-24 03:36:58,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754684627] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 03:36:58,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 03:36:58,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 03:36:58,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328286532] [2023-08-24 03:36:58,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 03:36:58,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 03:36:58,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:36:58,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 03:36:58,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 03:36:58,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 248 [2023-08-24 03:36:58,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 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 03:36:58,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:36:58,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 248 [2023-08-24 03:36:58,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:36:58,806 INFO L124 PetriNetUnfolderBase]: 83/178 cut-off events. [2023-08-24 03:36:58,806 INFO L125 PetriNetUnfolderBase]: For 245/289 co-relation queries the response was YES. [2023-08-24 03:36:58,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 178 events. 83/178 cut-off events. For 245/289 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 40 based on Foata normal form. 48/219 useless extension candidates. Maximal degree in co-relation 376. Up to 137 conditions per place. [2023-08-24 03:36:58,808 INFO L140 encePairwiseOnDemand]: 244/248 looper letters, 22 selfloop transitions, 2 changer transitions 8/37 dead transitions. [2023-08-24 03:36:58,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 190 flow [2023-08-24 03:36:58,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 03:36:58,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 03:36:58,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions. [2023-08-24 03:36:58,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45060483870967744 [2023-08-24 03:36:58,810 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 447 transitions. [2023-08-24 03:36:58,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions. [2023-08-24 03:36:58,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:36:58,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions. [2023-08-24 03:36:58,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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 03:36:58,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 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 03:36:58,815 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 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 03:36:58,815 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 104 flow. Second operand 4 states and 447 transitions. [2023-08-24 03:36:58,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 190 flow [2023-08-24 03:36:58,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 03:36:58,818 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 116 flow [2023-08-24 03:36:58,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-08-24 03:36:58,820 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-08-24 03:36:58,820 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 116 flow [2023-08-24 03:36:58,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 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 03:36:58,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:36:58,821 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] [2023-08-24 03:36:58,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 03:36:58,821 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:36:58,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:36:58,821 INFO L85 PathProgramCache]: Analyzing trace with hash 876728516, now seen corresponding path program 1 times [2023-08-24 03:36:58,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:36:58,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623072506] [2023-08-24 03:36:58,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:36:58,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:36:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:36:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:36:59,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:36:59,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623072506] [2023-08-24 03:36:59,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623072506] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:36:59,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650561253] [2023-08-24 03:36:59,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:36:59,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:36:59,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:36:59,757 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 03:36:59,806 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 03:36:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:36:59,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-24 03:36:59,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:37:00,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 03:37:00,115 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 03:37:00,170 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 03:37:00,228 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 03:37:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:37:00,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:37:00,899 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< c_~back~0 0) (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2)) 1)))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse2))) (not (= (select .cse3 .cse1) 1)))))))) is different from false [2023-08-24 03:37:00,996 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse0 .cse2)))))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse3 .cse2)) 1) (not (= (select .cse3 .cse1) 1))))))) (< c_~back~0 0)) is different from false [2023-08-24 03:37:01,036 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:01,036 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 56 [2023-08-24 03:37:01,056 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:01,057 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 644 treesize of output 620 [2023-08-24 03:37:01,085 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:01,085 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 296 treesize of output 280 [2023-08-24 03:37:01,107 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:01,107 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 205 treesize of output 201 [2023-08-24 03:37:01,130 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:01,130 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 260 treesize of output 220 [2023-08-24 03:37:01,843 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:01,843 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 56 [2023-08-24 03:37:01,859 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 03:37:01,859 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 644 treesize of output 616 [2023-08-24 03:37:01,890 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 03:37:01,890 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 296 treesize of output 252 [2023-08-24 03:37:01,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 03:37:01,909 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 170 [2023-08-24 03:37:01,928 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 03:37:01,929 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 181 treesize of output 161 [2023-08-24 03:37:02,095 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 03:37:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-24 03:37:02,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650561253] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 03:37:02,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 03:37:02,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2023-08-24 03:37:02,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494515986] [2023-08-24 03:37:02,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 03:37:02,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 03:37:02,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:37:02,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 03:37:02,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=568, Unknown=3, NotChecked=102, Total=812 [2023-08-24 03:37:02,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 03:37:02,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 116 flow. Second operand has 29 states, 29 states have (on average 63.89655172413793) internal successors, (1853), 29 states have internal predecessors, (1853), 0 states have call successors, (0), 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 03:37:02,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:37:02,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 03:37:02,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:37:02,257 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~back~0 4)) (.cse12 (* c_~front~0 4))) (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 c_~back~0)) (.cse4 (+ c_~queue~0.offset .cse12)) (.cse2 (< c_~back~0 0)) (.cse5 (+ c_~queue~0.offset .cse11))) (and (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= c_~back~0 c_~front~0)) .cse2) (<= c_~v_assert~0 1) (or (and (forall ((v_ArrVal_149 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse3 .cse4)) 1) (not (= (select .cse3 .cse5) 1))))) (forall ((v_ArrVal_149 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base))) (or (not (= (select .cse6 .cse5) 1)) (<= 0 (+ c_~sum~0 (select .cse6 .cse4))))))) .cse0 .cse1 .cse2) (or .cse0 .cse1 (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse9 (+ .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse7 .cse8) 1)) (<= 0 (+ c_~sum~0 (select .cse7 .cse9)))))) (forall ((v_ArrVal_149 (Array Int Int)) (v_ArrVal_148 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_147) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ c_~sum~0 (select .cse10 .cse9)) 1) (not (= (select .cse10 .cse8) 1))))))) .cse2) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (let ((.cse14 (select |c_#memory_int| c_~queue~0.base))) (or .cse0 .cse1 (let ((.cse13 (+ c_~sum~0 (select .cse14 .cse4)))) (and (<= .cse13 1) (<= 0 .cse13))) .cse2 (not (= (select .cse14 .cse5) 1))))))) is different from false [2023-08-24 03:37:06,732 INFO L124 PetriNetUnfolderBase]: 1571/2606 cut-off events. [2023-08-24 03:37:06,732 INFO L125 PetriNetUnfolderBase]: For 2163/2163 co-relation queries the response was YES. [2023-08-24 03:37:06,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7835 conditions, 2606 events. 1571/2606 cut-off events. For 2163/2163 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 13456 event pairs, 70 based on Foata normal form. 94/2696 useless extension candidates. Maximal degree in co-relation 7816. Up to 483 conditions per place. [2023-08-24 03:37:06,746 INFO L140 encePairwiseOnDemand]: 234/248 looper letters, 245 selfloop transitions, 118 changer transitions 84/447 dead transitions. [2023-08-24 03:37:06,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 447 transitions, 2584 flow [2023-08-24 03:37:06,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-08-24 03:37:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2023-08-24 03:37:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 4702 transitions. [2023-08-24 03:37:06,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27477793361383823 [2023-08-24 03:37:06,763 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 4702 transitions. [2023-08-24 03:37:06,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 4702 transitions. [2023-08-24 03:37:06,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:37:06,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 4702 transitions. [2023-08-24 03:37:06,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 68.14492753623189) internal successors, (4702), 69 states have internal predecessors, (4702), 0 states have call successors, (0), 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 03:37:06,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 248.0) internal successors, (17360), 70 states have internal predecessors, (17360), 0 states have call successors, (0), 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 03:37:06,804 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 248.0) internal successors, (17360), 70 states have internal predecessors, (17360), 0 states have call successors, (0), 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 03:37:06,804 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 116 flow. Second operand 69 states and 4702 transitions. [2023-08-24 03:37:06,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 447 transitions, 2584 flow [2023-08-24 03:37:06,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 447 transitions, 2568 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-24 03:37:06,814 INFO L231 Difference]: Finished difference. Result has 137 places, 169 transitions, 1215 flow [2023-08-24 03:37:06,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=1215, PETRI_PLACES=137, PETRI_TRANSITIONS=169} [2023-08-24 03:37:06,817 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 106 predicate places. [2023-08-24 03:37:06,817 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 169 transitions, 1215 flow [2023-08-24 03:37:06,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 63.89655172413793) internal successors, (1853), 29 states have internal predecessors, (1853), 0 states have call successors, (0), 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 03:37:06,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:37:06,818 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] [2023-08-24 03:37:06,827 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 03:37:07,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-24 03:37:07,023 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:37:07,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:37:07,024 INFO L85 PathProgramCache]: Analyzing trace with hash -19731206, now seen corresponding path program 2 times [2023-08-24 03:37:07,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:37:07,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527805825] [2023-08-24 03:37:07,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:37:07,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:37:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:37:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:37:08,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:37:08,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527805825] [2023-08-24 03:37:08,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527805825] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:37:08,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483463436] [2023-08-24 03:37:08,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 03:37:08,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:37:08,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:37:08,275 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 03:37:08,284 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 03:37:08,372 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 03:37:08,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 03:37:08,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 44 conjunts are in the unsatisfiable core [2023-08-24 03:37:08,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:37:08,445 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 15 treesize of output 11 [2023-08-24 03:37:08,487 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 03:37:08,541 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 03:37:08,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 03:37:08,695 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 18 treesize of output 20 [2023-08-24 03:37:08,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:37:08,799 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:37:09,298 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1)) 1)) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1))))))))) (< c_~back~0 0)) is different from false [2023-08-24 03:37:09,492 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:09,492 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 65 treesize of output 53 [2023-08-24 03:37:09,503 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:09,503 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 484 treesize of output 460 [2023-08-24 03:37:09,515 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 152 treesize of output 128 [2023-08-24 03:37:09,528 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:09,529 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 126 treesize of output 122 [2023-08-24 03:37:09,542 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:09,543 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 125 treesize of output 109 [2023-08-24 03:37:09,814 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:09,814 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 53 [2023-08-24 03:37:09,817 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 03:37:09,824 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 03:37:09,825 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 136 [2023-08-24 03:37:09,838 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 03:37:09,838 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 132 treesize of output 112 [2023-08-24 03:37:09,852 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 03:37:09,853 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 83 treesize of output 75 [2023-08-24 03:37:09,898 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 03:37:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:37:09,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483463436] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 03:37:09,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 03:37:09,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2023-08-24 03:37:09,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311711228] [2023-08-24 03:37:09,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 03:37:09,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-24 03:37:09,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:37:09,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-24 03:37:09,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=788, Unknown=9, NotChecked=58, Total=992 [2023-08-24 03:37:09,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 03:37:09,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 169 transitions, 1215 flow. Second operand has 32 states, 32 states have (on average 63.84375) internal successors, (2043), 32 states have internal predecessors, (2043), 0 states have call successors, (0), 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 03:37:09,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:37:09,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 03:37:09,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:37:10,427 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse6 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse3 (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse6)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse6)))))) (.cse4 (not (= (select (select |c_#memory_int| c_~queue~0.base) .cse7) 1))) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 c_~back~0)) (.cse2 (< c_~back~0 0))) (and (<= c_~v_assert~0 1) (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse6)) 1)) (not (= (select (select .cse5 c_~queue~0.base) .cse7) 1))))) (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (not (= (select (select .cse8 c_~queue~0.base) .cse7) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse6)))))))) .cse2) (or .cse1 .cse2 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) .cse3 .cse4) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (= c_~back~0 c_~front~0)))))) is different from false [2023-08-24 03:37:10,463 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1)) 1)) (not (= (select (select .cse0 c_~queue~0.base) .cse2) 1))))) (forall ((v_ArrVal_197 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_197))) (or (not (= (select (select .cse3 c_~queue~0.base) .cse2) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse1))))))))) (< c_~back~0 0)) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2023-08-24 03:37:10,649 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n~0 c_~back~0)) (.cse1 (< c_~back~0 0)) (.cse2 (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_198 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_198 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_198) c_~queue~0.base) .cse4))))))) (.cse3 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)))) (and (or (= (mod c_~v_assert~0 256) 0) .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse1 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) .cse2 .cse3))) is different from false [2023-08-24 03:37:23,857 INFO L124 PetriNetUnfolderBase]: 1572/2591 cut-off events. [2023-08-24 03:37:23,858 INFO L125 PetriNetUnfolderBase]: For 30821/30821 co-relation queries the response was YES. [2023-08-24 03:37:23,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12215 conditions, 2591 events. 1572/2591 cut-off events. For 30821/30821 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13002 event pairs, 104 based on Foata normal form. 142/2731 useless extension candidates. Maximal degree in co-relation 10937. Up to 563 conditions per place. [2023-08-24 03:37:23,882 INFO L140 encePairwiseOnDemand]: 232/248 looper letters, 233 selfloop transitions, 139 changer transitions 94/466 dead transitions. [2023-08-24 03:37:23,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 466 transitions, 4161 flow [2023-08-24 03:37:23,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-08-24 03:37:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-08-24 03:37:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 3652 transitions. [2023-08-24 03:37:23,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.272700119474313 [2023-08-24 03:37:23,892 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 3652 transitions. [2023-08-24 03:37:23,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 3652 transitions. [2023-08-24 03:37:23,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:37:23,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 3652 transitions. [2023-08-24 03:37:23,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 67.62962962962963) internal successors, (3652), 54 states have internal predecessors, (3652), 0 states have call successors, (0), 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 03:37:23,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 248.0) internal successors, (13640), 55 states have internal predecessors, (13640), 0 states have call successors, (0), 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 03:37:23,919 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 248.0) internal successors, (13640), 55 states have internal predecessors, (13640), 0 states have call successors, (0), 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 03:37:23,919 INFO L175 Difference]: Start difference. First operand has 137 places, 169 transitions, 1215 flow. Second operand 54 states and 3652 transitions. [2023-08-24 03:37:23,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 466 transitions, 4161 flow [2023-08-24 03:37:23,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 466 transitions, 3700 flow, removed 206 selfloop flow, removed 17 redundant places. [2023-08-24 03:37:23,983 INFO L231 Difference]: Finished difference. Result has 180 places, 218 transitions, 1864 flow [2023-08-24 03:37:23,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=1864, PETRI_PLACES=180, PETRI_TRANSITIONS=218} [2023-08-24 03:37:23,983 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 149 predicate places. [2023-08-24 03:37:23,984 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 218 transitions, 1864 flow [2023-08-24 03:37:23,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 63.84375) internal successors, (2043), 32 states have internal predecessors, (2043), 0 states have call successors, (0), 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 03:37:23,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:37:23,985 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] [2023-08-24 03:37:23,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 03:37:24,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-08-24 03:37:24,189 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:37:24,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:37:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash 458145310, now seen corresponding path program 3 times [2023-08-24 03:37:24,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:37:24,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031417230] [2023-08-24 03:37:24,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:37:24,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:37:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:37:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:37:25,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:37:25,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031417230] [2023-08-24 03:37:25,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031417230] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:37:25,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315335566] [2023-08-24 03:37:25,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 03:37:25,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:37:25,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:37:25,145 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 03:37:25,146 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 03:37:25,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 03:37:25,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 03:37:25,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-24 03:37:25,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:37:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 03:37:25,449 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:37:25,581 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:25,582 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 68 treesize of output 44 [2023-08-24 03:37:25,818 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 03:37:25,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315335566] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 03:37:25,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 03:37:25,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 22 [2023-08-24 03:37:25,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686652178] [2023-08-24 03:37:25,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 03:37:25,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-24 03:37:25,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:37:25,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-24 03:37:25,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2023-08-24 03:37:25,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 248 [2023-08-24 03:37:25,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 218 transitions, 1864 flow. Second operand has 23 states, 23 states have (on average 74.65217391304348) internal successors, (1717), 23 states have internal predecessors, (1717), 0 states have call successors, (0), 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 03:37:25,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:37:25,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 248 [2023-08-24 03:37:25,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:37:27,188 INFO L124 PetriNetUnfolderBase]: 1490/2473 cut-off events. [2023-08-24 03:37:27,188 INFO L125 PetriNetUnfolderBase]: For 15876/15876 co-relation queries the response was YES. [2023-08-24 03:37:27,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12899 conditions, 2473 events. 1490/2473 cut-off events. For 15876/15876 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12348 event pairs, 107 based on Foata normal form. 42/2514 useless extension candidates. Maximal degree in co-relation 12712. Up to 738 conditions per place. [2023-08-24 03:37:27,216 INFO L140 encePairwiseOnDemand]: 235/248 looper letters, 215 selfloop transitions, 183 changer transitions 24/422 dead transitions. [2023-08-24 03:37:27,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 422 transitions, 4489 flow [2023-08-24 03:37:27,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-24 03:37:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-24 03:37:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2245 transitions. [2023-08-24 03:37:27,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3121523915461624 [2023-08-24 03:37:27,220 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 2245 transitions. [2023-08-24 03:37:27,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 2245 transitions. [2023-08-24 03:37:27,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:37:27,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 2245 transitions. [2023-08-24 03:37:27,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 77.41379310344827) internal successors, (2245), 29 states have internal predecessors, (2245), 0 states have call successors, (0), 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 03:37:27,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 248.0) internal successors, (7440), 30 states have internal predecessors, (7440), 0 states have call successors, (0), 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 03:37:27,232 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 248.0) internal successors, (7440), 30 states have internal predecessors, (7440), 0 states have call successors, (0), 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 03:37:27,232 INFO L175 Difference]: Start difference. First operand has 180 places, 218 transitions, 1864 flow. Second operand 29 states and 2245 transitions. [2023-08-24 03:37:27,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 422 transitions, 4489 flow [2023-08-24 03:37:27,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 422 transitions, 4092 flow, removed 175 selfloop flow, removed 17 redundant places. [2023-08-24 03:37:27,382 INFO L231 Difference]: Finished difference. Result has 187 places, 288 transitions, 2787 flow [2023-08-24 03:37:27,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=2787, PETRI_PLACES=187, PETRI_TRANSITIONS=288} [2023-08-24 03:37:27,384 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 156 predicate places. [2023-08-24 03:37:27,384 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 288 transitions, 2787 flow [2023-08-24 03:37:27,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 74.65217391304348) internal successors, (1717), 23 states have internal predecessors, (1717), 0 states have call successors, (0), 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 03:37:27,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:37:27,385 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] [2023-08-24 03:37:27,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-24 03:37:27,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:37:27,590 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:37:27,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:37:27,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1536834318, now seen corresponding path program 4 times [2023-08-24 03:37:27,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:37:27,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279861712] [2023-08-24 03:37:27,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:37:27,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:37:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:37:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:37:28,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:37:28,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279861712] [2023-08-24 03:37:28,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279861712] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:37:28,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968103113] [2023-08-24 03:37:28,419 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 03:37:28,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:37:28,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:37:28,425 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 03:37:28,451 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 03:37:28,509 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 03:37:28,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 03:37:28,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-24 03:37:28,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:37:28,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 03:37:28,703 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 18 treesize of output 20 [2023-08-24 03:37:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 03:37:28,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:37:28,888 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_295 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_295) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_295 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_295) c_~queue~0.base) .cse0)) 1)))) is different from false [2023-08-24 03:37:28,916 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:28,917 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 110 treesize of output 86 [2023-08-24 03:37:28,923 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 53 treesize of output 47 [2023-08-24 03:37:28,927 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 47 treesize of output 41 [2023-08-24 03:37:29,155 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 03:37:29,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968103113] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 03:37:29,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 03:37:29,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 25 [2023-08-24 03:37:29,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981277103] [2023-08-24 03:37:29,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 03:37:29,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-24 03:37:29,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:37:29,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-24 03:37:29,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=516, Unknown=1, NotChecked=46, Total=650 [2023-08-24 03:37:29,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 248 [2023-08-24 03:37:29,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 288 transitions, 2787 flow. Second operand has 26 states, 26 states have (on average 70.34615384615384) internal successors, (1829), 26 states have internal predecessors, (1829), 0 states have call successors, (0), 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 03:37:29,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:37:29,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 248 [2023-08-24 03:37:29,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:37:30,709 INFO L124 PetriNetUnfolderBase]: 1560/2585 cut-off events. [2023-08-24 03:37:30,709 INFO L125 PetriNetUnfolderBase]: For 18349/18349 co-relation queries the response was YES. [2023-08-24 03:37:30,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14011 conditions, 2585 events. 1560/2585 cut-off events. For 18349/18349 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12898 event pairs, 109 based on Foata normal form. 42/2627 useless extension candidates. Maximal degree in co-relation 13350. Up to 705 conditions per place. [2023-08-24 03:37:30,741 INFO L140 encePairwiseOnDemand]: 236/248 looper letters, 230 selfloop transitions, 176 changer transitions 36/442 dead transitions. [2023-08-24 03:37:30,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 442 transitions, 5037 flow [2023-08-24 03:37:30,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-24 03:37:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-24 03:37:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1916 transitions. [2023-08-24 03:37:30,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29714640198511166 [2023-08-24 03:37:30,745 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 1916 transitions. [2023-08-24 03:37:30,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 1916 transitions. [2023-08-24 03:37:30,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:37:30,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1916 transitions. [2023-08-24 03:37:30,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 73.6923076923077) internal successors, (1916), 26 states have internal predecessors, (1916), 0 states have call successors, (0), 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 03:37:30,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 248.0) internal successors, (6696), 27 states have internal predecessors, (6696), 0 states have call successors, (0), 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 03:37:30,763 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 248.0) internal successors, (6696), 27 states have internal predecessors, (6696), 0 states have call successors, (0), 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 03:37:30,763 INFO L175 Difference]: Start difference. First operand has 187 places, 288 transitions, 2787 flow. Second operand 26 states and 1916 transitions. [2023-08-24 03:37:30,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 442 transitions, 5037 flow [2023-08-24 03:37:30,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 442 transitions, 4700 flow, removed 62 selfloop flow, removed 9 redundant places. [2023-08-24 03:37:30,862 INFO L231 Difference]: Finished difference. Result has 209 places, 303 transitions, 3196 flow [2023-08-24 03:37:30,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=2519, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=3196, PETRI_PLACES=209, PETRI_TRANSITIONS=303} [2023-08-24 03:37:30,864 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 178 predicate places. [2023-08-24 03:37:30,864 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 303 transitions, 3196 flow [2023-08-24 03:37:30,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 70.34615384615384) internal successors, (1829), 26 states have internal predecessors, (1829), 0 states have call successors, (0), 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 03:37:30,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:37:30,865 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 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 03:37:30,872 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 03:37:31,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:37:31,069 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:37:31,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:37:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash 238598793, now seen corresponding path program 5 times [2023-08-24 03:37:31,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:37:31,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648751282] [2023-08-24 03:37:31,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:37:31,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:37:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:37:31,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:37:31,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:37:31,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648751282] [2023-08-24 03:37:31,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648751282] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:37:31,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422546282] [2023-08-24 03:37:31,251 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 03:37:31,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:37:31,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:37:31,252 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 03:37:31,282 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 03:37:31,348 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-24 03:37:31,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 03:37:31,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-24 03:37:31,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:37:31,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:37:31,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:37:31,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:37:31,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422546282] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 03:37:31,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 03:37:31,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-08-24 03:37:31,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653426882] [2023-08-24 03:37:31,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 03:37:31,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 03:37:31,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:37:31,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 03:37:31,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-08-24 03:37:31,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 248 [2023-08-24 03:37:31,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 303 transitions, 3196 flow. Second operand has 13 states, 13 states have (on average 103.0) internal successors, (1339), 13 states have internal predecessors, (1339), 0 states have call successors, (0), 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 03:37:31,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:37:31,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 248 [2023-08-24 03:37:31,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:37:31,876 INFO L124 PetriNetUnfolderBase]: 563/1117 cut-off events. [2023-08-24 03:37:31,877 INFO L125 PetriNetUnfolderBase]: For 13657/13721 co-relation queries the response was YES. [2023-08-24 03:37:31,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6855 conditions, 1117 events. 563/1117 cut-off events. For 13657/13721 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5905 event pairs, 57 based on Foata normal form. 71/1157 useless extension candidates. Maximal degree in co-relation 6799. Up to 579 conditions per place. [2023-08-24 03:37:31,889 INFO L140 encePairwiseOnDemand]: 243/248 looper letters, 98 selfloop transitions, 22 changer transitions 49/223 dead transitions. [2023-08-24 03:37:31,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 223 transitions, 2674 flow [2023-08-24 03:37:31,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 03:37:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 03:37:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 846 transitions. [2023-08-24 03:37:31,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4264112903225806 [2023-08-24 03:37:31,891 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 846 transitions. [2023-08-24 03:37:31,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 846 transitions. [2023-08-24 03:37:31,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:37:31,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 846 transitions. [2023-08-24 03:37:31,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.75) internal successors, (846), 8 states have internal predecessors, (846), 0 states have call successors, (0), 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 03:37:31,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 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 03:37:31,895 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 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 03:37:31,895 INFO L175 Difference]: Start difference. First operand has 209 places, 303 transitions, 3196 flow. Second operand 8 states and 846 transitions. [2023-08-24 03:37:31,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 223 transitions, 2674 flow [2023-08-24 03:37:31,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 223 transitions, 2388 flow, removed 67 selfloop flow, removed 29 redundant places. [2023-08-24 03:37:31,949 INFO L231 Difference]: Finished difference. Result has 165 places, 171 transitions, 1687 flow [2023-08-24 03:37:31,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1978, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1687, PETRI_PLACES=165, PETRI_TRANSITIONS=171} [2023-08-24 03:37:31,950 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 134 predicate places. [2023-08-24 03:37:31,950 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 171 transitions, 1687 flow [2023-08-24 03:37:31,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 103.0) internal successors, (1339), 13 states have internal predecessors, (1339), 0 states have call successors, (0), 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 03:37:31,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:37:31,951 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:37:31,956 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 03:37:32,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-24 03:37:32,155 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:37:32,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:37:32,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1886288447, now seen corresponding path program 6 times [2023-08-24 03:37:32,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:37:32,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477329759] [2023-08-24 03:37:32,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:37:32,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:37:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:37:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 03:37:32,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:37:32,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477329759] [2023-08-24 03:37:32,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477329759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 03:37:32,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 03:37:32,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 03:37:32,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501621574] [2023-08-24 03:37:32,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 03:37:32,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 03:37:32,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:37:32,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 03:37:32,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 03:37:32,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 248 [2023-08-24 03:37:32,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 171 transitions, 1687 flow. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 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 03:37:32,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:37:32,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 248 [2023-08-24 03:37:32,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:37:32,624 INFO L124 PetriNetUnfolderBase]: 949/1822 cut-off events. [2023-08-24 03:37:32,624 INFO L125 PetriNetUnfolderBase]: For 12020/12088 co-relation queries the response was YES. [2023-08-24 03:37:32,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9607 conditions, 1822 events. 949/1822 cut-off events. For 12020/12088 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 10025 event pairs, 107 based on Foata normal form. 73/1860 useless extension candidates. Maximal degree in co-relation 9565. Up to 636 conditions per place. [2023-08-24 03:37:32,639 INFO L140 encePairwiseOnDemand]: 245/248 looper letters, 140 selfloop transitions, 67 changer transitions 1/262 dead transitions. [2023-08-24 03:37:32,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 262 transitions, 2975 flow [2023-08-24 03:37:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 03:37:32,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 03:37:32,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 509 transitions. [2023-08-24 03:37:32,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131048387096774 [2023-08-24 03:37:32,641 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 509 transitions. [2023-08-24 03:37:32,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 509 transitions. [2023-08-24 03:37:32,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:37:32,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 509 transitions. [2023-08-24 03:37:32,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 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 03:37:32,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 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 03:37:32,643 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 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 03:37:32,644 INFO L175 Difference]: Start difference. First operand has 165 places, 171 transitions, 1687 flow. Second operand 4 states and 509 transitions. [2023-08-24 03:37:32,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 262 transitions, 2975 flow [2023-08-24 03:37:32,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 262 transitions, 2677 flow, removed 28 selfloop flow, removed 15 redundant places. [2023-08-24 03:37:32,676 INFO L231 Difference]: Finished difference. Result has 127 places, 218 transitions, 2315 flow [2023-08-24 03:37:32,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=1497, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2315, PETRI_PLACES=127, PETRI_TRANSITIONS=218} [2023-08-24 03:37:32,676 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 96 predicate places. [2023-08-24 03:37:32,676 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 218 transitions, 2315 flow [2023-08-24 03:37:32,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 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 03:37:32,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:37:32,677 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:37:32,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 03:37:32,677 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:37:32,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:37:32,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1530240330, now seen corresponding path program 7 times [2023-08-24 03:37:32,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:37:32,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355406082] [2023-08-24 03:37:32,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:37:32,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:37:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:37:33,673 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:37:33,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:37:33,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355406082] [2023-08-24 03:37:33,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355406082] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:37:33,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531006217] [2023-08-24 03:37:33,674 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 03:37:33,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:37:33,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:37:33,675 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 03:37:33,676 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 03:37:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:37:33,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-24 03:37:33,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:37:34,179 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:37:34,179 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:37:34,556 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-24 03:37:34,557 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 178 [2023-08-24 03:37:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:37:35,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531006217] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 03:37:35,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 03:37:35,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 12] total 34 [2023-08-24 03:37:35,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064438282] [2023-08-24 03:37:35,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 03:37:35,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-24 03:37:35,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:37:35,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-24 03:37:35,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2023-08-24 03:37:35,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 248 [2023-08-24 03:37:35,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 218 transitions, 2315 flow. Second operand has 35 states, 35 states have (on average 74.0) internal successors, (2590), 35 states have internal predecessors, (2590), 0 states have call successors, (0), 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 03:37:35,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:37:35,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 248 [2023-08-24 03:37:35,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:37:43,227 INFO L124 PetriNetUnfolderBase]: 6409/10849 cut-off events. [2023-08-24 03:37:43,229 INFO L125 PetriNetUnfolderBase]: For 61871/61871 co-relation queries the response was YES. [2023-08-24 03:37:43,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59137 conditions, 10849 events. 6409/10849 cut-off events. For 61871/61871 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 72317 event pairs, 171 based on Foata normal form. 334/11183 useless extension candidates. Maximal degree in co-relation 59103. Up to 2732 conditions per place. [2023-08-24 03:37:43,325 INFO L140 encePairwiseOnDemand]: 235/248 looper letters, 552 selfloop transitions, 502 changer transitions 445/1499 dead transitions. [2023-08-24 03:37:43,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 1499 transitions, 17398 flow [2023-08-24 03:37:43,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2023-08-24 03:37:43,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2023-08-24 03:37:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 7012 transitions. [2023-08-24 03:37:43,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31768756795940556 [2023-08-24 03:37:43,345 INFO L72 ComplementDD]: Start complementDD. Operand 89 states and 7012 transitions. [2023-08-24 03:37:43,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 7012 transitions. [2023-08-24 03:37:43,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:37:43,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 89 states and 7012 transitions. [2023-08-24 03:37:43,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 90 states, 89 states have (on average 78.78651685393258) internal successors, (7012), 89 states have internal predecessors, (7012), 0 states have call successors, (0), 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 03:37:43,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 90 states, 90 states have (on average 248.0) internal successors, (22320), 90 states have internal predecessors, (22320), 0 states have call successors, (0), 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 03:37:43,389 INFO L81 ComplementDD]: Finished complementDD. Result has 90 states, 90 states have (on average 248.0) internal successors, (22320), 90 states have internal predecessors, (22320), 0 states have call successors, (0), 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 03:37:43,389 INFO L175 Difference]: Start difference. First operand has 127 places, 218 transitions, 2315 flow. Second operand 89 states and 7012 transitions. [2023-08-24 03:37:43,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 1499 transitions, 17398 flow [2023-08-24 03:37:43,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 1499 transitions, 17318 flow, removed 40 selfloop flow, removed 0 redundant places. [2023-08-24 03:37:43,566 INFO L231 Difference]: Finished difference. Result has 266 places, 644 transitions, 9554 flow [2023-08-24 03:37:43,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=2293, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=89, PETRI_FLOW=9554, PETRI_PLACES=266, PETRI_TRANSITIONS=644} [2023-08-24 03:37:43,567 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 235 predicate places. [2023-08-24 03:37:43,567 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 644 transitions, 9554 flow [2023-08-24 03:37:43,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 74.0) internal successors, (2590), 35 states have internal predecessors, (2590), 0 states have call successors, (0), 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 03:37:43,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:37:43,568 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:37:43,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-24 03:37:43,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:37:43,773 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:37:43,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:37:43,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1405231144, now seen corresponding path program 8 times [2023-08-24 03:37:43,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:37:43,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120758254] [2023-08-24 03:37:43,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:37:43,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:37:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:37:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:37:44,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:37:44,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120758254] [2023-08-24 03:37:44,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120758254] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:37:44,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803209094] [2023-08-24 03:37:44,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 03:37:44,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:37:44,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:37:44,989 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 03:37:44,991 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 03:37:45,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 03:37:45,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 03:37:45,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-24 03:37:45,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:37:45,186 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 03:37:45,230 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 03:37:45,275 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 03:37:45,325 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 03:37:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:37:45,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:37:46,898 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_~front~0 1))) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (<= (+ c_~back~0 1) c_~front~0) (let ((.cse7 (* c_~front~0 4)) (.cse6 (* c_~back~0 4))) (let ((.cse1 (+ .cse6 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse7 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)) 1) (not (= (select .cse0 .cse4) 1))))) (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_462) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse5 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3))) (not (= (select .cse5 .cse4) 1)))))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< .cse8 0) (< c_~back~0 0) (<= c_~n~0 .cse8))) is different from false [2023-08-24 03:37:46,932 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:46,932 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 135 treesize of output 99 [2023-08-24 03:37:46,970 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 03:37:46,971 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2306 treesize of output 2196 [2023-08-24 03:37:46,998 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 03:37:47,014 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:47,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 410 treesize of output 410 [2023-08-24 03:37:47,053 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 03:37:47,054 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 494 treesize of output 416 [2023-08-24 03:37:47,093 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 03:37:47,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 331 treesize of output 305 [2023-08-24 03:37:48,961 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:37:48,961 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 135 treesize of output 99 [2023-08-24 03:37:48,982 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 03:37:48,982 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1138 treesize of output 1078 [2023-08-24 03:37:49,018 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 03:37:49,018 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 520 treesize of output 424 [2023-08-24 03:37:49,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 03:37:49,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 03:37:49,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 03:37:49,036 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 332 treesize of output 306 [2023-08-24 03:37:49,059 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 03:37:49,059 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 331 treesize of output 287 [2023-08-24 03:37:49,301 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 03:37:49,538 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-24 03:37:49,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803209094] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 03:37:49,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 03:37:49,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 41 [2023-08-24 03:37:49,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731780314] [2023-08-24 03:37:49,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 03:37:49,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-08-24 03:37:49,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:37:49,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-08-24 03:37:49,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=1270, Unknown=11, NotChecked=78, Total=1722 [2023-08-24 03:37:49,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 03:37:49,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 644 transitions, 9554 flow. Second operand has 42 states, 42 states have (on average 63.714285714285715) internal successors, (2676), 42 states have internal predecessors, (2676), 0 states have call successors, (0), 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 03:37:49,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:37:49,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 03:37:49,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:37:51,441 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse15 (+ c_~front~0 1))) (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= c_~n~0 c_~back~0)) (.cse2 (<= (+ c_~back~0 1) c_~front~0)) (.cse3 (< .cse15 0)) (.cse5 (< c_~back~0 0)) (.cse6 (<= c_~n~0 .cse15)) (.cse4 (<= 0 c_~sum~0))) (and (<= c_~sum~0 0) (or .cse0 .cse1 .cse2 .cse3 (and (= c_~back~0 c_~front~0) .cse4 (<= c_~sum~0 1)) .cse5 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6) (<= c_~v_assert~0 1) (or .cse0 .cse1 .cse2 (let ((.cse13 (* c_~front~0 4)) (.cse14 (* c_~back~0 4))) (let ((.cse8 (+ c_~queue~0.offset .cse14 4)) (.cse11 (+ c_~queue~0.offset .cse14)) (.cse9 (+ c_~queue~0.offset .cse13)) (.cse10 (+ c_~queue~0.offset .cse13 4))) (and (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse8) 1) 0)) (<= (+ c_~sum~0 (select .cse7 .cse9) (select .cse7 .cse10)) 1) (not (= (select .cse7 .cse11) 1))))) (forall ((v_ArrVal_464 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_464) c_~queue~0.base))) (or (not (= (+ (select .cse12 .cse8) 1) 0)) (not (= (select .cse12 .cse11) 1)) (<= 0 (+ c_~sum~0 (select .cse12 .cse9) (select .cse12 .cse10))))))))) .cse3 .cse5 .cse6) (<= 1 c_~v_assert~0) .cse4 (= c_~v_assert~0 |c_thread2Thread1of1ForFork0_~cond~1#1|)))) is different from false [2023-08-24 03:38:00,168 INFO L124 PetriNetUnfolderBase]: 7752/13122 cut-off events. [2023-08-24 03:38:00,169 INFO L125 PetriNetUnfolderBase]: For 440241/440241 co-relation queries the response was YES. [2023-08-24 03:38:00,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102521 conditions, 13122 events. 7752/13122 cut-off events. For 440241/440241 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 91098 event pairs, 739 based on Foata normal form. 312/13434 useless extension candidates. Maximal degree in co-relation 102435. Up to 3398 conditions per place. [2023-08-24 03:38:00,321 INFO L140 encePairwiseOnDemand]: 234/248 looper letters, 770 selfloop transitions, 585 changer transitions 441/1796 dead transitions. [2023-08-24 03:38:00,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1796 transitions, 28619 flow [2023-08-24 03:38:00,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-08-24 03:38:00,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2023-08-24 03:38:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 5483 transitions. [2023-08-24 03:38:00,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2763608870967742 [2023-08-24 03:38:00,330 INFO L72 ComplementDD]: Start complementDD. Operand 80 states and 5483 transitions. [2023-08-24 03:38:00,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 5483 transitions. [2023-08-24 03:38:00,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:38:00,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 80 states and 5483 transitions. [2023-08-24 03:38:00,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 81 states, 80 states have (on average 68.5375) internal successors, (5483), 80 states have internal predecessors, (5483), 0 states have call successors, (0), 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 03:38:00,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 81 states, 81 states have (on average 248.0) internal successors, (20088), 81 states have internal predecessors, (20088), 0 states have call successors, (0), 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 03:38:00,356 INFO L81 ComplementDD]: Finished complementDD. Result has 81 states, 81 states have (on average 248.0) internal successors, (20088), 81 states have internal predecessors, (20088), 0 states have call successors, (0), 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 03:38:00,357 INFO L175 Difference]: Start difference. First operand has 266 places, 644 transitions, 9554 flow. Second operand 80 states and 5483 transitions. [2023-08-24 03:38:00,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1796 transitions, 28619 flow [2023-08-24 03:38:03,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 1796 transitions, 24014 flow, removed 2122 selfloop flow, removed 27 redundant places. [2023-08-24 03:38:03,388 INFO L231 Difference]: Finished difference. Result has 344 places, 914 transitions, 14072 flow [2023-08-24 03:38:03,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=7448, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=80, PETRI_FLOW=14072, PETRI_PLACES=344, PETRI_TRANSITIONS=914} [2023-08-24 03:38:03,389 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 313 predicate places. [2023-08-24 03:38:03,389 INFO L495 AbstractCegarLoop]: Abstraction has has 344 places, 914 transitions, 14072 flow [2023-08-24 03:38:03,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 63.714285714285715) internal successors, (2676), 42 states have internal predecessors, (2676), 0 states have call successors, (0), 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 03:38:03,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:38:03,390 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:38:03,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-24 03:38:03,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:38:03,595 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:38:03,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:38:03,595 INFO L85 PathProgramCache]: Analyzing trace with hash 310873246, now seen corresponding path program 9 times [2023-08-24 03:38:03,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:38:03,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732558718] [2023-08-24 03:38:03,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:38:03,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:38:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:38:05,213 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:38:05,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:38:05,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732558718] [2023-08-24 03:38:05,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732558718] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:38:05,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118532769] [2023-08-24 03:38:05,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 03:38:05,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:38:05,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:38:05,215 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 03:38:05,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-24 03:38:05,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-24 03:38:05,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 03:38:05,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-24 03:38:05,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:38:06,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 03:38:06,062 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 32 treesize of output 32 [2023-08-24 03:38:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:38:06,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:38:06,345 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_513 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< c_~front~0 0)) is different from false [2023-08-24 03:38:06,442 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_513 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< c_~front~0 0) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1)))))) is different from false [2023-08-24 03:38:06,477 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_513 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse0)) 1)))) (< c_~front~0 0) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1)))))) is different from false [2023-08-24 03:38:06,530 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base)) (.cse7 (+ c_~front~0 1))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (<= c_~back~0 c_~front~0)) (.cse1 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse2 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse0 .cse1 (not (= .cse2 1))) (or .cse0 (not .cse1) (not (= (+ .cse2 1) 0))))) (let ((.cse6 (* c_~front~0 4))) (let ((.cse4 (select .cse3 (+ c_~queue~0.offset .cse6))) (.cse5 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_513 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse5)) 1))))) (< .cse7 0) (<= c_~n~0 .cse7))) is different from false [2023-08-24 03:38:06,686 INFO L322 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2023-08-24 03:38:06,687 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 292 treesize of output 222 [2023-08-24 03:38:06,699 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 59 treesize of output 52 [2023-08-24 03:38:06,709 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 52 treesize of output 45 [2023-08-24 03:38:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-24 03:38:07,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118532769] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 03:38:07,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 03:38:07,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 37 [2023-08-24 03:38:07,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077536729] [2023-08-24 03:38:07,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 03:38:07,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-24 03:38:07,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:38:07,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-24 03:38:07,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=965, Unknown=4, NotChecked=268, Total=1406 [2023-08-24 03:38:07,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 03:38:07,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 914 transitions, 14072 flow. Second operand has 38 states, 38 states have (on average 63.86842105263158) internal successors, (2427), 38 states have internal predecessors, (2427), 0 states have call successors, (0), 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 03:38:07,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:38:07,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 03:38:07,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:38:08,791 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base)) (.cse7 (+ c_~front~0 1))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (<= c_~back~0 c_~front~0)) (.cse1 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse2 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse0 .cse1 (not (= .cse2 1))) (or .cse0 (not .cse1) (not (= (+ .cse2 1) 0))))) (let ((.cse6 (* c_~front~0 4))) (let ((.cse4 (select .cse3 (+ c_~queue~0.offset .cse6))) (.cse5 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_513 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse5)) 1))))) (< .cse7 0) (<= c_~n~0 .cse7))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-08-24 03:38:09,780 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_513 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse0)) 1)))) (< c_~front~0 0) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1)))))) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1)) is different from false [2023-08-24 03:38:10,606 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_513 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< c_~front~0 0) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1))))))) is different from false [2023-08-24 03:38:13,472 WARN L839 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_513 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_513 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_513) c_~queue~0.base) .cse0)) 1)))) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (< c_~front~0 0)) (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256))) is different from false [2023-08-24 03:39:20,561 INFO L124 PetriNetUnfolderBase]: 25681/43736 cut-off events. [2023-08-24 03:39:20,561 INFO L125 PetriNetUnfolderBase]: For 1473982/1473982 co-relation queries the response was YES. [2023-08-24 03:39:21,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 347950 conditions, 43736 events. 25681/43736 cut-off events. For 1473982/1473982 co-relation queries the response was YES. Maximal size of possible extension queue 1374. Compared 355295 event pairs, 953 based on Foata normal form. 2023/45759 useless extension candidates. Maximal degree in co-relation 347846. Up to 10597 conditions per place. [2023-08-24 03:39:21,929 INFO L140 encePairwiseOnDemand]: 231/248 looper letters, 1360 selfloop transitions, 3070 changer transitions 2530/6960 dead transitions. [2023-08-24 03:39:21,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 6960 transitions, 116297 flow [2023-08-24 03:39:21,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2023-08-24 03:39:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2023-08-24 03:39:21,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 16195 transitions. [2023-08-24 03:39:21,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27788263555250514 [2023-08-24 03:39:21,952 INFO L72 ComplementDD]: Start complementDD. Operand 235 states and 16195 transitions. [2023-08-24 03:39:21,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 16195 transitions. [2023-08-24 03:39:21,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:39:21,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 235 states and 16195 transitions. [2023-08-24 03:39:21,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 236 states, 235 states have (on average 68.91489361702128) internal successors, (16195), 235 states have internal predecessors, (16195), 0 states have call successors, (0), 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 03:39:22,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 236 states, 236 states have (on average 248.0) internal successors, (58528), 236 states have internal predecessors, (58528), 0 states have call successors, (0), 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 03:39:22,040 INFO L81 ComplementDD]: Finished complementDD. Result has 236 states, 236 states have (on average 248.0) internal successors, (58528), 236 states have internal predecessors, (58528), 0 states have call successors, (0), 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 03:39:22,040 INFO L175 Difference]: Start difference. First operand has 344 places, 914 transitions, 14072 flow. Second operand 235 states and 16195 transitions. [2023-08-24 03:39:22,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 6960 transitions, 116297 flow [2023-08-24 03:39:40,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 6960 transitions, 108224 flow, removed 3988 selfloop flow, removed 21 redundant places. [2023-08-24 03:39:40,337 INFO L231 Difference]: Finished difference. Result has 691 places, 3580 transitions, 64348 flow [2023-08-24 03:39:40,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=12379, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=878, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=590, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=235, PETRI_FLOW=64348, PETRI_PLACES=691, PETRI_TRANSITIONS=3580} [2023-08-24 03:39:40,338 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 660 predicate places. [2023-08-24 03:39:40,338 INFO L495 AbstractCegarLoop]: Abstraction has has 691 places, 3580 transitions, 64348 flow [2023-08-24 03:39:40,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 63.86842105263158) internal successors, (2427), 38 states have internal predecessors, (2427), 0 states have call successors, (0), 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 03:39:40,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:39:40,339 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:39:40,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-24 03:39:40,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-24 03:39:40,540 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:39:40,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:39:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash 531252996, now seen corresponding path program 10 times [2023-08-24 03:39:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:39:40,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925735867] [2023-08-24 03:39:40,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:39:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:39:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:39:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:39:42,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:39:42,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925735867] [2023-08-24 03:39:42,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925735867] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:39:42,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787452505] [2023-08-24 03:39:42,019 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 03:39:42,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:39:42,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:39:42,020 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 03:39:42,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-24 03:39:42,135 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 03:39:42,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 03:39:42,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-24 03:39:42,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:39:42,271 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 03:39:42,339 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 03:39:42,442 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 03:39:42,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 03:39:42,617 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 18 treesize of output 20 [2023-08-24 03:39:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:39:42,905 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:39:43,424 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (+ c_~front~0 1))) (or (let ((.cse10 (* c_~front~0 4)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (let ((.cse6 (not .cse5)) (.cse4 (<= c_~back~0 c_~front~0)) (.cse3 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset .cse10 4)) (.cse2 (+ c_~queue~0.offset .cse10))) (and (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) (not (= (select .cse0 .cse3) 1))))) .cse4 .cse5) (or .cse4 .cse6 (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse3) 1) 0)) (<= (+ c_~sum~0 (select .cse7 .cse1) (select .cse7 .cse2)) 1))))) (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse8 .cse1) (select .cse8 .cse2))) (not (= (+ (select .cse8 .cse3) 1) 0))))) .cse4 .cse6) (or .cse4 .cse5 (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (select .cse9 .cse3) 1)) (<= (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2)) 1)))))))) (< .cse11 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= c_~n~0 .cse11))) is different from false [2023-08-24 03:39:43,693 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (+ c_~front~0 1))) (or (let ((.cse11 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse1 (+ c_~queue~0.offset .cse10 4)) (.cse2 (+ c_~queue~0.offset .cse11 4)) (.cse3 (+ c_~queue~0.offset .cse11)) (.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse7 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse10)))) (and (or (and (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)) 1)))) .cse4) (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3))) (not (= (select .cse5 .cse1) 1))))) .cse4)) (not .cse6) (not (= (+ .cse7 1) 0))) (or .cse6 (and (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse8 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse8 .cse2) (select .cse8 .cse3)))))) .cse4) (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse9 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse9 .cse2) (select .cse9 .cse3)) 1)))) .cse4)) (not (= .cse7 1)))))) (<= c_~n~0 c_~back~0) (< .cse12 0) (< c_~back~0 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= c_~n~0 .cse12))) is different from false [2023-08-24 03:39:44,123 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (+ c_~front~0 1))) (or (let ((.cse9 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse6 (<= (+ c_~back~0 1) c_~front~0)) (.cse1 (+ c_~queue~0.offset .cse10 4)) (.cse5 (+ c_~queue~0.offset .cse10)) (.cse2 (+ c_~queue~0.offset .cse9)) (.cse3 (+ c_~queue~0.offset .cse9 4))) (and (or (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_565))) (let ((.cse0 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3))) (not (= (select (select .cse4 c_~queue~0.base) .cse5) 1)))))) .cse6) (or .cse6 (forall ((v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_565))) (let ((.cse7 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse1) 1) 0)) (not (= (select (select .cse8 c_~queue~0.base) .cse5) 1)) (<= (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)) 1))))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< .cse11 0) (< c_~back~0 0) (<= c_~n~0 .cse11))) is different from false [2023-08-24 03:39:44,368 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:39:44,369 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 132 treesize of output 96 [2023-08-24 03:39:44,408 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 03:39:44,408 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 896 treesize of output 862 [2023-08-24 03:39:44,453 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 03:39:44,454 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 440 treesize of output 414 [2023-08-24 03:39:44,468 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 03:39:44,475 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:39:44,476 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 336 treesize of output 264 [2023-08-24 03:39:44,519 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 03:39:44,519 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 249 [2023-08-24 03:39:46,368 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:39:46,368 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 132 treesize of output 96 [2023-08-24 03:39:46,375 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 03:39:46,402 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 03:39:46,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 562 treesize of output 502 [2023-08-24 03:39:46,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 03:39:46,422 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 03:39:46,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 03:39:46,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 154 [2023-08-24 03:39:46,451 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 03:39:46,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 135 [2023-08-24 03:39:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-24 03:39:46,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787452505] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 03:39:46,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 03:39:46,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 41 [2023-08-24 03:39:46,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118563300] [2023-08-24 03:39:46,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 03:39:46,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-08-24 03:39:46,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:39:46,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-08-24 03:39:46,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1232, Unknown=10, NotChecked=228, Total=1722 [2023-08-24 03:39:46,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 248 [2023-08-24 03:39:46,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 3580 transitions, 64348 flow. Second operand has 42 states, 42 states have (on average 63.73809523809524) internal successors, (2677), 42 states have internal predecessors, (2677), 0 states have call successors, (0), 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 03:39:46,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:39:46,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 248 [2023-08-24 03:39:46,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:39:47,891 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ c_~front~0 1))) (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< .cse0 0) (< c_~back~0 0) (let ((.cse11 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse3 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (<= (+ c_~back~0 1) c_~front~0))) (and (or .cse1 (forall ((v_ArrVal_564 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_565))) (let ((.cse2 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse2 .cse3) 1) 0)) (not (= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) 1)) (<= 0 (+ c_~sum~0 (select .cse2 .cse6) (select .cse2 .cse7)))))))) (or (forall ((v_ArrVal_564 (Array Int Int)) (v_ArrVal_566 (Array Int Int)) (v_ArrVal_565 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_564) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_565))) (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse8 .cse3) 1) 0)) (<= (+ c_~sum~0 (select .cse8 .cse6) (select .cse8 .cse7)) 1) (not (= (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse5) 1)))))) .cse1)))) (<= c_~n~0 .cse0))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (= c_~sum~0 0)) is different from false [2023-08-24 03:39:49,369 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse11 (+ c_~front~0 1))) (or (let ((.cse10 (* c_~front~0 4)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (let ((.cse6 (not .cse5)) (.cse4 (<= c_~back~0 c_~front~0)) (.cse3 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset .cse10 4)) (.cse2 (+ c_~queue~0.offset .cse10))) (and (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) (not (= (select .cse0 .cse3) 1))))) .cse4 .cse5) (or .cse4 .cse6 (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse3) 1) 0)) (<= (+ c_~sum~0 (select .cse7 .cse1) (select .cse7 .cse2)) 1))))) (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse8 .cse1) (select .cse8 .cse2))) (not (= (+ (select .cse8 .cse3) 1) 0))))) .cse4 .cse6) (or .cse4 .cse5 (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (select .cse9 .cse3) 1)) (<= (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2)) 1)))))))) (< .cse11 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= c_~n~0 .cse11))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (= c_~sum~0 0) (= c_~v_assert~0 |c_thread2Thread1of1ForFork0_~cond~1#1|)) is different from false [2023-08-24 03:39:49,741 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse11 (+ c_~front~0 1))) (or (let ((.cse10 (* c_~front~0 4)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (let ((.cse6 (not .cse5)) (.cse4 (<= c_~back~0 c_~front~0)) (.cse3 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset .cse10 4)) (.cse2 (+ c_~queue~0.offset .cse10))) (and (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) (not (= (select .cse0 .cse3) 1))))) .cse4 .cse5) (or .cse4 .cse6 (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse3) 1) 0)) (<= (+ c_~sum~0 (select .cse7 .cse1) (select .cse7 .cse2)) 1))))) (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse8 .cse1) (select .cse8 .cse2))) (not (= (+ (select .cse8 .cse3) 1) 0))))) .cse4 .cse6) (or .cse4 .cse5 (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (select .cse9 .cse3) 1)) (<= (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2)) 1)))))))) (< .cse11 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= c_~n~0 .cse11))) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (= c_~v_assert~0 |c_thread2Thread1of1ForFork0_~cond~1#1|)) is different from false [2023-08-24 03:40:04,617 WARN L234 SmtUtils]: Spent 14.31s on a formula simplification. DAG size of input: 130 DAG size of output: 89 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 03:40:04,803 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse18 (* c_~front~0 4)) (.cse19 (* c_~back~0 4))) (let ((.cse7 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse19))) (.cse1 (+ c_~queue~0.offset .cse19 4)) (.cse2 (+ c_~queue~0.offset .cse18 4)) (.cse3 (+ c_~queue~0.offset .cse18)) (.cse4 (<= (+ c_~back~0 1) c_~front~0)) (.cse15 (+ c_~front~0 1))) (let ((.cse10 (<= c_~n~0 c_~back~0)) (.cse11 (< .cse15 0)) (.cse12 (< c_~back~0 0)) (.cse8 (and (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse16 .cse1) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse16 .cse2) (select .cse16 .cse3)))))) .cse4) (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse17 .cse1) 1) 0)) (<= (+ c_~sum~0 (select .cse17 .cse2) (select .cse17 .cse3)) 1)))) .cse4))) (.cse13 (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0)) (.cse9 (not (= .cse7 1))) (.cse14 (<= c_~n~0 .cse15))) (and (or (let ((.cse6 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (and (or (and (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)) 1)))) .cse4) (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3))) (not (= (select .cse5 .cse1) 1))))) .cse4)) (not .cse6) (not (= (+ .cse7 1) 0))) (or .cse6 .cse8 .cse9))) .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse10 .cse11 .cse12 .cse8 .cse13 .cse9 .cse14))))) is different from false [2023-08-24 03:40:05,474 WARN L839 $PredicateComparison]: unable to prove that (and (let ((.cse11 (+ c_~front~0 1))) (or (let ((.cse10 (* c_~front~0 4)) (.cse5 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0))) (let ((.cse6 (not .cse5)) (.cse4 (<= c_~back~0 c_~front~0)) (.cse3 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset .cse10 4)) (.cse2 (+ c_~queue~0.offset .cse10))) (and (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) (not (= (select .cse0 .cse3) 1))))) .cse4 .cse5) (or .cse4 .cse6 (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse3) 1) 0)) (<= (+ c_~sum~0 (select .cse7 .cse1) (select .cse7 .cse2)) 1))))) (or (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse8 .cse1) (select .cse8 .cse2))) (not (= (+ (select .cse8 .cse3) 1) 0))))) .cse4 .cse6) (or .cse4 .cse5 (forall ((v_ArrVal_566 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_566) c_~queue~0.base))) (or (not (= (select .cse9 .cse3) 1)) (<= (+ c_~sum~0 (select .cse9 .cse1) (select .cse9 .cse2)) 1)))))))) (< .cse11 0) (= (mod |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= c_~n~0 .cse11))) (< 0 (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256))) is different from false [2023-08-24 03:40:20,008 WARN L234 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 127 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 03:41:16,752 INFO L124 PetriNetUnfolderBase]: 32241/55249 cut-off events. [2023-08-24 03:41:16,752 INFO L125 PetriNetUnfolderBase]: For 27151689/27151689 co-relation queries the response was YES. [2023-08-24 03:41:19,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246953 conditions, 55249 events. 32241/55249 cut-off events. For 27151689/27151689 co-relation queries the response was YES. Maximal size of possible extension queue 1716. Compared 466227 event pairs, 2845 based on Foata normal form. 2293/57542 useless extension candidates. Maximal degree in co-relation 1246718. Up to 15332 conditions per place. [2023-08-24 03:41:19,590 INFO L140 encePairwiseOnDemand]: 233/248 looper letters, 2648 selfloop transitions, 2606 changer transitions 4092/9346 dead transitions. [2023-08-24 03:41:19,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 773 places, 9346 transitions, 208498 flow [2023-08-24 03:41:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2023-08-24 03:41:19,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2023-08-24 03:41:19,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 7281 transitions. [2023-08-24 03:41:19,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2743819716611396 [2023-08-24 03:41:19,600 INFO L72 ComplementDD]: Start complementDD. Operand 107 states and 7281 transitions. [2023-08-24 03:41:19,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 7281 transitions. [2023-08-24 03:41:19,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:41:19,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 107 states and 7281 transitions. [2023-08-24 03:41:19,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 108 states, 107 states have (on average 68.04672897196262) internal successors, (7281), 107 states have internal predecessors, (7281), 0 states have call successors, (0), 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 03:41:19,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 108 states, 108 states have (on average 248.0) internal successors, (26784), 108 states have internal predecessors, (26784), 0 states have call successors, (0), 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 03:41:19,633 INFO L81 ComplementDD]: Finished complementDD. Result has 108 states, 108 states have (on average 248.0) internal successors, (26784), 108 states have internal predecessors, (26784), 0 states have call successors, (0), 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 03:41:19,633 INFO L175 Difference]: Start difference. First operand has 691 places, 3580 transitions, 64348 flow. Second operand 107 states and 7281 transitions. [2023-08-24 03:41:19,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 773 places, 9346 transitions, 208498 flow [2023-08-24 03:46:11,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 9346 transitions, 181829 flow, removed 12617 selfloop flow, removed 54 redundant places. [2023-08-24 03:46:11,837 INFO L231 Difference]: Finished difference. Result has 780 places, 4390 transitions, 79835 flow [2023-08-24 03:46:11,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=53637, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1830, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=107, PETRI_FLOW=79835, PETRI_PLACES=780, PETRI_TRANSITIONS=4390} [2023-08-24 03:46:11,841 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 749 predicate places. [2023-08-24 03:46:11,841 INFO L495 AbstractCegarLoop]: Abstraction has has 780 places, 4390 transitions, 79835 flow [2023-08-24 03:46:11,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 63.73809523809524) internal successors, (2677), 42 states have internal predecessors, (2677), 0 states have call successors, (0), 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 03:46:11,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 03:46:11,842 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 03:46:11,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-24 03:46:12,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-24 03:46:12,049 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 03:46:12,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 03:46:12,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1663425846, now seen corresponding path program 11 times [2023-08-24 03:46:12,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 03:46:12,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752149947] [2023-08-24 03:46:12,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 03:46:12,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 03:46:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 03:46:13,091 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:46:13,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 03:46:13,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752149947] [2023-08-24 03:46:13,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752149947] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 03:46:13,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653016786] [2023-08-24 03:46:13,092 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 03:46:13,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 03:46:13,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 03:46:13,093 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 03:46:13,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-24 03:46:13,205 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-24 03:46:13,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 03:46:13,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 64 conjunts are in the unsatisfiable core [2023-08-24 03:46:13,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 03:46:13,344 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 03:46:13,401 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 03:46:13,463 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 03:46:13,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 03:46:13,732 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 31 treesize of output 31 [2023-08-24 03:46:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 03:46:13,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 03:46:14,024 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse0)) 1)))) (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (< c_~front~0 0)) is different from false [2023-08-24 03:46:14,184 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (<= c_~back~0 c_~front~0)) (.cse1 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse2 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse0 .cse1 (not (= .cse2 1))) (or .cse0 (not .cse1) (not (= (+ .cse2 1) 0))))) (<= c_~n~0 c_~back~0) (let ((.cse6 (* c_~front~0 4))) (let ((.cse4 (select .cse3 (+ c_~queue~0.offset .cse6))) (.cse5 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse5)) 1)) (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse5))))))) (< c_~back~0 0) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2023-08-24 03:46:14,421 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse6 (* c_~back~0 4)) (.cse7 (+ c_~back~0 1))) (let ((.cse1 (<= .cse7 c_~front~0)) (.cse0 (select .cse5 (+ c_~queue~0.offset .cse6 4))) (.cse2 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse3 (<= c_~n~0 .cse7)) (.cse4 (select .cse5 (+ c_~queue~0.offset .cse6)))) (and (or (not (= .cse0 1)) .cse1 (not .cse2) .cse3 (not (= (+ .cse4 1) 0))) (or .cse1 (not (= (+ .cse0 1) 0)) .cse2 .cse3 (not (= .cse4 1)))))) (let ((.cse10 (* c_~front~0 4))) (let ((.cse8 (select .cse5 (+ c_~queue~0.offset .cse10))) (.cse9 (+ c_~queue~0.offset .cse10 4))) (and (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 .cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse9)) 1)) (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse8 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse9))))))) (= (mod |c_thread2Thread1of1ForFork0_~cond~1#1| 256) 0) (< c_~front~0 0))) is different from false [2023-08-24 03:46:14,452 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~back~0 1)) (.cse1 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (* c_~back~0 4))) (or (= (mod c_~v_assert~0 256) 0) (<= .cse0 c_~front~0) (not (= (+ (select .cse1 (+ c_~queue~0.offset .cse2 4)) 1) 0)) (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (select .cse1 (+ c_~queue~0.offset .cse5))) (.cse4 (+ c_~queue~0.offset .cse5 4))) (and (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse4)) 1)) (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse4))))))) (<= c_~n~0 .cse0) (< c_~front~0 0) (not (= (select .cse1 (+ c_~queue~0.offset .cse2)) 1)))) is different from false [2023-08-24 03:46:14,729 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~back~0 1))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse8 (* c_~back~0 4)) (.cse9 (* c_~front~0 4))) (let ((.cse4 (+ .cse9 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse8 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_617 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_617) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (not (= (+ (select .cse0 .cse2) 1) 0)) (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) (select .cse0 .cse5)) 1)))))) (forall ((v_ArrVal_618 (Array Int Int)) (v_ArrVal_617 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_617) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse4) (select .cse7 .cse5)))) (not (= (select .cse7 .cse1) 1)) (not (= (+ (select .cse7 .cse2) 1) 0))))))))) (<= .cse10 c_~front~0) (<= c_~n~0 .cse10) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< c_~front~0 0))) is different from false [2023-08-24 03:46:14,762 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:46:14,762 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 126 treesize of output 90 [2023-08-24 03:46:14,814 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 03:46:14,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7938 treesize of output 7130 [2023-08-24 03:46:14,849 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 203 treesize of output 175 [2023-08-24 03:46:14,862 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 03:46:14,882 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:46:14,883 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 218 treesize of output 212 [2023-08-24 03:46:14,929 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-24 03:46:14,930 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 185 [2023-08-24 03:46:16,496 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 03:46:16,496 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2023-08-24 03:46:16,502 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 03:46:16,523 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 03:46:16,523 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2242 treesize of output 1944 [2023-08-24 03:46:16,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 03:46:16,543 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 03:46:16,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 03:46:16,544 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 154 [2023-08-24 03:46:16,571 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-24 03:46:16,572 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179 treesize of output 135 [2023-08-24 03:46:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-24 03:46:16,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653016786] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 03:46:16,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 03:46:16,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 39 [2023-08-24 03:46:16,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619070034] [2023-08-24 03:46:16,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 03:46:16,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-24 03:46:16,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 03:46:16,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-24 03:46:16,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=951, Unknown=17, NotChecked=350, Total=1560 [2023-08-24 03:46:16,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 248 [2023-08-24 03:46:16,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 780 places, 4390 transitions, 79835 flow. Second operand has 40 states, 40 states have (on average 65.775) internal successors, (2631), 40 states have internal predecessors, (2631), 0 states have call successors, (0), 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 03:46:16,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 03:46:16,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 248 [2023-08-24 03:46:16,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 03:46:17,898 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (= c_~sum~0 0) (let ((.cse0 (+ c_~back~0 1))) (or (= (mod c_~v_assert~0 256) 0) (<= .cse0 c_~front~0) (let ((.cse10 (* c_~front~0 4)) (.cse9 (* c_~back~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse9 4)) (.cse2 (+ c_~queue~0.offset .cse10)) (.cse4 (+ c_~queue~0.offset .cse10 4)) (.cse6 (+ c_~queue~0.offset .cse9))) (and (forall ((v_ArrVal_618 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618))) (let ((.cse1 (select .cse3 c_~queue~0.base))) (or (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 (select .cse1 .cse2) (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse4)) 1)) (not (= (+ (select .cse1 .cse5) 1) 0)) (not (= (select .cse1 .cse6) 1)))))) (forall ((v_ArrVal_618 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618))) (let ((.cse7 (select .cse8 c_~queue~0.base))) (or (not (= (+ (select .cse7 .cse5) 1) 0)) (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 (select .cse7 .cse2) (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse4)))) (not (= (select .cse7 .cse6) 1))))))))) (<= c_~n~0 .cse0) (< c_~front~0 0)))) is different from false [2023-08-24 03:46:18,501 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse0 (<= c_~back~0 c_~front~0)) (.cse1 (= (mod |c_thread2Thread1of1ForFork0_~b~0#1| 256) 0)) (.cse2 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse0 .cse1 (not (= .cse2 1))) (or .cse0 (not .cse1) (not (= (+ .cse2 1) 0))))) (<= c_~n~0 c_~back~0) (let ((.cse6 (* c_~front~0 4))) (let ((.cse4 (select .cse3 (+ c_~queue~0.offset .cse6))) (.cse5 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse5)) 1)) (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse5))))))) (< c_~front~0 0))) (<= 1 c_~v_assert~0) (= c_~sum~0 0) (= c_~v_assert~0 |c_thread2Thread1of1ForFork0_~cond~1#1|)) is different from false [2023-08-24 03:46:19,399 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~back~0 .cse0) (let ((.cse3 (* c_~front~0 4))) (let ((.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3))) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse2))))))) (< c_~front~0 0) (<= c_~n~0 .cse0))) (= c_~v_assert~0 |c_thread2Thread1of1ForFork0_~cond~1#1|)) is different from false [2023-08-24 03:46:20,453 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~back~0 .cse0) (let ((.cse3 (* c_~front~0 4))) (let ((.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse3))) (.cse2 (+ c_~queue~0.offset .cse3 4))) (and (forall ((v_ArrVal_619 (Array Int Int))) (<= (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse2)) 1)) (forall ((v_ArrVal_619 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_619) c_~queue~0.base) .cse2))))))) (< c_~front~0 0) (<= c_~n~0 .cse0))) (= c_~v_assert~0 |c_thread2Thread1of1ForFork0_~cond~1#1|)) is different from false [2023-08-24 03:47:27,777 INFO L124 PetriNetUnfolderBase]: 31822/53827 cut-off events. [2023-08-24 03:47:27,778 INFO L125 PetriNetUnfolderBase]: For 22303379/22303379 co-relation queries the response was YES. [2023-08-24 03:47:31,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1170471 conditions, 53827 events. 31822/53827 cut-off events. For 22303379/22303379 co-relation queries the response was YES. Maximal size of possible extension queue 1512. Compared 445100 event pairs, 4207 based on Foata normal form. 1102/54929 useless extension candidates. Maximal degree in co-relation 1170219. Up to 20101 conditions per place. [2023-08-24 03:47:31,733 INFO L140 encePairwiseOnDemand]: 232/248 looper letters, 3432 selfloop transitions, 2039 changer transitions 1667/7138 dead transitions. [2023-08-24 03:47:31,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 800 places, 7138 transitions, 148698 flow [2023-08-24 03:47:31,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-08-24 03:47:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2023-08-24 03:47:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 4284 transitions. [2023-08-24 03:47:31,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28318350079323107 [2023-08-24 03:47:31,741 INFO L72 ComplementDD]: Start complementDD. Operand 61 states and 4284 transitions. [2023-08-24 03:47:31,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 4284 transitions. [2023-08-24 03:47:31,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 03:47:31,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 4284 transitions. [2023-08-24 03:47:31,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 62 states, 61 states have (on average 70.22950819672131) internal successors, (4284), 61 states have internal predecessors, (4284), 0 states have call successors, (0), 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 03:47:31,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 62 states, 62 states have (on average 248.0) internal successors, (15376), 62 states have internal predecessors, (15376), 0 states have call successors, (0), 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 03:47:31,765 INFO L81 ComplementDD]: Finished complementDD. Result has 62 states, 62 states have (on average 248.0) internal successors, (15376), 62 states have internal predecessors, (15376), 0 states have call successors, (0), 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 03:47:31,766 INFO L175 Difference]: Start difference. First operand has 780 places, 4390 transitions, 79835 flow. Second operand 61 states and 4284 transitions. [2023-08-24 03:47:31,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 800 places, 7138 transitions, 148698 flow Received shutdown request... [2023-08-24 03:50:18,869 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 03:50:18,869 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 03:50:19,025 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 03:50:19,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-24 03:50:19,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-24 03:50:19,226 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2023-08-24 03:50:19,227 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-24 03:50:19,227 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-24 03:50:19,227 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-24 03:50:19,228 INFO L445 BasicCegarLoop]: Path program histogram: [11, 3, 1, 1] [2023-08-24 03:50:19,230 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 03:50:19,230 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 03:50:19,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 03:50:19 BasicIcfg [2023-08-24 03:50:19,233 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 03:50:19,233 INFO L158 Benchmark]: Toolchain (without parser) took 807543.49ms. Allocated memory was 371.2MB in the beginning and 12.2GB in the end (delta: 11.9GB). Free memory was 347.5MB in the beginning and 6.4GB in the end (delta: -6.1GB). Peak memory consumption was 11.8GB. Max. memory is 16.0GB. [2023-08-24 03:50:19,233 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 371.2MB. Free memory was 347.5MB in the beginning and 347.4MB in the end (delta: 146.2kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 03:50:19,234 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.47ms. Allocated memory is still 371.2MB. Free memory was 347.5MB in the beginning and 335.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 03:50:19,234 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.35ms. Allocated memory is still 371.2MB. Free memory was 335.8MB in the beginning and 333.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 03:50:19,234 INFO L158 Benchmark]: Boogie Preprocessor took 47.71ms. Allocated memory is still 371.2MB. Free memory was 333.8MB in the beginning and 332.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 03:50:19,234 INFO L158 Benchmark]: RCFGBuilder took 566.80ms. Allocated memory is still 371.2MB. Free memory was 332.0MB in the beginning and 309.7MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-24 03:50:19,237 INFO L158 Benchmark]: TraceAbstraction took 806576.88ms. Allocated memory was 371.2MB in the beginning and 12.2GB in the end (delta: 11.9GB). Free memory was 309.0MB in the beginning and 6.4GB in the end (delta: -6.1GB). Peak memory consumption was 11.8GB. Max. memory is 16.0GB. [2023-08-24 03:50:19,244 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 371.2MB. Free memory was 347.5MB in the beginning and 347.4MB in the end (delta: 146.2kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 289.47ms. Allocated memory is still 371.2MB. Free memory was 347.5MB in the beginning and 335.8MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.35ms. Allocated memory is still 371.2MB. Free memory was 335.8MB in the beginning and 333.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.71ms. Allocated memory is still 371.2MB. Free memory was 333.8MB in the beginning and 332.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 566.80ms. Allocated memory is still 371.2MB. Free memory was 332.0MB in the beginning and 309.7MB in the end (delta: 22.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 806576.88ms. Allocated memory was 371.2MB in the beginning and 12.2GB in the end (delta: 11.9GB). Free memory was 309.0MB in the beginning and 6.4GB in the end (delta: -6.1GB). Peak memory consumption was 11.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 123 PlacesBefore, 31 PlacesAfterwards, 123 TransitionsBefore, 24 TransitionsAfterwards, 1262 CoEnabledTransitionPairs, 7 FixpointIterations, 62 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 7 ConcurrentYvCompositions, 7 ChoiceCompositions, 112 TotalNumberOfCompositions, 2063 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1580, independent: 1522, independent conditional: 0, independent unconditional: 1522, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 701, independent: 679, independent conditional: 0, independent unconditional: 679, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1580, independent: 843, independent conditional: 0, independent unconditional: 843, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 701, unknown conditional: 0, unknown unconditional: 701] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 52, Positive conditional cache size: 0, Positive unconditional cache size: 52, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 158 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 806.4s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.0s, AutomataDifference: 765.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 273 mSolverCounterUnknown, 6412 SdHoareTripleChecker+Valid, 15.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6412 mSDsluCounter, 183 SdHoareTripleChecker+Invalid, 13.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 14611 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 970 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15568 IncrementalHoareTripleChecker+Invalid, 31422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 970 mSolverCounterUnsat, 2 mSDtfsCounter, 15568 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1348 GetRequests, 331 SyntacticMatches, 55 SemanticMatches, 962 ConstructedPredicates, 35 IntricatePredicates, 0 DeprecatedPredicates, 47656 ImplicationChecksByTransitivity, 135.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79835occurred in iteration=15, InterpolantAutomatonStates: 724, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 32.5s InterpolantComputationTime, 666 NumberOfCodeBlocks, 666 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 899 ConstructedInterpolants, 45 QuantifiedInterpolants, 20388 SizeOfPredicates, 250 NumberOfNonLiveVariables, 2390 ConjunctsInSsa, 434 ConjunctsInUnsatCore, 36 InterpolantComputations, 6 PerfectInterpolantSequences, 74/242 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown