/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 12:46:19,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 12:46:19,532 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 12:46:19,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 12:46:19,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 12:46:19,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 12:46:19,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 12:46:19,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 12:46:19,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 12:46:19,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 12:46:19,566 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 12:46:19,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 12:46:19,566 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 12:46:19,567 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 12:46:19,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 12:46:19,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 12:46:19,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 12:46:19,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 12:46:19,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 12:46:19,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 12:46:19,568 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 12:46:19,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 12:46:19,569 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 12:46:19,569 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 12:46:19,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 12:46:19,570 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 12:46:19,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 12:46:19,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 12:46:19,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 12:46:19,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 12:46:19,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 12:46:19,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 12:46:19,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 12:46:19,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 12:46:19,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 12:46:19,571 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 12:46:19,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 12:46:19,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 12:46:19,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 12:46:19,845 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 12:46:19,845 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 12:46:19,846 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2023-08-24 12:46:20,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 12:46:21,029 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 12:46:21,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2023-08-24 12:46:21,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/321baae11/181996309fd0447b8e6a144b285ad37b/FLAGce5567fbb [2023-08-24 12:46:21,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/321baae11/181996309fd0447b8e6a144b285ad37b [2023-08-24 12:46:21,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 12:46:21,056 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 12:46:21,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 12:46:21,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 12:46:21,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 12:46:21,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 12:46:21" (1/1) ... [2023-08-24 12:46:21,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29e52a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:46:21, skipping insertion in model container [2023-08-24 12:46:21,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 12:46:21" (1/1) ... [2023-08-24 12:46:21,096 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 12:46:21,394 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2023-08-24 12:46:21,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 12:46:21,431 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 12:46:21,454 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-24 12:46:21,456 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-24 12:46:21,460 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-24 12:46:21,464 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2023-08-24 12:46:21,478 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 12:46:21,529 INFO L206 MainTranslator]: Completed translation [2023-08-24 12:46:21,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:46:21 WrapperNode [2023-08-24 12:46:21,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 12:46:21,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 12:46:21,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 12:46:21,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 12:46:21,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:46:21" (1/1) ... [2023-08-24 12:46:21,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:46:21" (1/1) ... [2023-08-24 12:46:21,584 INFO L138 Inliner]: procedures = 271, calls = 31, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 198 [2023-08-24 12:46:21,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 12:46:21,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 12:46:21,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 12:46:21,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 12:46:21,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:46:21" (1/1) ... [2023-08-24 12:46:21,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:46:21" (1/1) ... [2023-08-24 12:46:21,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:46:21" (1/1) ... [2023-08-24 12:46:21,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:46:21" (1/1) ... [2023-08-24 12:46:21,608 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:46:21" (1/1) ... [2023-08-24 12:46:21,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:46:21" (1/1) ... [2023-08-24 12:46:21,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:46:21" (1/1) ... [2023-08-24 12:46:21,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:46:21" (1/1) ... [2023-08-24 12:46:21,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 12:46:21,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 12:46:21,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 12:46:21,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 12:46:21,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:46:21" (1/1) ... [2023-08-24 12:46:21,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 12:46:21,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:46:21,650 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 12:46:21,656 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 12:46:21,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 12:46:21,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 12:46:21,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 12:46:21,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 12:46:21,674 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-24 12:46:21,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 12:46:21,674 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-24 12:46:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-24 12:46:21,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 12:46:21,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 12:46:21,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 12:46:21,675 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 12:46:21,814 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 12:46:21,815 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 12:46:22,065 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 12:46:22,073 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 12:46:22,073 INFO L302 CfgBuilder]: Removed 25 assume(true) statements. [2023-08-24 12:46:22,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 12:46:22 BoogieIcfgContainer [2023-08-24 12:46:22,075 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 12:46:22,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 12:46:22,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 12:46:22,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 12:46:22,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 12:46:21" (1/3) ... [2023-08-24 12:46:22,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b51b766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 12:46:22, skipping insertion in model container [2023-08-24 12:46:22,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:46:21" (2/3) ... [2023-08-24 12:46:22,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b51b766 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 12:46:22, skipping insertion in model container [2023-08-24 12:46:22,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 12:46:22" (3/3) ... [2023-08-24 12:46:22,100 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2023-08-24 12:46:22,113 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 12:46:22,114 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 12:46:22,114 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 12:46:22,181 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-24 12:46:22,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 195 transitions, 398 flow [2023-08-24 12:46:22,297 INFO L124 PetriNetUnfolderBase]: 49/278 cut-off events. [2023-08-24 12:46:22,297 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-24 12:46:22,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 278 events. 49/278 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 982 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2023-08-24 12:46:22,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 195 transitions, 398 flow [2023-08-24 12:46:22,307 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 190 transitions, 385 flow [2023-08-24 12:46:22,309 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 12:46:22,314 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 190 transitions, 385 flow [2023-08-24 12:46:22,316 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 190 transitions, 385 flow [2023-08-24 12:46:22,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 190 transitions, 385 flow [2023-08-24 12:46:22,341 INFO L124 PetriNetUnfolderBase]: 48/273 cut-off events. [2023-08-24 12:46:22,342 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:46:22,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 273 events. 48/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 933 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2023-08-24 12:46:22,347 INFO L119 LiptonReduction]: Number of co-enabled transitions 12282 [2023-08-24 12:46:24,464 INFO L134 LiptonReduction]: Checked pairs total: 18484 [2023-08-24 12:46:24,464 INFO L136 LiptonReduction]: Total number of compositions: 153 [2023-08-24 12:46:24,472 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 12:46:24,476 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;@32742db7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 12:46:24,477 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-24 12:46:24,481 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 12:46:24,481 INFO L124 PetriNetUnfolderBase]: 11/39 cut-off events. [2023-08-24 12:46:24,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:46:24,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:46:24,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:46:24,482 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 12:46:24,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:46:24,485 INFO L85 PathProgramCache]: Analyzing trace with hash 900055316, now seen corresponding path program 1 times [2023-08-24 12:46:24,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:46:24,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291678695] [2023-08-24 12:46:24,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:46:24,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:46:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:46:24,623 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 12:46:24,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:46:24,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291678695] [2023-08-24 12:46:24,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291678695] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:46:24,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:46:24,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 12:46:24,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432945622] [2023-08-24 12:46:24,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:46:24,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:46:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:46:24,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:46:24,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 12:46:24,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 348 [2023-08-24 12:46:24,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 70 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states 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 12:46:24,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:46:24,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 348 [2023-08-24 12:46:24,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:46:24,780 INFO L124 PetriNetUnfolderBase]: 380/772 cut-off events. [2023-08-24 12:46:24,780 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:46:24,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 772 events. 380/772 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3504 event pairs, 306 based on Foata normal form. 76/711 useless extension candidates. Maximal degree in co-relation 1428. Up to 707 conditions per place. [2023-08-24 12:46:24,785 INFO L140 encePairwiseOnDemand]: 322/348 looper letters, 40 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-08-24 12:46:24,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 185 flow [2023-08-24 12:46:24,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:46:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:46:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2023-08-24 12:46:24,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5114942528735632 [2023-08-24 12:46:24,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2023-08-24 12:46:24,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2023-08-24 12:46:24,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:46:24,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2023-08-24 12:46:24,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states 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 12:46:24,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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 12:46:24,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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 12:46:24,813 INFO L175 Difference]: Start difference. First operand has 46 places, 70 transitions, 145 flow. Second operand 3 states and 534 transitions. [2023-08-24 12:46:24,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 185 flow [2023-08-24 12:46:24,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 48 transitions, 185 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:46:24,817 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 111 flow [2023-08-24 12:46:24,818 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2023-08-24 12:46:24,822 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2023-08-24 12:46:24,822 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 111 flow [2023-08-24 12:46:24,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states 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 12:46:24,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:46:24,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:46:24,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 12:46:24,823 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 12:46:24,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:46:24,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1371837772, now seen corresponding path program 1 times [2023-08-24 12:46:24,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:46:24,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345841761] [2023-08-24 12:46:24,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:46:24,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:46:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:46:24,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:46:24,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:46:24,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345841761] [2023-08-24 12:46:24,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345841761] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:46:24,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87616329] [2023-08-24 12:46:24,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:46:24,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:46:24,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:46:24,884 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 12:46:24,912 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 12:46:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:46:24,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-24 12:46:24,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:46:24,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 12:46:24,982 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:46:24,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87616329] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:46:24,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:46:24,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-24 12:46:24,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392190647] [2023-08-24 12:46:24,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:46:24,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:46:24,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:46:24,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:46:24,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 12:46:24,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 348 [2023-08-24 12:46:24,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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 12:46:24,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:46:24,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 348 [2023-08-24 12:46:24,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:46:25,075 INFO L124 PetriNetUnfolderBase]: 363/764 cut-off events. [2023-08-24 12:46:25,076 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:46:25,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 764 events. 363/764 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3873 event pairs, 0 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 1472. Up to 670 conditions per place. [2023-08-24 12:46:25,078 INFO L140 encePairwiseOnDemand]: 345/348 looper letters, 59 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-24 12:46:25,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 271 flow [2023-08-24 12:46:25,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:46:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:46:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2023-08-24 12:46:25,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067049808429118 [2023-08-24 12:46:25,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 529 transitions. [2023-08-24 12:46:25,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 529 transitions. [2023-08-24 12:46:25,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:46:25,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 529 transitions. [2023-08-24 12:46:25,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:46:25,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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 12:46:25,083 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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 12:46:25,083 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 111 flow. Second operand 3 states and 529 transitions. [2023-08-24 12:46:25,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 271 flow [2023-08-24 12:46:25,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 267 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 12:46:25,085 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 115 flow [2023-08-24 12:46:25,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2023-08-24 12:46:25,086 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2023-08-24 12:46:25,086 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 115 flow [2023-08-24 12:46:25,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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 12:46:25,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:46:25,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:46:25,093 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 12:46:25,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:46:25,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 12:46:25,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:46:25,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1248984222, now seen corresponding path program 1 times [2023-08-24 12:46:25,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:46:25,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191410923] [2023-08-24 12:46:25,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:46:25,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:46:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:46:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:46:25,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:46:25,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191410923] [2023-08-24 12:46:25,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191410923] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:46:25,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485361102] [2023-08-24 12:46:25,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:46:25,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:46:25,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:46:25,376 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 12:46:25,378 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 12:46:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:46:25,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:46:25,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:46:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:46:25,479 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:46:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:46:25,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485361102] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:46:25,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:46:25,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 12:46:25,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218886531] [2023-08-24 12:46:25,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:46:25,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:46:25,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:46:25,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:46:25,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 12:46:25,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 348 [2023-08-24 12:46:25,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 115 flow. Second operand has 7 states, 7 states have (on average 158.14285714285714) internal successors, (1107), 7 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states 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 12:46:25,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:46:25,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 348 [2023-08-24 12:46:25,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:46:25,591 INFO L124 PetriNetUnfolderBase]: 380/759 cut-off events. [2023-08-24 12:46:25,591 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-08-24 12:46:25,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1523 conditions, 759 events. 380/759 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3362 event pairs, 306 based on Foata normal form. 3/646 useless extension candidates. Maximal degree in co-relation 1496. Up to 690 conditions per place. [2023-08-24 12:46:25,594 INFO L140 encePairwiseOnDemand]: 345/348 looper letters, 40 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-08-24 12:46:25,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 217 flow [2023-08-24 12:46:25,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:46:25,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:46:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 984 transitions. [2023-08-24 12:46:25,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47126436781609193 [2023-08-24 12:46:25,597 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 984 transitions. [2023-08-24 12:46:25,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 984 transitions. [2023-08-24 12:46:25,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:46:25,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 984 transitions. [2023-08-24 12:46:25,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 0 states 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 12:46:25,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states 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 12:46:25,602 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 348.0) internal successors, (2436), 7 states have internal predecessors, (2436), 0 states have call successors, (0), 0 states 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 12:46:25,602 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 115 flow. Second operand 6 states and 984 transitions. [2023-08-24 12:46:25,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 217 flow [2023-08-24 12:46:25,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 213 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 12:46:25,603 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 147 flow [2023-08-24 12:46:25,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=147, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-08-24 12:46:25,604 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2023-08-24 12:46:25,604 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 147 flow [2023-08-24 12:46:25,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.14285714285714) internal successors, (1107), 7 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states 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 12:46:25,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:46:25,605 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:46:25,611 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 12:46:25,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-24 12:46:25,809 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 12:46:25,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:46:25,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1838732502, now seen corresponding path program 2 times [2023-08-24 12:46:25,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:46:25,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157924839] [2023-08-24 12:46:25,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:46:25,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:46:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:46:25,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:46:25,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:46:25,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157924839] [2023-08-24 12:46:25,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157924839] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:46:25,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027417042] [2023-08-24 12:46:25,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:46:25,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:46:25,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:46:25,915 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 12:46:25,917 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 12:46:25,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 12:46:25,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:46:25,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-24 12:46:25,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:46:26,004 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 7 treesize of output 6 [2023-08-24 12:46:26,056 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:46:26,057 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 12:46:26,081 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 13 treesize of output 15 [2023-08-24 12:46:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-24 12:46:26,119 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:46:26,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027417042] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:46:26,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:46:26,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-24 12:46:26,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141949351] [2023-08-24 12:46:26,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:46:26,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 12:46:26,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:46:26,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 12:46:26,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-24 12:46:26,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 348 [2023-08-24 12:46:26,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states 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 12:46:26,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:46:26,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 348 [2023-08-24 12:46:26,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:46:26,312 INFO L124 PetriNetUnfolderBase]: 579/1161 cut-off events. [2023-08-24 12:46:26,312 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2023-08-24 12:46:26,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2343 conditions, 1161 events. 579/1161 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5681 event pairs, 71 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 2308. Up to 721 conditions per place. [2023-08-24 12:46:26,316 INFO L140 encePairwiseOnDemand]: 342/348 looper letters, 84 selfloop transitions, 6 changer transitions 0/95 dead transitions. [2023-08-24 12:46:26,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 95 transitions, 421 flow [2023-08-24 12:46:26,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 12:46:26,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 12:46:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 722 transitions. [2023-08-24 12:46:26,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4149425287356322 [2023-08-24 12:46:26,320 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 722 transitions. [2023-08-24 12:46:26,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 722 transitions. [2023-08-24 12:46:26,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:46:26,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 722 transitions. [2023-08-24 12:46:26,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.4) internal successors, (722), 5 states have internal predecessors, (722), 0 states have call successors, (0), 0 states 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 12:46:26,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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 12:46:26,328 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 348.0) internal successors, (2088), 6 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states 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 12:46:26,328 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 147 flow. Second operand 5 states and 722 transitions. [2023-08-24 12:46:26,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 95 transitions, 421 flow [2023-08-24 12:46:26,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 95 transitions, 407 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 12:46:26,331 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 167 flow [2023-08-24 12:46:26,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=167, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2023-08-24 12:46:26,332 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2023-08-24 12:46:26,332 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 167 flow [2023-08-24 12:46:26,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 0 states 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 12:46:26,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:46:26,333 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:46:26,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 12:46:26,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:46:26,538 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 12:46:26,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:46:26,538 INFO L85 PathProgramCache]: Analyzing trace with hash -631612273, now seen corresponding path program 1 times [2023-08-24 12:46:26,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:46:26,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325562037] [2023-08-24 12:46:26,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:46:26,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:46:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:46:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-24 12:46:26,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:46:26,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325562037] [2023-08-24 12:46:26,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325562037] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:46:26,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328436518] [2023-08-24 12:46:26,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:46:26,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:46:26,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:46:26,584 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 12:46:26,586 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 12:46:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:46:26,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 12:46:26,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:46:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 12:46:26,677 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:46:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 12:46:26,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328436518] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:46:26,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:46:26,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-24 12:46:26,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949169913] [2023-08-24 12:46:26,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:46:26,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-24 12:46:26,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:46:26,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-24 12:46:26,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-24 12:46:26,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 348 [2023-08-24 12:46:26,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 167 flow. Second operand has 14 states, 14 states have (on average 150.92857142857142) internal successors, (2113), 14 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states 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 12:46:26,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:46:26,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 348 [2023-08-24 12:46:26,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:46:26,789 INFO L124 PetriNetUnfolderBase]: 67/201 cut-off events. [2023-08-24 12:46:26,789 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-08-24 12:46:26,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 201 events. 67/201 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 671 event pairs, 1 based on Foata normal form. 36/231 useless extension candidates. Maximal degree in co-relation 435. Up to 123 conditions per place. [2023-08-24 12:46:26,790 INFO L140 encePairwiseOnDemand]: 343/348 looper letters, 42 selfloop transitions, 13 changer transitions 2/60 dead transitions. [2023-08-24 12:46:26,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 318 flow [2023-08-24 12:46:26,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 12:46:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-24 12:46:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2146 transitions. [2023-08-24 12:46:26,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2023-08-24 12:46:26,794 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2146 transitions. [2023-08-24 12:46:26,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2146 transitions. [2023-08-24 12:46:26,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:46:26,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2146 transitions. [2023-08-24 12:46:26,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 153.28571428571428) internal successors, (2146), 14 states have internal predecessors, (2146), 0 states have call successors, (0), 0 states 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 12:46:26,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 348.0) internal successors, (5220), 15 states have internal predecessors, (5220), 0 states have call successors, (0), 0 states 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 12:46:26,804 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 348.0) internal successors, (5220), 15 states have internal predecessors, (5220), 0 states have call successors, (0), 0 states 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 12:46:26,804 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 167 flow. Second operand 14 states and 2146 transitions. [2023-08-24 12:46:26,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 318 flow [2023-08-24 12:46:26,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 60 transitions, 311 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 12:46:26,808 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 169 flow [2023-08-24 12:46:26,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=169, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-08-24 12:46:26,810 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-08-24 12:46:26,810 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 169 flow [2023-08-24 12:46:26,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 150.92857142857142) internal successors, (2113), 14 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states 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 12:46:26,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:46:26,811 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:46:26,818 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 12:46:27,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:46:27,016 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 12:46:27,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:46:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash 655187699, now seen corresponding path program 1 times [2023-08-24 12:46:27,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:46:27,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798141769] [2023-08-24 12:46:27,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:46:27,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:46:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:46:27,362 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:46:27,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:46:27,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798141769] [2023-08-24 12:46:27,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798141769] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:46:27,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000256158] [2023-08-24 12:46:27,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:46:27,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:46:27,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:46:27,364 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 12:46:27,366 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 12:46:27,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:46:27,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-24 12:46:27,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:46:27,465 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 7 treesize of output 6 [2023-08-24 12:46:27,521 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:46:27,521 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 12:46:27,544 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 13 treesize of output 15 [2023-08-24 12:46:27,630 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 24 treesize of output 17 [2023-08-24 12:46:27,672 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 25 [2023-08-24 12:46:27,714 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:46:27,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:46:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:46:41,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000256158] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:46:41,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:46:41,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-08-24 12:46:41,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718354011] [2023-08-24 12:46:41,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:46:41,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 12:46:41,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:46:41,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 12:46:41,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=368, Unknown=10, NotChecked=0, Total=462 [2023-08-24 12:46:41,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 348 [2023-08-24 12:46:41,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 169 flow. Second operand has 22 states, 22 states have (on average 119.68181818181819) internal successors, (2633), 22 states have internal predecessors, (2633), 0 states have call successors, (0), 0 states 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 12:46:41,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:46:41,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 348 [2023-08-24 12:46:41,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:46:42,306 INFO L124 PetriNetUnfolderBase]: 59/182 cut-off events. [2023-08-24 12:46:42,306 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-08-24 12:46:42,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 182 events. 59/182 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 482 event pairs, 2 based on Foata normal form. 3/178 useless extension candidates. Maximal degree in co-relation 384. Up to 43 conditions per place. [2023-08-24 12:46:42,307 INFO L140 encePairwiseOnDemand]: 337/348 looper letters, 57 selfloop transitions, 17 changer transitions 2/79 dead transitions. [2023-08-24 12:46:42,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 79 transitions, 425 flow [2023-08-24 12:46:42,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 12:46:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 12:46:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1471 transitions. [2023-08-24 12:46:42,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35225095785440613 [2023-08-24 12:46:42,310 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1471 transitions. [2023-08-24 12:46:42,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1471 transitions. [2023-08-24 12:46:42,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:46:42,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1471 transitions. [2023-08-24 12:46:42,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 122.58333333333333) internal successors, (1471), 12 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states 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 12:46:42,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 348.0) internal successors, (4524), 13 states have internal predecessors, (4524), 0 states have call successors, (0), 0 states 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 12:46:42,317 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 348.0) internal successors, (4524), 13 states have internal predecessors, (4524), 0 states have call successors, (0), 0 states 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 12:46:42,317 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 169 flow. Second operand 12 states and 1471 transitions. [2023-08-24 12:46:42,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 79 transitions, 425 flow [2023-08-24 12:46:42,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 79 transitions, 350 flow, removed 24 selfloop flow, removed 10 redundant places. [2023-08-24 12:46:42,319 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 209 flow [2023-08-24 12:46:42,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=209, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2023-08-24 12:46:42,319 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2023-08-24 12:46:42,319 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 209 flow [2023-08-24 12:46:42,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 119.68181818181819) internal successors, (2633), 22 states have internal predecessors, (2633), 0 states have call successors, (0), 0 states 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 12:46:42,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:46:42,320 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:46:42,327 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 12:46:42,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:46:42,521 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-24 12:46:42,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:46:42,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1272991443, now seen corresponding path program 1 times [2023-08-24 12:46:42,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:46:42,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477785762] [2023-08-24 12:46:42,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:46:42,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:46:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:46:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:46:42,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:46:42,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477785762] [2023-08-24 12:46:42,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477785762] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:46:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117911949] [2023-08-24 12:46:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:46:42,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:46:42,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:46:42,914 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 12:46:42,916 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 12:46:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:46:43,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-24 12:46:43,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:46:43,018 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 7 treesize of output 6 [2023-08-24 12:46:43,062 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:46:43,062 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 12:46:43,068 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 13 treesize of output 15 [2023-08-24 12:46:43,133 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 24 treesize of output 17 [2023-08-24 12:46:43,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-08-24 12:46:43,216 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 25 [2023-08-24 12:46:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:46:43,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:46:59,320 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0)) is different from false [2023-08-24 12:47:01,327 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0)) is different from false [2023-08-24 12:47:01,338 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_312 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0)) is different from false [2023-08-24 12:47:01,349 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_312 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0)) is different from false [2023-08-24 12:47:01,363 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_312 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0)) is different from false [2023-08-24 12:47:11,484 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62| Int) (v_ArrVal_309 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_312 (Array Int Int))) (= (select (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_309))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|))) (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312) |c_~#cache~0.base|))) (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_62|) 0)) is different from false [2023-08-24 12:47:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-24 12:47:11,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117911949] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:47:11,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:47:11,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 24 [2023-08-24 12:47:11,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021534614] [2023-08-24 12:47:11,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:47:11,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-24 12:47:11,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:11,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-24 12:47:11,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=297, Unknown=15, NotChecked=246, Total=650 [2023-08-24 12:47:11,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 348 [2023-08-24 12:47:11,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 209 flow. Second operand has 26 states, 26 states have (on average 119.38461538461539) internal successors, (3104), 26 states have internal predecessors, (3104), 0 states have call successors, (0), 0 states 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 12:47:11,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:11,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 348 [2023-08-24 12:47:11,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:25,891 WARN L234 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 44 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:47:27,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:47:40,289 INFO L124 PetriNetUnfolderBase]: 54/186 cut-off events. [2023-08-24 12:47:40,289 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-08-24 12:47:40,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 186 events. 54/186 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 521 event pairs, 2 based on Foata normal form. 1/180 useless extension candidates. Maximal degree in co-relation 475. Up to 61 conditions per place. [2023-08-24 12:47:40,290 INFO L140 encePairwiseOnDemand]: 338/348 looper letters, 0 selfloop transitions, 0 changer transitions 75/75 dead transitions. [2023-08-24 12:47:40,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 75 transitions, 448 flow [2023-08-24 12:47:40,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-24 12:47:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-24 12:47:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1572 transitions. [2023-08-24 12:47:40,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34748010610079577 [2023-08-24 12:47:40,293 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1572 transitions. [2023-08-24 12:47:40,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1572 transitions. [2023-08-24 12:47:40,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:40,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1572 transitions. [2023-08-24 12:47:40,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 120.92307692307692) internal successors, (1572), 13 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states 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 12:47:40,300 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 348.0) internal successors, (4872), 14 states have internal predecessors, (4872), 0 states have call successors, (0), 0 states 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 12:47:40,301 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 348.0) internal successors, (4872), 14 states have internal predecessors, (4872), 0 states have call successors, (0), 0 states 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 12:47:40,301 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 209 flow. Second operand 13 states and 1572 transitions. [2023-08-24 12:47:40,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 75 transitions, 448 flow [2023-08-24 12:47:40,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 75 transitions, 432 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-24 12:47:40,302 INFO L231 Difference]: Finished difference. Result has 67 places, 0 transitions, 0 flow [2023-08-24 12:47:40,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=348, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=67, PETRI_TRANSITIONS=0} [2023-08-24 12:47:40,303 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2023-08-24 12:47:40,303 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 0 transitions, 0 flow [2023-08-24 12:47:40,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 119.38461538461539) internal successors, (3104), 26 states have internal predecessors, (3104), 0 states have call successors, (0), 0 states 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 12:47:40,306 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-24 12:47:40,306 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-24 12:47:40,306 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-24 12:47:40,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 12:47:40,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:40,511 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-08-24 12:47:40,512 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-24 12:47:40,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 195 transitions, 398 flow [2023-08-24 12:47:40,528 INFO L124 PetriNetUnfolderBase]: 49/278 cut-off events. [2023-08-24 12:47:40,528 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-24 12:47:40,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 278 events. 49/278 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 982 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2023-08-24 12:47:40,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 195 transitions, 398 flow [2023-08-24 12:47:40,530 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 190 transitions, 385 flow [2023-08-24 12:47:40,530 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 12:47:40,530 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 190 transitions, 385 flow [2023-08-24 12:47:40,530 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 190 transitions, 385 flow [2023-08-24 12:47:40,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 190 transitions, 385 flow [2023-08-24 12:47:40,542 INFO L124 PetriNetUnfolderBase]: 48/273 cut-off events. [2023-08-24 12:47:40,542 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:40,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 273 events. 48/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 933 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2023-08-24 12:47:40,546 INFO L119 LiptonReduction]: Number of co-enabled transitions 12282 [2023-08-24 12:47:42,286 INFO L134 LiptonReduction]: Checked pairs total: 18947 [2023-08-24 12:47:42,287 INFO L136 LiptonReduction]: Total number of compositions: 155 [2023-08-24 12:47:42,288 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-24 12:47:42,288 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;@32742db7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 12:47:42,288 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-24 12:47:42,290 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 12:47:42,290 INFO L124 PetriNetUnfolderBase]: 9/29 cut-off events. [2023-08-24 12:47:42,290 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:42,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:42,290 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-24 12:47:42,290 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:47:42,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:42,290 INFO L85 PathProgramCache]: Analyzing trace with hash -362945164, now seen corresponding path program 1 times [2023-08-24 12:47:42,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:42,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671699092] [2023-08-24 12:47:42,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:42,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:42,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:42,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671699092] [2023-08-24 12:47:42,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671699092] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:47:42,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:47:42,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 12:47:42,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737065629] [2023-08-24 12:47:42,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:47:42,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:47:42,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:42,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:47:42,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 12:47:42,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 350 [2023-08-24 12:47:42,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 70 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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 12:47:42,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:42,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 350 [2023-08-24 12:47:42,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:42,374 INFO L124 PetriNetUnfolderBase]: 381/772 cut-off events. [2023-08-24 12:47:42,374 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:42,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 772 events. 381/772 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3510 event pairs, 306 based on Foata normal form. 76/709 useless extension candidates. Maximal degree in co-relation 1428. Up to 707 conditions per place. [2023-08-24 12:47:42,375 INFO L140 encePairwiseOnDemand]: 324/350 looper letters, 24 selfloop transitions, 2 changer transitions 19/48 dead transitions. [2023-08-24 12:47:42,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 185 flow [2023-08-24 12:47:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:47:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:47:42,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2023-08-24 12:47:42,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085714285714286 [2023-08-24 12:47:42,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2023-08-24 12:47:42,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2023-08-24 12:47:42,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:42,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2023-08-24 12:47:42,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states 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 12:47:42,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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 12:47:42,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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 12:47:42,381 INFO L175 Difference]: Start difference. First operand has 46 places, 70 transitions, 145 flow. Second operand 3 states and 534 transitions. [2023-08-24 12:47:42,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 185 flow [2023-08-24 12:47:42,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 48 transitions, 185 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:47:42,381 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 73 flow [2023-08-24 12:47:42,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2023-08-24 12:47:42,382 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2023-08-24 12:47:42,382 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 73 flow [2023-08-24 12:47:42,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states 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 12:47:42,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:42,383 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:42,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 12:47:42,383 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:47:42,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:42,383 INFO L85 PathProgramCache]: Analyzing trace with hash -876507840, now seen corresponding path program 1 times [2023-08-24 12:47:42,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:42,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176513104] [2023-08-24 12:47:42,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:42,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:42,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:42,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176513104] [2023-08-24 12:47:42,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176513104] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:42,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963924742] [2023-08-24 12:47:42,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:42,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:42,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:42,409 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 12:47:42,411 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 12:47:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:42,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:47:42,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:42,506 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:47:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:42,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963924742] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:47:42,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:47:42,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 12:47:42,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843513543] [2023-08-24 12:47:42,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:47:42,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:47:42,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:42,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:47:42,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 12:47:42,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 350 [2023-08-24 12:47:42,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 29 transitions, 73 flow. Second operand has 7 states, 7 states have (on average 157.57142857142858) internal successors, (1103), 7 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:42,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:42,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 350 [2023-08-24 12:47:42,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:42,568 INFO L124 PetriNetUnfolderBase]: 60/146 cut-off events. [2023-08-24 12:47:42,568 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 12:47:42,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 146 events. 60/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 404 event pairs, 51 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 287. Up to 133 conditions per place. [2023-08-24 12:47:42,568 INFO L140 encePairwiseOnDemand]: 347/350 looper letters, 24 selfloop transitions, 5 changer transitions 0/32 dead transitions. [2023-08-24 12:47:42,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 143 flow [2023-08-24 12:47:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:47:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:47:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2023-08-24 12:47:42,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46095238095238095 [2023-08-24 12:47:42,570 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 968 transitions. [2023-08-24 12:47:42,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 968 transitions. [2023-08-24 12:47:42,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:42,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 968 transitions. [2023-08-24 12:47:42,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.33333333333334) internal successors, (968), 6 states have internal predecessors, (968), 0 states have call successors, (0), 0 states 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 12:47:42,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states 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 12:47:42,575 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states 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 12:47:42,575 INFO L175 Difference]: Start difference. First operand has 48 places, 29 transitions, 73 flow. Second operand 6 states and 968 transitions. [2023-08-24 12:47:42,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 143 flow [2023-08-24 12:47:42,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 139 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 12:47:42,576 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 105 flow [2023-08-24 12:47:42,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=105, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2023-08-24 12:47:42,577 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -8 predicate places. [2023-08-24 12:47:42,577 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 105 flow [2023-08-24 12:47:42,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 157.57142857142858) internal successors, (1103), 7 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 12:47:42,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:42,577 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-24 12:47:42,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 12:47:42,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:42,782 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:47:42,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:42,782 INFO L85 PathProgramCache]: Analyzing trace with hash -101746572, now seen corresponding path program 2 times [2023-08-24 12:47:42,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:42,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908876362] [2023-08-24 12:47:42,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:42,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:42,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:42,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908876362] [2023-08-24 12:47:42,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908876362] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:42,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084506469] [2023-08-24 12:47:42,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:47:42,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:42,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:42,836 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 12:47:42,838 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 12:47:42,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:47:42,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:47:42,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 12:47:42,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:42,913 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:47:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 12:47:42,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084506469] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:47:42,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:47:42,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-24 12:47:42,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509808026] [2023-08-24 12:47:42,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:47:42,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 12:47:42,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:42,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 12:47:42,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-24 12:47:42,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 350 [2023-08-24 12:47:42,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 105 flow. Second operand has 13 states, 13 states have (on average 157.30769230769232) internal successors, (2045), 13 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states 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 12:47:42,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:42,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 350 [2023-08-24 12:47:42,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:43,023 INFO L124 PetriNetUnfolderBase]: 60/152 cut-off events. [2023-08-24 12:47:43,023 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-24 12:47:43,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 152 events. 60/152 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 401 event pairs, 51 based on Foata normal form. 6/127 useless extension candidates. Maximal degree in co-relation 278. Up to 133 conditions per place. [2023-08-24 12:47:43,024 INFO L140 encePairwiseOnDemand]: 347/350 looper letters, 24 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-08-24 12:47:43,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 211 flow [2023-08-24 12:47:43,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 12:47:43,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 12:47:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1913 transitions. [2023-08-24 12:47:43,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4554761904761905 [2023-08-24 12:47:43,028 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1913 transitions. [2023-08-24 12:47:43,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1913 transitions. [2023-08-24 12:47:43,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:43,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1913 transitions. [2023-08-24 12:47:43,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 159.41666666666666) internal successors, (1913), 12 states have internal predecessors, (1913), 0 states have call successors, (0), 0 states 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 12:47:43,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 350.0) internal successors, (4550), 13 states have internal predecessors, (4550), 0 states have call successors, (0), 0 states 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 12:47:43,036 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 350.0) internal successors, (4550), 13 states have internal predecessors, (4550), 0 states have call successors, (0), 0 states 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 12:47:43,036 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 105 flow. Second operand 12 states and 1913 transitions. [2023-08-24 12:47:43,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 211 flow [2023-08-24 12:47:43,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 197 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 12:47:43,038 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 175 flow [2023-08-24 12:47:43,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=175, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-08-24 12:47:43,038 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 8 predicate places. [2023-08-24 12:47:43,039 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 175 flow [2023-08-24 12:47:43,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 157.30769230769232) internal successors, (2045), 13 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states 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 12:47:43,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:43,039 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-24 12:47:43,047 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 12:47:43,247 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,SelfDestructingSolverStorable9 [2023-08-24 12:47:43,247 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 12:47:43,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:43,247 INFO L85 PathProgramCache]: Analyzing trace with hash 455279860, now seen corresponding path program 3 times [2023-08-24 12:47:43,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:43,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266219923] [2023-08-24 12:47:43,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:43,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 12:47:43,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 12:47:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 12:47:43,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 12:47:43,279 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 12:47:43,279 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-24 12:47:43,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 12:47:43,279 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-24 12:47:43,280 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-24 12:47:43,280 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-24 12:47:43,280 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-24 12:47:43,301 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-24 12:47:43,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 266 transitions, 550 flow [2023-08-24 12:47:43,330 INFO L124 PetriNetUnfolderBase]: 82/457 cut-off events. [2023-08-24 12:47:43,330 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 12:47:43,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 457 events. 82/457 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2002 event pairs, 0 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 280. Up to 12 conditions per place. [2023-08-24 12:47:43,332 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 266 transitions, 550 flow [2023-08-24 12:47:43,337 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 266 transitions, 550 flow [2023-08-24 12:47:43,337 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 12:47:43,337 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 266 transitions, 550 flow [2023-08-24 12:47:43,338 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 266 transitions, 550 flow [2023-08-24 12:47:43,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 266 transitions, 550 flow [2023-08-24 12:47:43,362 INFO L124 PetriNetUnfolderBase]: 82/457 cut-off events. [2023-08-24 12:47:43,362 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 12:47:43,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 457 events. 82/457 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2002 event pairs, 0 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 280. Up to 12 conditions per place. [2023-08-24 12:47:43,378 INFO L119 LiptonReduction]: Number of co-enabled transitions 35604 [2023-08-24 12:47:45,687 INFO L134 LiptonReduction]: Checked pairs total: 58078 [2023-08-24 12:47:45,688 INFO L136 LiptonReduction]: Total number of compositions: 206 [2023-08-24 12:47:45,689 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 12:47:45,689 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;@32742db7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 12:47:45,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 12:47:45,690 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 12:47:45,690 INFO L124 PetriNetUnfolderBase]: 7/32 cut-off events. [2023-08-24 12:47:45,691 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-24 12:47:45,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:45,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:45,691 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:47:45,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:45,691 INFO L85 PathProgramCache]: Analyzing trace with hash 783322278, now seen corresponding path program 1 times [2023-08-24 12:47:45,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:45,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933211682] [2023-08-24 12:47:45,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:45,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:45,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 12:47:45,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:45,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933211682] [2023-08-24 12:47:45,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933211682] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:47:45,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:47:45,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 12:47:45,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511051458] [2023-08-24 12:47:45,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:47:45,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:47:45,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:45,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:47:45,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 12:47:45,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 472 [2023-08-24 12:47:45,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 106 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states 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 12:47:45,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:45,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 472 [2023-08-24 12:47:45,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:46,594 INFO L124 PetriNetUnfolderBase]: 12095/18653 cut-off events. [2023-08-24 12:47:46,594 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-08-24 12:47:46,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35943 conditions, 18653 events. 12095/18653 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 119751 event pairs, 10328 based on Foata normal form. 3245/18244 useless extension candidates. Maximal degree in co-relation 12233. Up to 17187 conditions per place. [2023-08-24 12:47:46,669 INFO L140 encePairwiseOnDemand]: 438/472 looper letters, 60 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-08-24 12:47:46,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 76 transitions, 294 flow [2023-08-24 12:47:46,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:47:46,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:47:46,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2023-08-24 12:47:46,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155367231638418 [2023-08-24 12:47:46,671 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 730 transitions. [2023-08-24 12:47:46,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 730 transitions. [2023-08-24 12:47:46,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:46,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 730 transitions. [2023-08-24 12:47:46,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 0 states have call successors, (0), 0 states 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 12:47:46,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states 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 12:47:46,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states 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 12:47:46,674 INFO L175 Difference]: Start difference. First operand has 71 places, 106 transitions, 230 flow. Second operand 3 states and 730 transitions. [2023-08-24 12:47:46,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 76 transitions, 294 flow [2023-08-24 12:47:46,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 76 transitions, 294 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:47:46,677 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 180 flow [2023-08-24 12:47:46,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2023-08-24 12:47:46,678 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 3 predicate places. [2023-08-24 12:47:46,678 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 180 flow [2023-08-24 12:47:46,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states 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 12:47:46,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:46,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:46,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 12:47:46,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:47:46,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:46,679 INFO L85 PathProgramCache]: Analyzing trace with hash 343415325, now seen corresponding path program 1 times [2023-08-24 12:47:46,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:46,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212962662] [2023-08-24 12:47:46,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:46,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:47:46,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:46,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212962662] [2023-08-24 12:47:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212962662] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:46,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893069587] [2023-08-24 12:47:46,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:46,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:46,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:46,702 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 12:47:46,704 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 12:47:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:46,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-24 12:47:46,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 12:47:46,776 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:47:46,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893069587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:47:46,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:47:46,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-24 12:47:46,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942712847] [2023-08-24 12:47:46,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:47:46,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 12:47:46,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:46,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 12:47:46,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 12:47:46,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 472 [2023-08-24 12:47:46,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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 12:47:46,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:46,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 472 [2023-08-24 12:47:46,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:47,583 INFO L124 PetriNetUnfolderBase]: 12169/18781 cut-off events. [2023-08-24 12:47:47,583 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2023-08-24 12:47:47,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36070 conditions, 18781 events. 12169/18781 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 120290 event pairs, 7082 based on Foata normal form. 0/15166 useless extension candidates. Maximal degree in co-relation 36057. Up to 17153 conditions per place. [2023-08-24 12:47:47,710 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 78 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-08-24 12:47:47,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 94 transitions, 376 flow [2023-08-24 12:47:47,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 12:47:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 12:47:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2023-08-24 12:47:47,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056497175141242 [2023-08-24 12:47:47,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 716 transitions. [2023-08-24 12:47:47,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 716 transitions. [2023-08-24 12:47:47,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:47,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 716 transitions. [2023-08-24 12:47:47,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states 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 12:47:47,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states 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 12:47:47,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states 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 12:47:47,715 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 180 flow. Second operand 3 states and 716 transitions. [2023-08-24 12:47:47,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 94 transitions, 376 flow [2023-08-24 12:47:47,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 372 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 12:47:47,717 INFO L231 Difference]: Finished difference. Result has 76 places, 77 transitions, 188 flow [2023-08-24 12:47:47,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=76, PETRI_TRANSITIONS=77} [2023-08-24 12:47:47,717 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 5 predicate places. [2023-08-24 12:47:47,718 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 77 transitions, 188 flow [2023-08-24 12:47:47,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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 12:47:47,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:47,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:47,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-24 12:47:47,922 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,SelfDestructingSolverStorable12 [2023-08-24 12:47:47,922 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:47:47,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:47,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1166824959, now seen corresponding path program 1 times [2023-08-24 12:47:47,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:47,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746334235] [2023-08-24 12:47:47,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:47,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:47:47,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:47,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746334235] [2023-08-24 12:47:47,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746334235] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:47,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792542723] [2023-08-24 12:47:47,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:47,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:47,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:47,946 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 12:47:47,972 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 12:47:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:48,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-24 12:47:48,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:47:48,025 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:47:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:47:48,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792542723] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:47:48,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:47:48,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 12:47:48,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26254933] [2023-08-24 12:47:48,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:47:48,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:47:48,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:48,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:47:48,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-24 12:47:48,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 472 [2023-08-24 12:47:48,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 77 transitions, 188 flow. Second operand has 7 states, 7 states have (on average 214.14285714285714) internal successors, (1499), 7 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states 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 12:47:48,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:48,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 472 [2023-08-24 12:47:48,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:48,878 INFO L124 PetriNetUnfolderBase]: 12152/18699 cut-off events. [2023-08-24 12:47:48,878 INFO L125 PetriNetUnfolderBase]: For 704/704 co-relation queries the response was YES. [2023-08-24 12:47:48,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36578 conditions, 18699 events. 12152/18699 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 547. Compared 119133 event pairs, 10328 based on Foata normal form. 3/15288 useless extension candidates. Maximal degree in co-relation 36550. Up to 17171 conditions per place. [2023-08-24 12:47:48,931 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 61 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2023-08-24 12:47:48,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 80 transitions, 332 flow [2023-08-24 12:47:48,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:47:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:47:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1340 transitions. [2023-08-24 12:47:48,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4731638418079096 [2023-08-24 12:47:48,933 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1340 transitions. [2023-08-24 12:47:48,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1340 transitions. [2023-08-24 12:47:48,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:48,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1340 transitions. [2023-08-24 12:47:48,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 223.33333333333334) internal successors, (1340), 6 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states 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 12:47:48,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 12:47:48,938 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 12:47:48,938 INFO L175 Difference]: Start difference. First operand has 76 places, 77 transitions, 188 flow. Second operand 6 states and 1340 transitions. [2023-08-24 12:47:48,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 80 transitions, 332 flow [2023-08-24 12:47:48,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 80 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 12:47:48,940 INFO L231 Difference]: Finished difference. Result has 83 places, 80 transitions, 222 flow [2023-08-24 12:47:48,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=83, PETRI_TRANSITIONS=80} [2023-08-24 12:47:48,941 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 12 predicate places. [2023-08-24 12:47:48,941 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 80 transitions, 222 flow [2023-08-24 12:47:48,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 214.14285714285714) internal successors, (1499), 7 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states 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 12:47:48,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:48,941 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:48,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-24 12:47:49,145 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,SelfDestructingSolverStorable13 [2023-08-24 12:47:49,145 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:47:49,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:49,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1869807624, now seen corresponding path program 2 times [2023-08-24 12:47:49,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:49,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803198234] [2023-08-24 12:47:49,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:49,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 12:47:49,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803198234] [2023-08-24 12:47:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803198234] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909528473] [2023-08-24 12:47:49,188 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:47:49,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:49,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:49,189 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:47:49,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-24 12:47:49,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 12:47:49,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:47:49,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-24 12:47:49,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:49,266 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 7 treesize of output 6 [2023-08-24 12:47:49,292 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:47:49,292 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 12:47:49,306 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 13 treesize of output 15 [2023-08-24 12:47:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-24 12:47:49,333 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:47:49,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909528473] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:47:49,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:47:49,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-24 12:47:49,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046005733] [2023-08-24 12:47:49,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:47:49,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 12:47:49,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:49,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 12:47:49,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-24 12:47:49,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 472 [2023-08-24 12:47:49,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 178.66666666666666) internal successors, (1072), 6 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states 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 12:47:49,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:49,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 472 [2023-08-24 12:47:49,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:50,916 INFO L124 PetriNetUnfolderBase]: 17108/27077 cut-off events. [2023-08-24 12:47:50,917 INFO L125 PetriNetUnfolderBase]: For 1093/1093 co-relation queries the response was YES. [2023-08-24 12:47:50,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53145 conditions, 27077 events. 17108/27077 cut-off events. For 1093/1093 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 192088 event pairs, 2300 based on Foata normal form. 0/22144 useless extension candidates. Maximal degree in co-relation 53109. Up to 17911 conditions per place. [2023-08-24 12:47:50,997 INFO L140 encePairwiseOnDemand]: 464/472 looper letters, 173 selfloop transitions, 14 changer transitions 0/200 dead transitions. [2023-08-24 12:47:50,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 200 transitions, 870 flow [2023-08-24 12:47:50,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:47:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:47:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1244 transitions. [2023-08-24 12:47:51,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392655367231638 [2023-08-24 12:47:51,000 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1244 transitions. [2023-08-24 12:47:51,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1244 transitions. [2023-08-24 12:47:51,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:51,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1244 transitions. [2023-08-24 12:47:51,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 207.33333333333334) internal successors, (1244), 6 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states 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 12:47:51,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 12:47:51,005 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 12:47:51,005 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 222 flow. Second operand 6 states and 1244 transitions. [2023-08-24 12:47:51,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 200 transitions, 870 flow [2023-08-24 12:47:51,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 200 transitions, 856 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 12:47:51,007 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 295 flow [2023-08-24 12:47:51,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=295, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2023-08-24 12:47:51,008 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 20 predicate places. [2023-08-24 12:47:51,008 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 295 flow [2023-08-24 12:47:51,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 178.66666666666666) internal successors, (1072), 6 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states 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 12:47:51,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:51,008 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:51,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-24 12:47:51,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-24 12:47:51,213 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:47:51,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:51,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1138797119, now seen corresponding path program 1 times [2023-08-24 12:47:51,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:51,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816486966] [2023-08-24 12:47:51,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:51,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-24 12:47:51,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:51,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816486966] [2023-08-24 12:47:51,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816486966] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:51,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849225169] [2023-08-24 12:47:51,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:51,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:51,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:51,249 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:47:51,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-24 12:47:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:51,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 12:47:51,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 12:47:51,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:47:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 12:47:51,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849225169] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:47:51,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:47:51,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2023-08-24 12:47:51,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579189612] [2023-08-24 12:47:51,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:47:51,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-24 12:47:51,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:51,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-24 12:47:51,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-08-24 12:47:51,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 472 [2023-08-24 12:47:51,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 295 flow. Second operand has 14 states, 14 states have (on average 206.92857142857142) internal successors, (2897), 14 states have internal predecessors, (2897), 0 states have call successors, (0), 0 states 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 12:47:51,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:51,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 472 [2023-08-24 12:47:51,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:47:52,849 INFO L124 PetriNetUnfolderBase]: 16186/25529 cut-off events. [2023-08-24 12:47:52,850 INFO L125 PetriNetUnfolderBase]: For 5105/5107 co-relation queries the response was YES. [2023-08-24 12:47:52,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55530 conditions, 25529 events. 16186/25529 cut-off events. For 5105/5107 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 182040 event pairs, 463 based on Foata normal form. 32/22321 useless extension candidates. Maximal degree in co-relation 55471. Up to 22677 conditions per place. [2023-08-24 12:47:52,933 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 127 selfloop transitions, 14 changer transitions 0/155 dead transitions. [2023-08-24 12:47:52,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 155 transitions, 769 flow [2023-08-24 12:47:52,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 12:47:52,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-24 12:47:52,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3000 transitions. [2023-08-24 12:47:52,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4539951573849879 [2023-08-24 12:47:52,938 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3000 transitions. [2023-08-24 12:47:52,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3000 transitions. [2023-08-24 12:47:52,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:47:52,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3000 transitions. [2023-08-24 12:47:52,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 214.28571428571428) internal successors, (3000), 14 states have internal predecessors, (3000), 0 states have call successors, (0), 0 states 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 12:47:52,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 472.0) internal successors, (7080), 15 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states 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 12:47:52,949 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 472.0) internal successors, (7080), 15 states have internal predecessors, (7080), 0 states have call successors, (0), 0 states 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 12:47:52,950 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 295 flow. Second operand 14 states and 3000 transitions. [2023-08-24 12:47:52,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 155 transitions, 769 flow [2023-08-24 12:47:52,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 155 transitions, 769 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 12:47:52,964 INFO L231 Difference]: Finished difference. Result has 105 places, 98 transitions, 365 flow [2023-08-24 12:47:52,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=365, PETRI_PLACES=105, PETRI_TRANSITIONS=98} [2023-08-24 12:47:52,965 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 34 predicate places. [2023-08-24 12:47:52,965 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 98 transitions, 365 flow [2023-08-24 12:47:52,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 206.92857142857142) internal successors, (2897), 14 states have internal predecessors, (2897), 0 states have call successors, (0), 0 states 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 12:47:52,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:47:52,966 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:47:52,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-24 12:47:53,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-24 12:47:53,171 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:47:53,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:47:53,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1962611513, now seen corresponding path program 1 times [2023-08-24 12:47:53,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:47:53,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405547323] [2023-08-24 12:47:53,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:53,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:47:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:47:53,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:47:53,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405547323] [2023-08-24 12:47:53,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405547323] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:47:53,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574467108] [2023-08-24 12:47:53,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:47:53,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:47:53,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:47:53,327 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:47:53,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-24 12:47:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:47:53,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-24 12:47:53,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:47:53,431 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 7 treesize of output 6 [2023-08-24 12:47:53,479 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:47:53,480 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 12:47:53,495 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 13 treesize of output 15 [2023-08-24 12:47:53,518 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 13 treesize of output 15 [2023-08-24 12:47:53,546 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:47:53,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:47:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:47:59,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574467108] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:47:59,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:47:59,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-24 12:47:59,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266755472] [2023-08-24 12:47:59,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:47:59,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 12:47:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:47:59,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 12:47:59,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=94, Unknown=3, NotChecked=0, Total=132 [2023-08-24 12:47:59,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 472 [2023-08-24 12:47:59,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 98 transitions, 365 flow. Second operand has 12 states, 12 states have (on average 179.91666666666666) internal successors, (2159), 12 states have internal predecessors, (2159), 0 states have call successors, (0), 0 states 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 12:47:59,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:47:59,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 472 [2023-08-24 12:47:59,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:48:01,803 INFO L124 PetriNetUnfolderBase]: 19924/31017 cut-off events. [2023-08-24 12:48:01,803 INFO L125 PetriNetUnfolderBase]: For 8442/8442 co-relation queries the response was YES. [2023-08-24 12:48:01,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68378 conditions, 31017 events. 19924/31017 cut-off events. For 8442/8442 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 217776 event pairs, 2656 based on Foata normal form. 0/27090 useless extension candidates. Maximal degree in co-relation 68305. Up to 17863 conditions per place. [2023-08-24 12:48:01,902 INFO L140 encePairwiseOnDemand]: 460/472 looper letters, 211 selfloop transitions, 27 changer transitions 0/251 dead transitions. [2023-08-24 12:48:01,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 251 transitions, 1260 flow [2023-08-24 12:48:01,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 12:48:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 12:48:01,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1457 transitions. [2023-08-24 12:48:01,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4409806295399516 [2023-08-24 12:48:01,908 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1457 transitions. [2023-08-24 12:48:01,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1457 transitions. [2023-08-24 12:48:01,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:48:01,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1457 transitions. [2023-08-24 12:48:01,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 208.14285714285714) internal successors, (1457), 7 states have internal predecessors, (1457), 0 states have call successors, (0), 0 states 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 12:48:01,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 472.0) internal successors, (3776), 8 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states 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 12:48:01,913 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 472.0) internal successors, (3776), 8 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states 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 12:48:01,913 INFO L175 Difference]: Start difference. First operand has 105 places, 98 transitions, 365 flow. Second operand 7 states and 1457 transitions. [2023-08-24 12:48:01,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 251 transitions, 1260 flow [2023-08-24 12:48:01,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 251 transitions, 1183 flow, removed 28 selfloop flow, removed 10 redundant places. [2023-08-24 12:48:01,926 INFO L231 Difference]: Finished difference. Result has 107 places, 113 transitions, 479 flow [2023-08-24 12:48:01,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=479, PETRI_PLACES=107, PETRI_TRANSITIONS=113} [2023-08-24 12:48:01,926 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 36 predicate places. [2023-08-24 12:48:01,926 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 113 transitions, 479 flow [2023-08-24 12:48:01,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 179.91666666666666) internal successors, (2159), 12 states have internal predecessors, (2159), 0 states have call successors, (0), 0 states 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 12:48:01,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:48:01,927 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:48:01,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-24 12:48:02,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-24 12:48:02,134 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:48:02,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:48:02,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2014672155, now seen corresponding path program 1 times [2023-08-24 12:48:02,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:48:02,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161277274] [2023-08-24 12:48:02,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:02,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:48:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:48:02,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:48:02,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161277274] [2023-08-24 12:48:02,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161277274] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:48:02,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881048039] [2023-08-24 12:48:02,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:02,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:48:02,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:48:02,171 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:48:02,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-24 12:48:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:02,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 12:48:02,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:48:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:48:02,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:48:02,304 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:48:02,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881048039] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:48:02,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:48:02,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-08-24 12:48:02,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532851524] [2023-08-24 12:48:02,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:48:02,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 12:48:02,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:48:02,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 12:48:02,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-08-24 12:48:02,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 472 [2023-08-24 12:48:02,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 113 transitions, 479 flow. Second operand has 9 states, 9 states have (on average 214.88888888888889) internal successors, (1934), 9 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states 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 12:48:02,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:48:02,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 472 [2023-08-24 12:48:02,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:48:02,609 INFO L124 PetriNetUnfolderBase]: 2603/4612 cut-off events. [2023-08-24 12:48:02,609 INFO L125 PetriNetUnfolderBase]: For 3208/3208 co-relation queries the response was YES. [2023-08-24 12:48:02,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12792 conditions, 4612 events. 2603/4612 cut-off events. For 3208/3208 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 28609 event pairs, 181 based on Foata normal form. 477/4901 useless extension candidates. Maximal degree in co-relation 12303. Up to 2957 conditions per place. [2023-08-24 12:48:02,625 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 122 selfloop transitions, 3 changer transitions 0/134 dead transitions. [2023-08-24 12:48:02,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 134 transitions, 758 flow [2023-08-24 12:48:02,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 12:48:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 12:48:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1153 transitions. [2023-08-24 12:48:02,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4885593220338983 [2023-08-24 12:48:02,626 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1153 transitions. [2023-08-24 12:48:02,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1153 transitions. [2023-08-24 12:48:02,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:48:02,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1153 transitions. [2023-08-24 12:48:02,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 230.6) internal successors, (1153), 5 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states 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 12:48:02,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 472.0) internal successors, (2832), 6 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states 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 12:48:02,630 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 472.0) internal successors, (2832), 6 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states 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 12:48:02,630 INFO L175 Difference]: Start difference. First operand has 107 places, 113 transitions, 479 flow. Second operand 5 states and 1153 transitions. [2023-08-24 12:48:02,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 134 transitions, 758 flow [2023-08-24 12:48:02,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 134 transitions, 720 flow, removed 13 selfloop flow, removed 8 redundant places. [2023-08-24 12:48:02,637 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 253 flow [2023-08-24 12:48:02,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2023-08-24 12:48:02,637 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 8 predicate places. [2023-08-24 12:48:02,637 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 253 flow [2023-08-24 12:48:02,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 214.88888888888889) internal successors, (1934), 9 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states 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 12:48:02,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:48:02,638 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:48:02,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-24 12:48:02,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:48:02,843 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:48:02,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:48:02,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1997073712, now seen corresponding path program 1 times [2023-08-24 12:48:02,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:48:02,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886366398] [2023-08-24 12:48:02,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:02,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:48:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:48:02,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:48:02,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886366398] [2023-08-24 12:48:02,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886366398] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:48:02,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:48:02,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 12:48:02,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919027799] [2023-08-24 12:48:02,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:48:02,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 12:48:02,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:48:02,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 12:48:02,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 12:48:02,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 472 [2023-08-24 12:48:02,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 0 states have call successors, (0), 0 states 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 12:48:02,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:48:02,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 472 [2023-08-24 12:48:02,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:48:03,529 INFO L124 PetriNetUnfolderBase]: 4011/6749 cut-off events. [2023-08-24 12:48:03,529 INFO L125 PetriNetUnfolderBase]: For 5160/5160 co-relation queries the response was YES. [2023-08-24 12:48:03,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17861 conditions, 6749 events. 4011/6749 cut-off events. For 5160/5160 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 42518 event pairs, 1334 based on Foata normal form. 291/6719 useless extension candidates. Maximal degree in co-relation 7998. Up to 3488 conditions per place. [2023-08-24 12:48:03,554 INFO L140 encePairwiseOnDemand]: 456/472 looper letters, 101 selfloop transitions, 21 changer transitions 0/128 dead transitions. [2023-08-24 12:48:03,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 128 transitions, 709 flow [2023-08-24 12:48:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 12:48:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 12:48:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 982 transitions. [2023-08-24 12:48:03,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161016949152542 [2023-08-24 12:48:03,556 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 982 transitions. [2023-08-24 12:48:03,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 982 transitions. [2023-08-24 12:48:03,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:48:03,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 982 transitions. [2023-08-24 12:48:03,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 196.4) internal successors, (982), 5 states have internal predecessors, (982), 0 states have call successors, (0), 0 states 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 12:48:03,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 472.0) internal successors, (2832), 6 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states 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 12:48:03,560 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 472.0) internal successors, (2832), 6 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states 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 12:48:03,560 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 253 flow. Second operand 5 states and 982 transitions. [2023-08-24 12:48:03,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 128 transitions, 709 flow [2023-08-24 12:48:03,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 128 transitions, 700 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 12:48:03,565 INFO L231 Difference]: Finished difference. Result has 81 places, 85 transitions, 369 flow [2023-08-24 12:48:03,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=81, PETRI_TRANSITIONS=85} [2023-08-24 12:48:03,565 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 10 predicate places. [2023-08-24 12:48:03,565 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 85 transitions, 369 flow [2023-08-24 12:48:03,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 0 states have call successors, (0), 0 states 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 12:48:03,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:48:03,566 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:48:03,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-24 12:48:03,566 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:48:03,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:48:03,566 INFO L85 PathProgramCache]: Analyzing trace with hash -179879266, now seen corresponding path program 1 times [2023-08-24 12:48:03,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:48:03,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035972303] [2023-08-24 12:48:03,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:03,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:48:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:48:03,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:48:03,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035972303] [2023-08-24 12:48:03,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035972303] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:48:03,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:48:03,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 12:48:03,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501114001] [2023-08-24 12:48:03,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:48:03,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 12:48:03,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:48:03,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 12:48:03,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-24 12:48:03,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 472 [2023-08-24 12:48:03,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 85 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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 12:48:03,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:48:03,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 472 [2023-08-24 12:48:03,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:48:04,784 INFO L124 PetriNetUnfolderBase]: 7532/12824 cut-off events. [2023-08-24 12:48:04,784 INFO L125 PetriNetUnfolderBase]: For 10218/10242 co-relation queries the response was YES. [2023-08-24 12:48:04,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39031 conditions, 12824 events. 7532/12824 cut-off events. For 10218/10242 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 93704 event pairs, 3005 based on Foata normal form. 143/12249 useless extension candidates. Maximal degree in co-relation 28791. Up to 5955 conditions per place. [2023-08-24 12:48:04,822 INFO L140 encePairwiseOnDemand]: 458/472 looper letters, 175 selfloop transitions, 18 changer transitions 0/200 dead transitions. [2023-08-24 12:48:04,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 200 transitions, 1305 flow [2023-08-24 12:48:04,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:48:04,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:48:04,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1148 transitions. [2023-08-24 12:48:04,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053672316384181 [2023-08-24 12:48:04,824 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1148 transitions. [2023-08-24 12:48:04,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1148 transitions. [2023-08-24 12:48:04,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:48:04,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1148 transitions. [2023-08-24 12:48:04,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 191.33333333333334) internal successors, (1148), 6 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states 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 12:48:04,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 12:48:04,827 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 12:48:04,827 INFO L175 Difference]: Start difference. First operand has 81 places, 85 transitions, 369 flow. Second operand 6 states and 1148 transitions. [2023-08-24 12:48:04,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 200 transitions, 1305 flow [2023-08-24 12:48:04,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 200 transitions, 1304 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 12:48:04,833 INFO L231 Difference]: Finished difference. Result has 88 places, 100 transitions, 542 flow [2023-08-24 12:48:04,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=542, PETRI_PLACES=88, PETRI_TRANSITIONS=100} [2023-08-24 12:48:04,833 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 17 predicate places. [2023-08-24 12:48:04,833 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 100 transitions, 542 flow [2023-08-24 12:48:04,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states 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 12:48:04,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:48:04,834 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:48:04,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-24 12:48:04,834 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:48:04,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:48:04,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2016316820, now seen corresponding path program 2 times [2023-08-24 12:48:04,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:48:04,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127205626] [2023-08-24 12:48:04,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:04,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:48:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:05,077 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-24 12:48:05,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:48:05,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127205626] [2023-08-24 12:48:05,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127205626] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:48:05,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 12:48:05,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 12:48:05,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541945216] [2023-08-24 12:48:05,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:48:05,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 12:48:05,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:48:05,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 12:48:05,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-24 12:48:05,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 472 [2023-08-24 12:48:05,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 100 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 168.16666666666666) internal successors, (1009), 6 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states 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 12:48:05,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:48:05,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 472 [2023-08-24 12:48:05,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:48:06,573 INFO L124 PetriNetUnfolderBase]: 12704/21621 cut-off events. [2023-08-24 12:48:06,573 INFO L125 PetriNetUnfolderBase]: For 25046/25082 co-relation queries the response was YES. [2023-08-24 12:48:06,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71931 conditions, 21621 events. 12704/21621 cut-off events. For 25046/25082 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 168911 event pairs, 5877 based on Foata normal form. 171/20539 useless extension candidates. Maximal degree in co-relation 34812. Up to 12857 conditions per place. [2023-08-24 12:48:06,662 INFO L140 encePairwiseOnDemand]: 464/472 looper letters, 207 selfloop transitions, 19 changer transitions 0/232 dead transitions. [2023-08-24 12:48:06,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 232 transitions, 1715 flow [2023-08-24 12:48:06,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:48:06,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:48:06,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1122 transitions. [2023-08-24 12:48:06,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3961864406779661 [2023-08-24 12:48:06,665 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1122 transitions. [2023-08-24 12:48:06,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1122 transitions. [2023-08-24 12:48:06,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:48:06,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1122 transitions. [2023-08-24 12:48:06,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states 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 12:48:06,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 12:48:06,668 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 12:48:06,668 INFO L175 Difference]: Start difference. First operand has 88 places, 100 transitions, 542 flow. Second operand 6 states and 1122 transitions. [2023-08-24 12:48:06,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 232 transitions, 1715 flow [2023-08-24 12:48:06,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 232 transitions, 1705 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 12:48:06,680 INFO L231 Difference]: Finished difference. Result has 94 places, 114 transitions, 728 flow [2023-08-24 12:48:06,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=728, PETRI_PLACES=94, PETRI_TRANSITIONS=114} [2023-08-24 12:48:06,680 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 23 predicate places. [2023-08-24 12:48:06,680 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 114 transitions, 728 flow [2023-08-24 12:48:06,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 168.16666666666666) internal successors, (1009), 6 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states 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 12:48:06,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:48:06,681 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:48:06,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-24 12:48:06,681 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:48:06,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:48:06,681 INFO L85 PathProgramCache]: Analyzing trace with hash 319342669, now seen corresponding path program 1 times [2023-08-24 12:48:06,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:48:06,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966018797] [2023-08-24 12:48:06,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:06,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:48:06,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:48:07,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:48:07,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966018797] [2023-08-24 12:48:07,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966018797] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:48:07,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099184231] [2023-08-24 12:48:07,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:07,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:48:07,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:48:07,177 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:48:07,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-24 12:48:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:07,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-24 12:48:07,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:48:07,389 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 12:48:07,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:48:07,422 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 12:48:07,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:48:07,450 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 12:48:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:48:07,485 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:48:07,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099184231] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:48:07,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:48:07,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2023-08-24 12:48:07,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708871076] [2023-08-24 12:48:07,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:48:07,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:48:07,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:48:07,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:48:07,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-08-24 12:48:07,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 472 [2023-08-24 12:48:07,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 114 transitions, 728 flow. Second operand has 7 states, 7 states have (on average 174.71428571428572) internal successors, (1223), 7 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states 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 12:48:07,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:48:07,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 472 [2023-08-24 12:48:07,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:48:09,208 INFO L124 PetriNetUnfolderBase]: 12525/21591 cut-off events. [2023-08-24 12:48:09,208 INFO L125 PetriNetUnfolderBase]: For 32951/33035 co-relation queries the response was YES. [2023-08-24 12:48:09,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75527 conditions, 21591 events. 12525/21591 cut-off events. For 32951/33035 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 172955 event pairs, 5451 based on Foata normal form. 36/20364 useless extension candidates. Maximal degree in co-relation 50060. Up to 11667 conditions per place. [2023-08-24 12:48:09,322 INFO L140 encePairwiseOnDemand]: 465/472 looper letters, 211 selfloop transitions, 22 changer transitions 0/240 dead transitions. [2023-08-24 12:48:09,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 240 transitions, 1931 flow [2023-08-24 12:48:09,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:48:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:48:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1162 transitions. [2023-08-24 12:48:09,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4103107344632768 [2023-08-24 12:48:09,324 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1162 transitions. [2023-08-24 12:48:09,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1162 transitions. [2023-08-24 12:48:09,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:48:09,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1162 transitions. [2023-08-24 12:48:09,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 193.66666666666666) internal successors, (1162), 6 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states 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 12:48:09,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 12:48:09,327 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 12:48:09,327 INFO L175 Difference]: Start difference. First operand has 94 places, 114 transitions, 728 flow. Second operand 6 states and 1162 transitions. [2023-08-24 12:48:09,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 240 transitions, 1931 flow [2023-08-24 12:48:09,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 240 transitions, 1930 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 12:48:09,338 INFO L231 Difference]: Finished difference. Result has 100 places, 122 transitions, 874 flow [2023-08-24 12:48:09,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=874, PETRI_PLACES=100, PETRI_TRANSITIONS=122} [2023-08-24 12:48:09,338 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 29 predicate places. [2023-08-24 12:48:09,338 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 122 transitions, 874 flow [2023-08-24 12:48:09,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 174.71428571428572) internal successors, (1223), 7 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states 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 12:48:09,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:48:09,339 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:48:09,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-24 12:48:09,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:48:09,543 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:48:09,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:48:09,543 INFO L85 PathProgramCache]: Analyzing trace with hash 82656992, now seen corresponding path program 3 times [2023-08-24 12:48:09,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:48:09,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145153880] [2023-08-24 12:48:09,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:09,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:48:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:48:09,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:48:09,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145153880] [2023-08-24 12:48:09,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145153880] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:48:09,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700586162] [2023-08-24 12:48:09,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 12:48:09,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:48:09,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:48:09,954 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:48:09,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-24 12:48:10,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-24 12:48:10,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:48:10,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-24 12:48:10,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:48:10,195 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-24 12:48:10,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:48:10,233 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 12:48:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-24 12:48:10,253 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:48:10,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700586162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:48:10,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:48:10,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 13 [2023-08-24 12:48:10,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360822182] [2023-08-24 12:48:10,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:48:10,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:48:10,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:48:10,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:48:10,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-08-24 12:48:10,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 472 [2023-08-24 12:48:10,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 122 transitions, 874 flow. Second operand has 7 states, 7 states have (on average 174.57142857142858) internal successors, (1222), 7 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states 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 12:48:10,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:48:10,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 472 [2023-08-24 12:48:10,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:48:12,097 INFO L124 PetriNetUnfolderBase]: 12713/22013 cut-off events. [2023-08-24 12:48:12,097 INFO L125 PetriNetUnfolderBase]: For 42772/42838 co-relation queries the response was YES. [2023-08-24 12:48:12,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79260 conditions, 22013 events. 12713/22013 cut-off events. For 42772/42838 co-relation queries the response was YES. Maximal size of possible extension queue 948. Compared 176459 event pairs, 6570 based on Foata normal form. 90/20820 useless extension candidates. Maximal degree in co-relation 51997. Up to 13251 conditions per place. [2023-08-24 12:48:12,204 INFO L140 encePairwiseOnDemand]: 465/472 looper letters, 202 selfloop transitions, 19 changer transitions 0/228 dead transitions. [2023-08-24 12:48:12,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 228 transitions, 1924 flow [2023-08-24 12:48:12,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:48:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:48:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1157 transitions. [2023-08-24 12:48:12,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.408545197740113 [2023-08-24 12:48:12,206 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1157 transitions. [2023-08-24 12:48:12,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1157 transitions. [2023-08-24 12:48:12,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:48:12,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1157 transitions. [2023-08-24 12:48:12,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 192.83333333333334) internal successors, (1157), 6 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states 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 12:48:12,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 12:48:12,209 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 12:48:12,209 INFO L175 Difference]: Start difference. First operand has 100 places, 122 transitions, 874 flow. Second operand 6 states and 1157 transitions. [2023-08-24 12:48:12,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 228 transitions, 1924 flow [2023-08-24 12:48:12,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 228 transitions, 1908 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 12:48:12,226 INFO L231 Difference]: Finished difference. Result has 106 places, 127 transitions, 1001 flow [2023-08-24 12:48:12,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1001, PETRI_PLACES=106, PETRI_TRANSITIONS=127} [2023-08-24 12:48:12,227 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 35 predicate places. [2023-08-24 12:48:12,227 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 127 transitions, 1001 flow [2023-08-24 12:48:12,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 174.57142857142858) internal successors, (1222), 7 states have internal predecessors, (1222), 0 states have call successors, (0), 0 states 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 12:48:12,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:48:12,227 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:48:12,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-08-24 12:48:12,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-24 12:48:12,431 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:48:12,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:48:12,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1015768469, now seen corresponding path program 2 times [2023-08-24 12:48:12,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:48:12,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693648618] [2023-08-24 12:48:12,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:12,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:48:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:48:12,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:48:12,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693648618] [2023-08-24 12:48:12,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693648618] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:48:12,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237779052] [2023-08-24 12:48:12,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:48:12,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:48:12,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:48:12,893 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:48:12,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-24 12:48:12,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 12:48:12,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:48:12,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-24 12:48:13,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:48:13,060 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-24 12:48:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:48:13,077 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:48:13,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237779052] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:48:13,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:48:13,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2023-08-24 12:48:13,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042888270] [2023-08-24 12:48:13,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:48:13,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 12:48:13,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:48:13,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 12:48:13,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-08-24 12:48:13,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 472 [2023-08-24 12:48:13,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 127 transitions, 1001 flow. Second operand has 6 states, 6 states have (on average 181.16666666666666) internal successors, (1087), 6 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states 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 12:48:13,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:48:13,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 472 [2023-08-24 12:48:13,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:48:15,091 INFO L124 PetriNetUnfolderBase]: 12283/21214 cut-off events. [2023-08-24 12:48:15,091 INFO L125 PetriNetUnfolderBase]: For 44877/44952 co-relation queries the response was YES. [2023-08-24 12:48:15,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77655 conditions, 21214 events. 12283/21214 cut-off events. For 44877/44952 co-relation queries the response was YES. Maximal size of possible extension queue 944. Compared 170764 event pairs, 5471 based on Foata normal form. 63/20071 useless extension candidates. Maximal degree in co-relation 50223. Up to 11766 conditions per place. [2023-08-24 12:48:15,182 INFO L140 encePairwiseOnDemand]: 459/472 looper letters, 235 selfloop transitions, 49 changer transitions 0/291 dead transitions. [2023-08-24 12:48:15,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 291 transitions, 2513 flow [2023-08-24 12:48:15,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 12:48:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 12:48:15,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1420 transitions. [2023-08-24 12:48:15,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4297820823244552 [2023-08-24 12:48:15,184 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1420 transitions. [2023-08-24 12:48:15,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1420 transitions. [2023-08-24 12:48:15,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:48:15,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1420 transitions. [2023-08-24 12:48:15,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 202.85714285714286) internal successors, (1420), 7 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states 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 12:48:15,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 472.0) internal successors, (3776), 8 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states 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 12:48:15,187 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 472.0) internal successors, (3776), 8 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states 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 12:48:15,187 INFO L175 Difference]: Start difference. First operand has 106 places, 127 transitions, 1001 flow. Second operand 7 states and 1420 transitions. [2023-08-24 12:48:15,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 291 transitions, 2513 flow [2023-08-24 12:48:15,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 291 transitions, 2492 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 12:48:15,205 INFO L231 Difference]: Finished difference. Result has 113 places, 144 transitions, 1373 flow [2023-08-24 12:48:15,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1373, PETRI_PLACES=113, PETRI_TRANSITIONS=144} [2023-08-24 12:48:15,206 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 42 predicate places. [2023-08-24 12:48:15,206 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 144 transitions, 1373 flow [2023-08-24 12:48:15,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.16666666666666) internal successors, (1087), 6 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states 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 12:48:15,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:48:15,206 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:48:15,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-08-24 12:48:15,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:48:15,411 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:48:15,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:48:15,411 INFO L85 PathProgramCache]: Analyzing trace with hash 810098085, now seen corresponding path program 3 times [2023-08-24 12:48:15,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:48:15,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80625290] [2023-08-24 12:48:15,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:15,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:48:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:48:15,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:48:15,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80625290] [2023-08-24 12:48:15,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80625290] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:48:15,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111416387] [2023-08-24 12:48:15,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 12:48:15,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:48:15,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:48:15,818 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:48:15,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-24 12:48:15,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-24 12:48:15,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:48:15,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-24 12:48:15,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:48:16,025 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-24 12:48:16,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:48:16,059 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 12:48:16,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 12:48:16,078 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 12:48:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-24 12:48:16,096 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 12:48:16,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111416387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 12:48:16,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 12:48:16,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2023-08-24 12:48:16,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30818658] [2023-08-24 12:48:16,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 12:48:16,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 12:48:16,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:48:16,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 12:48:16,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-08-24 12:48:16,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 472 [2023-08-24 12:48:16,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 144 transitions, 1373 flow. Second operand has 7 states, 7 states have (on average 174.71428571428572) internal successors, (1223), 7 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states 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 12:48:16,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:48:16,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 472 [2023-08-24 12:48:16,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:48:18,010 INFO L124 PetriNetUnfolderBase]: 11638/20219 cut-off events. [2023-08-24 12:48:18,010 INFO L125 PetriNetUnfolderBase]: For 48963/49011 co-relation queries the response was YES. [2023-08-24 12:48:18,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74849 conditions, 20219 events. 11638/20219 cut-off events. For 48963/49011 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 160401 event pairs, 6907 based on Foata normal form. 36/19106 useless extension candidates. Maximal degree in co-relation 41041. Up to 11616 conditions per place. [2023-08-24 12:48:18,107 INFO L140 encePairwiseOnDemand]: 465/472 looper letters, 197 selfloop transitions, 17 changer transitions 0/221 dead transitions. [2023-08-24 12:48:18,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 221 transitions, 2033 flow [2023-08-24 12:48:18,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 12:48:18,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 12:48:18,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1159 transitions. [2023-08-24 12:48:18,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092514124293785 [2023-08-24 12:48:18,109 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1159 transitions. [2023-08-24 12:48:18,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1159 transitions. [2023-08-24 12:48:18,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:48:18,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1159 transitions. [2023-08-24 12:48:18,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 193.16666666666666) internal successors, (1159), 6 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states 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 12:48:18,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 12:48:18,112 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states 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 12:48:18,112 INFO L175 Difference]: Start difference. First operand has 113 places, 144 transitions, 1373 flow. Second operand 6 states and 1159 transitions. [2023-08-24 12:48:18,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 221 transitions, 2033 flow [2023-08-24 12:48:18,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 221 transitions, 1956 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-08-24 12:48:18,140 INFO L231 Difference]: Finished difference. Result has 115 places, 130 transitions, 1100 flow [2023-08-24 12:48:18,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1100, PETRI_PLACES=115, PETRI_TRANSITIONS=130} [2023-08-24 12:48:18,141 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 44 predicate places. [2023-08-24 12:48:18,141 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 130 transitions, 1100 flow [2023-08-24 12:48:18,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 174.71428571428572) internal successors, (1223), 7 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states 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 12:48:18,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:48:18,141 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 12:48:18,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-24 12:48:18,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:48:18,341 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:48:18,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:48:18,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1883479201, now seen corresponding path program 1 times [2023-08-24 12:48:18,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:48:18,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144166218] [2023-08-24 12:48:18,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:18,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:48:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:48:18,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:48:18,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144166218] [2023-08-24 12:48:18,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144166218] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:48:18,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828311427] [2023-08-24 12:48:18,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:48:18,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:48:18,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:48:18,876 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:48:18,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-24 12:48:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:48:19,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-24 12:48:19,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:48:19,007 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 7 treesize of output 6 [2023-08-24 12:48:19,071 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:48:19,072 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 12:48:19,092 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 13 treesize of output 15 [2023-08-24 12:48:19,176 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 24 treesize of output 17 [2023-08-24 12:48:19,228 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 25 [2023-08-24 12:48:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:48:19,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:48:25,321 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of2ForFork0_cache_entry_addref_#t~mem37#1| (- 1)))) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) is different from false [2023-08-24 12:48:27,326 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) is different from false [2023-08-24 12:48:29,334 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_67| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of2ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_67|) 0)) is different from false [2023-08-24 12:48:31,372 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1172 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1172) |c_~#cache~0.base|) |t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-24 12:48:31,432 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-24 12:48:31,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828311427] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:48:31,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:48:31,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2023-08-24 12:48:31,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192250201] [2023-08-24 12:48:31,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:48:31,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-24 12:48:31,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:48:31,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-24 12:48:31,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=332, Unknown=5, NotChecked=164, Total=600 [2023-08-24 12:48:31,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 472 [2023-08-24 12:48:31,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 130 transitions, 1100 flow. Second operand has 25 states, 25 states have (on average 163.28) internal successors, (4082), 25 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states 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 12:48:31,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:48:31,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 472 [2023-08-24 12:48:31,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:48:41,737 WARN L234 SmtUtils]: Spent 10.05s on a formula simplification. DAG size of input: 53 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:49:11,821 WARN L234 SmtUtils]: Spent 30.04s on a formula simplification. DAG size of input: 44 DAG size of output: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:49:13,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:15,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:17,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:19,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:21,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:23,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:25,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:27,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:29,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:32,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:34,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:36,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:38,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:40,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:42,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:44,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:46,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:48,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:50,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:52,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:56,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:49:59,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:50:03,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:50:05,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:50:07,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:50:09,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:50:11,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:50:13,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:50:15,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:50:17,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:50:19,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:50:57,944 WARN L234 SmtUtils]: Spent 38.05s on a formula simplification. DAG size of input: 46 DAG size of output: 29 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:50:59,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:01,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:03,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:05,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:07,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:09,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:11,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:13,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:15,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:18,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:20,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:23,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:25,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:27,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:29,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:31,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:33,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:35,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:37,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:39,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:41,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:43,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:45,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:47,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:49,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:51,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:53,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:55,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:57,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:51:59,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:01,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:07,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:12,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:14,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:16,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:18,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:20,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:22,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:24,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:26,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:28,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:30,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:32,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:34,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:36,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:38,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:40,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:42,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:44,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:46,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:48,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:50,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:52,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:54,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:56,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:52:58,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:00,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:02,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:04,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:06,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:08,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:10,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:12,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:14,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:16,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:18,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:20,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:22,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:32,766 WARN L234 SmtUtils]: Spent 10.03s on a formula simplification. DAG size of input: 40 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:53:34,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:36,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:38,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:40,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:42,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:44,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:46,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:48,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:51,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:53,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:55,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:57,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:53:59,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:01,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:03,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:05,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:07,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:09,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:11,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:13,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:15,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:17,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:19,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:21,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:23,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:25,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:27,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:29,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:31,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:33,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:35,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:37,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:39,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:41,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:43,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:45,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:48,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:50,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:52,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:54,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:56,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:54:58,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:00,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:02,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:04,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:06,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:08,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:10,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:12,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:14,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:16,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:18,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:20,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:22,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:24,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:26,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:28,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:30,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:32,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:34,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:36,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:38,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:40,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:42,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:44,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:46,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:48,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:50,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:52,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:54,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:56,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:55:58,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:56:01,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:56:03,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:56:08,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:56:11,875 INFO L124 PetriNetUnfolderBase]: 18613/32102 cut-off events. [2023-08-24 12:56:11,875 INFO L125 PetriNetUnfolderBase]: For 72413/72497 co-relation queries the response was YES. [2023-08-24 12:56:11,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119069 conditions, 32102 events. 18613/32102 cut-off events. For 72413/72497 co-relation queries the response was YES. Maximal size of possible extension queue 1445. Compared 268524 event pairs, 3379 based on Foata normal form. 159/30545 useless extension candidates. Maximal degree in co-relation 101264. Up to 15363 conditions per place. [2023-08-24 12:56:12,056 INFO L140 encePairwiseOnDemand]: 446/472 looper letters, 403 selfloop transitions, 122 changer transitions 0/533 dead transitions. [2023-08-24 12:56:12,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 533 transitions, 5573 flow [2023-08-24 12:56:12,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-24 12:56:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-24 12:56:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3002 transitions. [2023-08-24 12:56:12,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37412761714855436 [2023-08-24 12:56:12,059 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3002 transitions. [2023-08-24 12:56:12,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3002 transitions. [2023-08-24 12:56:12,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:56:12,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3002 transitions. [2023-08-24 12:56:12,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 176.58823529411765) internal successors, (3002), 17 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states 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 12:56:12,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 472.0) internal successors, (8496), 18 states have internal predecessors, (8496), 0 states have call successors, (0), 0 states 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 12:56:12,066 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 472.0) internal successors, (8496), 18 states have internal predecessors, (8496), 0 states have call successors, (0), 0 states 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 12:56:12,066 INFO L175 Difference]: Start difference. First operand has 115 places, 130 transitions, 1100 flow. Second operand 17 states and 3002 transitions. [2023-08-24 12:56:12,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 533 transitions, 5573 flow [2023-08-24 12:56:12,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 533 transitions, 5498 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 12:56:12,114 INFO L231 Difference]: Finished difference. Result has 135 places, 247 transitions, 2500 flow [2023-08-24 12:56:12,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1076, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2500, PETRI_PLACES=135, PETRI_TRANSITIONS=247} [2023-08-24 12:56:12,114 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 64 predicate places. [2023-08-24 12:56:12,115 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 247 transitions, 2500 flow [2023-08-24 12:56:12,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 163.28) internal successors, (4082), 25 states have internal predecessors, (4082), 0 states have call successors, (0), 0 states 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 12:56:12,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:56:12,115 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 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 12:56:12,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-24 12:56:12,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:56:12,315 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:56:12,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:56:12,316 INFO L85 PathProgramCache]: Analyzing trace with hash 665443754, now seen corresponding path program 1 times [2023-08-24 12:56:12,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:56:12,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105684898] [2023-08-24 12:56:12,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:56:12,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:56:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:56:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:56:13,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:56:13,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105684898] [2023-08-24 12:56:13,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105684898] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:56:13,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258416332] [2023-08-24 12:56:13,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:56:13,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:56:13,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:56:13,160 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:56:13,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-24 12:56:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:56:13,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-24 12:56:13,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:56:13,283 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 7 treesize of output 6 [2023-08-24 12:56:13,335 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:56:13,335 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 12:56:13,362 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 13 treesize of output 15 [2023-08-24 12:56:13,448 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 18 treesize of output 13 [2023-08-24 12:56:13,500 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 12:56:13,543 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 16 [2023-08-24 12:56:16,961 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:56:16,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:56:32,981 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-24 12:56:34,997 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1276 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1276)) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-24 12:56:35,011 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1276 Int) (v_ArrVal_1275 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1275))) (store .cse0 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1276))) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-24 12:56:35,028 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1273 Int) (v_ArrVal_1276 Int) (v_ArrVal_1275 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| Int)) (or (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1273)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1275))) (store .cse0 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1276))) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-24 12:56:35,056 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1273 Int) (v_ArrVal_1276 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (v_ArrVal_1275 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_72| 28)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_1273)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1275) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_1276) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71|) 0))) is different from false [2023-08-24 12:56:35,081 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1273 Int) (v_ArrVal_1276 Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_72| Int) (v_ArrVal_1275 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| Int) (v_ArrVal_1272 (Array Int Int))) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71| (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_72| 28)) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1272))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_1273))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1275) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_72| v_ArrVal_1276) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_71|) 0))) is different from false [2023-08-24 12:56:35,200 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-24 12:56:35,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258416332] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:56:35,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:56:35,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 26 [2023-08-24 12:56:35,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363541143] [2023-08-24 12:56:35,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:56:35,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-24 12:56:35,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:56:35,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-24 12:56:35,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=386, Unknown=16, NotChecked=270, Total=756 [2023-08-24 12:56:35,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 472 [2023-08-24 12:56:35,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 247 transitions, 2500 flow. Second operand has 28 states, 28 states have (on average 167.14285714285714) internal successors, (4680), 28 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states 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 12:56:35,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:56:35,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 472 [2023-08-24 12:56:35,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:56:36,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:56:38,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:56:39,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:56:41,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:56:43,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:56:44,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:56:47,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:56:50,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:56:51,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:56:53,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:56:54,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:56:56,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:56:57,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:56:58,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:56:59,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:06,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:16,407 WARN L234 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 65 DAG size of output: 29 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:57:17,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:18,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:19,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:23,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:24,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:30,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:31,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:33,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:34,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:35,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:43,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:46,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:47,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:54,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:55,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:57,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:58,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:57:59,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:58:00,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:58:07,050 INFO L124 PetriNetUnfolderBase]: 35898/62295 cut-off events. [2023-08-24 12:58:07,050 INFO L125 PetriNetUnfolderBase]: For 310486/310805 co-relation queries the response was YES. [2023-08-24 12:58:07,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319596 conditions, 62295 events. 35898/62295 cut-off events. For 310486/310805 co-relation queries the response was YES. Maximal size of possible extension queue 2443. Compared 564243 event pairs, 5589 based on Foata normal form. 308/59220 useless extension candidates. Maximal degree in co-relation 262944. Up to 24660 conditions per place. [2023-08-24 12:58:07,562 INFO L140 encePairwiseOnDemand]: 451/472 looper letters, 902 selfloop transitions, 209 changer transitions 0/1119 dead transitions. [2023-08-24 12:58:07,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 1119 transitions, 13871 flow [2023-08-24 12:58:07,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-24 12:58:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-24 12:58:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4195 transitions. [2023-08-24 12:58:07,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3864222549742078 [2023-08-24 12:58:07,566 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4195 transitions. [2023-08-24 12:58:07,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4195 transitions. [2023-08-24 12:58:07,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:58:07,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4195 transitions. [2023-08-24 12:58:07,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 182.3913043478261) internal successors, (4195), 23 states have internal predecessors, (4195), 0 states have call successors, (0), 0 states 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 12:58:07,575 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 472.0) internal successors, (11328), 24 states have internal predecessors, (11328), 0 states have call successors, (0), 0 states 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 12:58:07,575 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 472.0) internal successors, (11328), 24 states have internal predecessors, (11328), 0 states have call successors, (0), 0 states 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 12:58:07,575 INFO L175 Difference]: Start difference. First operand has 135 places, 247 transitions, 2500 flow. Second operand 23 states and 4195 transitions. [2023-08-24 12:58:07,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 1119 transitions, 13871 flow [2023-08-24 12:58:08,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 1119 transitions, 13331 flow, removed 241 selfloop flow, removed 4 redundant places. [2023-08-24 12:58:09,000 INFO L231 Difference]: Finished difference. Result has 167 places, 441 transitions, 5155 flow [2023-08-24 12:58:09,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=2332, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=5155, PETRI_PLACES=167, PETRI_TRANSITIONS=441} [2023-08-24 12:58:09,001 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 96 predicate places. [2023-08-24 12:58:09,001 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 441 transitions, 5155 flow [2023-08-24 12:58:09,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 167.14285714285714) internal successors, (4680), 28 states have internal predecessors, (4680), 0 states have call successors, (0), 0 states 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 12:58:09,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:58:09,002 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 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 12:58:09,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-24 12:58:09,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-24 12:58:09,202 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:58:09,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:58:09,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1787927150, now seen corresponding path program 2 times [2023-08-24 12:58:09,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:58:09,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258811395] [2023-08-24 12:58:09,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:58:09,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:58:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:58:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:58:09,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:58:09,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258811395] [2023-08-24 12:58:09,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258811395] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:58:09,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336490083] [2023-08-24 12:58:09,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 12:58:09,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:58:09,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:58:09,973 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:58:09,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-24 12:58:10,095 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 12:58:10,095 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 12:58:10,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-24 12:58:10,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:58:10,102 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 7 treesize of output 6 [2023-08-24 12:58:10,160 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:58:10,160 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 12:58:10,182 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 13 treesize of output 15 [2023-08-24 12:58:10,265 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 18 treesize of output 13 [2023-08-24 12:58:10,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 16 [2023-08-24 12:58:12,759 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 12:58:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:58:12,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:58:14,845 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1378 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75| Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1378) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75|) 0))) is different from false [2023-08-24 12:58:16,856 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1378 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75| Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1378) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75|) 0))) is different from false [2023-08-24 12:58:18,874 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 Int) (v_ArrVal_1378 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75| Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75| (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1376)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1378) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75|) 0))) is different from false [2023-08-24 12:58:18,926 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 Int) (v_ArrVal_1378 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_76| v_ArrVal_1376)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1378) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75|) 0) (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75| (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_76| 28)))) is different from false [2023-08-24 12:58:18,942 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 Int) (v_ArrVal_1378 (Array Int Int)) (v_ArrVal_1373 (Array Int Int)) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_76| Int) (|v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75| Int)) (or (< |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75| (+ |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_76| 28)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1373))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_76| v_ArrVal_1376))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1378) |c_~#cache~0.base|) |v_t_funThread1of2ForFork0_cache_entry_addref_~entry#1.offset_75|) 0))) is different from false [2023-08-24 12:58:19,053 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-24 12:58:19,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336490083] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:58:19,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:58:19,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 25 [2023-08-24 12:58:19,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298492546] [2023-08-24 12:58:19,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:58:19,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-24 12:58:19,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:58:19,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-24 12:58:19,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=390, Unknown=17, NotChecked=220, Total=702 [2023-08-24 12:58:19,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 472 [2023-08-24 12:58:19,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 441 transitions, 5155 flow. Second operand has 27 states, 27 states have (on average 167.2962962962963) internal successors, (4517), 27 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states 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 12:58:19,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:58:19,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 472 [2023-08-24 12:58:19,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:58:20,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:58:22,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:58:31,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:58:36,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:58:37,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:58:43,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:58:48,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:58:51,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-24 12:59:15,027 INFO L124 PetriNetUnfolderBase]: 42835/73476 cut-off events. [2023-08-24 12:59:15,027 INFO L125 PetriNetUnfolderBase]: For 670258/670630 co-relation queries the response was YES. [2023-08-24 12:59:15,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451706 conditions, 73476 events. 42835/73476 cut-off events. For 670258/670630 co-relation queries the response was YES. Maximal size of possible extension queue 2691. Compared 666775 event pairs, 8207 based on Foata normal form. 191/69573 useless extension candidates. Maximal degree in co-relation 411594. Up to 30350 conditions per place. [2023-08-24 12:59:15,995 INFO L140 encePairwiseOnDemand]: 460/472 looper letters, 811 selfloop transitions, 178 changer transitions 0/997 dead transitions. [2023-08-24 12:59:15,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 997 transitions, 13498 flow [2023-08-24 12:59:15,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-24 12:59:15,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-24 12:59:15,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3798 transitions. [2023-08-24 12:59:15,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3831719128329298 [2023-08-24 12:59:15,998 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3798 transitions. [2023-08-24 12:59:15,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3798 transitions. [2023-08-24 12:59:15,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 12:59:15,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3798 transitions. [2023-08-24 12:59:16,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 180.85714285714286) internal successors, (3798), 21 states have internal predecessors, (3798), 0 states have call successors, (0), 0 states 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 12:59:16,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 472.0) internal successors, (10384), 22 states have internal predecessors, (10384), 0 states have call successors, (0), 0 states 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 12:59:16,006 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 472.0) internal successors, (10384), 22 states have internal predecessors, (10384), 0 states have call successors, (0), 0 states 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 12:59:16,006 INFO L175 Difference]: Start difference. First operand has 167 places, 441 transitions, 5155 flow. Second operand 21 states and 3798 transitions. [2023-08-24 12:59:16,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 997 transitions, 13498 flow [2023-08-24 12:59:18,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 997 transitions, 13402 flow, removed 47 selfloop flow, removed 1 redundant places. [2023-08-24 12:59:18,282 INFO L231 Difference]: Finished difference. Result has 197 places, 498 transitions, 6341 flow [2023-08-24 12:59:18,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=5067, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=6341, PETRI_PLACES=197, PETRI_TRANSITIONS=498} [2023-08-24 12:59:18,283 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 126 predicate places. [2023-08-24 12:59:18,283 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 498 transitions, 6341 flow [2023-08-24 12:59:18,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 167.2962962962963) internal successors, (4517), 27 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states 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 12:59:18,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 12:59:18,284 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 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 12:59:18,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-08-24 12:59:18,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-24 12:59:18,488 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-24 12:59:18,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 12:59:18,488 INFO L85 PathProgramCache]: Analyzing trace with hash -377570882, now seen corresponding path program 1 times [2023-08-24 12:59:18,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 12:59:18,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917783752] [2023-08-24 12:59:18,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:59:18,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 12:59:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:59:19,344 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-24 12:59:19,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 12:59:19,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917783752] [2023-08-24 12:59:19,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917783752] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 12:59:19,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893134694] [2023-08-24 12:59:19,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 12:59:19,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 12:59:19,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 12:59:19,345 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 12:59:19,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-24 12:59:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 12:59:19,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-24 12:59:19,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 12:59:19,480 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 7 treesize of output 6 [2023-08-24 12:59:19,536 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 12:59:19,537 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-24 12:59:19,558 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 13 treesize of output 15 [2023-08-24 12:59:19,575 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 13 treesize of output 15 [2023-08-24 12:59:19,652 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 24 treesize of output 17 [2023-08-24 12:59:19,707 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 25 [2023-08-24 12:59:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-24 12:59:19,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 12:59:27,815 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread2of2ForFork0_cache_entry_addref_#t~post38#1|))) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_59|) 0)) is different from false [2023-08-24 12:59:29,819 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_59|) 0)) is different from false [2023-08-24 12:59:31,826 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (= 0 (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread2of2ForFork0_cache_entry_addref_#t~mem34#1|)) |c_~#cache~0.base|) |v_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset_59|))) is different from false [2023-08-24 12:59:35,865 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1475 (Array Int Int)) (|t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1475) |c_~#cache~0.base|) |t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset|))) is different from false [2023-08-24 12:59:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 57 trivial. 1 not checked. [2023-08-24 12:59:35,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893134694] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 12:59:35,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 12:59:35,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 25 [2023-08-24 12:59:35,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771684159] [2023-08-24 12:59:35,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 12:59:35,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-24 12:59:35,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 12:59:35,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-24 12:59:35,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=428, Unknown=6, NotChecked=180, Total=702 [2023-08-24 12:59:35,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 472 [2023-08-24 12:59:35,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 498 transitions, 6341 flow. Second operand has 27 states, 27 states have (on average 163.66666666666666) internal successors, (4419), 27 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states 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 12:59:35,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 12:59:35,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 472 [2023-08-24 12:59:35,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 12:59:50,024 WARN L234 SmtUtils]: Spent 14.03s on a formula simplification. DAG size of input: 31 DAG size of output: 24 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 12:59:52,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:59:54,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:59:56,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 12:59:58,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:00,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:02,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:04,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:06,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:08,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:10,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:12,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:14,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:16,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:32,185 WARN L234 SmtUtils]: Spent 16.04s on a formula simplification. DAG size of input: 43 DAG size of output: 24 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:00:34,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:36,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:38,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:40,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:42,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-08-24 13:00:44,139 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 13:00:44,151 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 13:00:44,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 13:00:45,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-24 13:00:45,340 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-24 13:00:45,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-24 13:00:45,363 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 13:00:45,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-08-24 13:00:45,364 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-24 13:00:45,364 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-24 13:00:45,364 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-24 13:00:45,364 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-24 13:00:45,364 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:00:45,364 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-24 13:00:45,365 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-24 13:00:45,365 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 13:00:45,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 01:00:45 BasicIcfg [2023-08-24 13:00:45,369 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 13:00:45,369 INFO L158 Benchmark]: Toolchain (without parser) took 864312.72ms. Allocated memory was 388.0MB in the beginning and 9.1GB in the end (delta: 8.7GB). Free memory was 362.1MB in the beginning and 5.5GB in the end (delta: -5.2GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. [2023-08-24 13:00:45,369 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 388.0MB. Free memory is still 364.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 13:00:45,369 INFO L158 Benchmark]: CACSL2BoogieTranslator took 473.23ms. Allocated memory is still 388.0MB. Free memory was 362.1MB in the beginning and 332.8MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-24 13:00:45,369 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.74ms. Allocated memory is still 388.0MB. Free memory was 332.8MB in the beginning and 330.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 13:00:45,369 INFO L158 Benchmark]: Boogie Preprocessor took 29.62ms. Allocated memory is still 388.0MB. Free memory was 329.8MB in the beginning and 328.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 13:00:45,369 INFO L158 Benchmark]: RCFGBuilder took 459.07ms. Allocated memory is still 388.0MB. Free memory was 328.0MB in the beginning and 309.0MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-24 13:00:45,369 INFO L158 Benchmark]: TraceAbstraction took 863273.58ms. Allocated memory was 388.0MB in the beginning and 9.1GB in the end (delta: 8.7GB). Free memory was 364.3MB in the beginning and 5.5GB in the end (delta: -5.2GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. [2023-08-24 13:00:45,370 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.10ms. Allocated memory is still 388.0MB. Free memory is still 364.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 473.23ms. Allocated memory is still 388.0MB. Free memory was 362.1MB in the beginning and 332.8MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.74ms. Allocated memory is still 388.0MB. Free memory was 332.8MB in the beginning and 330.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.62ms. Allocated memory is still 388.0MB. Free memory was 329.8MB in the beginning and 328.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 459.07ms. Allocated memory is still 388.0MB. Free memory was 328.0MB in the beginning and 309.0MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 863273.58ms. Allocated memory was 388.0MB in the beginning and 9.1GB in the end (delta: 8.7GB). Free memory was 364.3MB in the beginning and 5.5GB in the end (delta: -5.2GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 736]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [736] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 161 PlacesBefore, 46 PlacesAfterwards, 190 TransitionsBefore, 70 TransitionsAfterwards, 12282 CoEnabledTransitionPairs, 6 FixpointIterations, 26 TrivialSequentialCompositions, 98 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 22 ConcurrentYvCompositions, 5 ChoiceCompositions, 153 TotalNumberOfCompositions, 18484 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10107, independent: 9842, independent conditional: 0, independent unconditional: 9842, dependent: 265, dependent conditional: 0, dependent unconditional: 265, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6267, independent: 6203, independent conditional: 0, independent unconditional: 6203, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10107, independent: 3639, independent conditional: 0, independent unconditional: 3639, dependent: 201, dependent conditional: 0, dependent unconditional: 201, unknown: 6267, unknown conditional: 0, unknown unconditional: 6267] , Statistics on independence cache: Total cache size (in pairs): 236, Positive cache size: 212, Positive conditional cache size: 0, Positive unconditional cache size: 212, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 161 PlacesBefore, 46 PlacesAfterwards, 190 TransitionsBefore, 70 TransitionsAfterwards, 12282 CoEnabledTransitionPairs, 6 FixpointIterations, 26 TrivialSequentialCompositions, 100 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 22 ConcurrentYvCompositions, 5 ChoiceCompositions, 155 TotalNumberOfCompositions, 18947 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9448, independent: 9176, independent conditional: 0, independent unconditional: 9176, dependent: 272, dependent conditional: 0, dependent unconditional: 272, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6152, independent: 6089, independent conditional: 0, independent unconditional: 6089, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9448, independent: 3087, independent conditional: 0, independent unconditional: 3087, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 6152, unknown conditional: 0, unknown unconditional: 6152] , Statistics on independence cache: Total cache size (in pairs): 157, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 223 PlacesBefore, 71 PlacesAfterwards, 266 TransitionsBefore, 106 TransitionsAfterwards, 35604 CoEnabledTransitionPairs, 6 FixpointIterations, 26 TrivialSequentialCompositions, 137 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 33 ConcurrentYvCompositions, 8 ChoiceCompositions, 206 TotalNumberOfCompositions, 58078 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29231, independent: 28805, independent conditional: 0, independent unconditional: 28805, dependent: 426, dependent conditional: 0, dependent unconditional: 426, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 17359, independent: 17266, independent conditional: 0, independent unconditional: 17266, dependent: 93, dependent conditional: 0, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 29231, independent: 11539, independent conditional: 0, independent unconditional: 11539, dependent: 333, dependent conditional: 0, dependent unconditional: 333, unknown: 17359, unknown conditional: 0, unknown unconditional: 17359] , Statistics on independence cache: Total cache size (in pairs): 780, Positive cache size: 738, Positive conditional cache size: 0, Positive unconditional cache size: 738, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 929]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 219 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: 78.3s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 29.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 304 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 304 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 284 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1238 IncrementalHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 1 mSDtfsCounter, 1238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 150 SyntacticMatches, 7 SemanticMatches, 94 ConstructedPredicates, 6 IntricatePredicates, 3 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 69.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=6, InterpolantAutomatonStates: 56, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 44.3s InterpolantComputationTime, 229 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 302 ConstructedInterpolants, 55 QuantifiedInterpolants, 4518 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1000 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 355/403 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 275 locations, 5 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: 782.1s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 703.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.4s, HoareTripleCheckerStatistics: 307 mSolverCounterUnknown, 3438 SdHoareTripleChecker+Valid, 470.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3438 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 469.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5069 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8267 IncrementalHoareTripleChecker+Invalid, 13896 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 252 mSolverCounterUnsat, 4 mSDtfsCounter, 8267 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 771 GetRequests, 464 SyntacticMatches, 30 SemanticMatches, 277 ConstructedPredicates, 19 IntricatePredicates, 5 DeprecatedPredicates, 1710 ImplicationChecksByTransitivity, 255.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6341occurred in iteration=17, InterpolantAutomatonStates: 147, 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, 0.4s SatisfiabilityAnalysisTime, 72.2s InterpolantComputationTime, 811 NumberOfCodeBlocks, 765 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 982 ConstructedInterpolants, 173 QuantifiedInterpolants, 17294 SizeOfPredicates, 98 NumberOfNonLiveVariables, 2686 ConjunctsInSsa, 333 ConjunctsInUnsatCore, 40 InterpolantComputations, 10 PerfectInterpolantSequences, 1645/1735 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 3 procedures, 219 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: 2.8s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 284 IncrementalHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=3, InterpolantAutomatonStates: 21, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 14/47 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