/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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 11:45:47,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 11:45:47,790 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-27 11:45:47,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 11:45:47,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 11:45:47,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 11:45:47,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 11:45:47,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 11:45:47,822 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 11:45:47,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 11:45:47,826 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 11:45:47,826 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 11:45:47,826 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 11:45:47,827 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 11:45:47,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 11:45:47,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 11:45:47,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 11:45:47,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 11:45:47,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 11:45:47,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 11:45:47,829 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 11:45:47,830 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 11:45:47,830 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 11:45:47,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 11:45:47,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 11:45:47,831 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 11:45:47,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 11:45:47,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 11:45:47,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 11:45:47,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 11:45:47,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 11:45:47,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 11:45:47,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 11:45:47,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 11:45:47,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 11:45:47,834 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 11:45:48,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 11:45:48,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 11:45:48,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 11:45:48,179 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 11:45:48,179 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 11:45:48,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-08-27 11:45:49,374 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 11:45:49,695 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 11:45:49,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_74-tricky_address1_racefree.i [2023-08-27 11:45:49,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1089cfa93/a95d2acd6d64436db727038aa40b3be8/FLAGf4b665ee4 [2023-08-27 11:45:49,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1089cfa93/a95d2acd6d64436db727038aa40b3be8 [2023-08-27 11:45:49,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 11:45:49,735 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 11:45:49,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 11:45:49,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 11:45:49,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 11:45:49,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:45:49" (1/1) ... [2023-08-27 11:45:49,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba5b489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:45:49, skipping insertion in model container [2023-08-27 11:45:49,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:45:49" (1/1) ... [2023-08-27 11:45:49,778 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 11:45:50,251 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 11:45:50,275 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 11:45:50,301 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-27 11:45:50,302 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-27 11:45:50,308 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-27 11:45:50,346 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 11:45:50,411 INFO L206 MainTranslator]: Completed translation [2023-08-27 11:45:50,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:45:50 WrapperNode [2023-08-27 11:45:50,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 11:45:50,413 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 11:45:50,413 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 11:45:50,413 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 11:45:50,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:45:50" (1/1) ... [2023-08-27 11:45:50,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:45:50" (1/1) ... [2023-08-27 11:45:50,487 INFO L138 Inliner]: procedures = 270, calls = 42, calls flagged for inlining = 7, calls inlined = 8, statements flattened = 213 [2023-08-27 11:45:50,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 11:45:50,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 11:45:50,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 11:45:50,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 11:45:50,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:45:50" (1/1) ... [2023-08-27 11:45:50,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:45:50" (1/1) ... [2023-08-27 11:45:50,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:45:50" (1/1) ... [2023-08-27 11:45:50,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:45:50" (1/1) ... [2023-08-27 11:45:50,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:45:50" (1/1) ... [2023-08-27 11:45:50,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:45:50" (1/1) ... [2023-08-27 11:45:50,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:45:50" (1/1) ... [2023-08-27 11:45:50,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:45:50" (1/1) ... [2023-08-27 11:45:50,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 11:45:50,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 11:45:50,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 11:45:50,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 11:45:50,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:45:50" (1/1) ... [2023-08-27 11:45:50,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 11:45:50,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:45:50,570 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-27 11:45:50,585 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-27 11:45:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 11:45:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 11:45:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 11:45:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 11:45:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-27 11:45:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 11:45:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-27 11:45:50,607 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-27 11:45:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 11:45:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 11:45:50,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 11:45:50,609 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 11:45:50,725 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 11:45:50,726 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 11:45:51,014 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 11:45:51,021 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 11:45:51,021 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-27 11:45:51,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:45:51 BoogieIcfgContainer [2023-08-27 11:45:51,023 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 11:45:51,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 11:45:51,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 11:45:51,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 11:45:51,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 11:45:49" (1/3) ... [2023-08-27 11:45:51,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3d6f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:45:51, skipping insertion in model container [2023-08-27 11:45:51,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:45:50" (2/3) ... [2023-08-27 11:45:51,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3d6f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:45:51, skipping insertion in model container [2023-08-27 11:45:51,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:45:51" (3/3) ... [2023-08-27 11:45:51,029 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_74-tricky_address1_racefree.i [2023-08-27 11:45:51,044 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 11:45:51,044 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-08-27 11:45:51,044 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 11:45:51,105 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-27 11:45:51,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 229 transitions, 466 flow [2023-08-27 11:45:51,217 INFO L124 PetriNetUnfolderBase]: 48/313 cut-off events. [2023-08-27 11:45:51,217 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-27 11:45:51,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 313 events. 48/313 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1123 event pairs, 0 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 173. Up to 8 conditions per place. [2023-08-27 11:45:51,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 229 transitions, 466 flow [2023-08-27 11:45:51,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 226 transitions, 460 flow [2023-08-27 11:45:51,240 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 11:45:51,254 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 226 transitions, 460 flow [2023-08-27 11:45:51,260 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 226 transitions, 460 flow [2023-08-27 11:45:51,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 226 transitions, 460 flow [2023-08-27 11:45:51,303 INFO L124 PetriNetUnfolderBase]: 47/310 cut-off events. [2023-08-27 11:45:51,304 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-27 11:45:51,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 310 events. 47/310 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1122 event pairs, 0 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 173. Up to 8 conditions per place. [2023-08-27 11:45:51,313 INFO L119 LiptonReduction]: Number of co-enabled transitions 15040 [2023-08-27 11:45:54,647 INFO L134 LiptonReduction]: Checked pairs total: 23492 [2023-08-27 11:45:54,647 INFO L136 LiptonReduction]: Total number of compositions: 207 [2023-08-27 11:45:54,659 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 11:45:54,665 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;@700d1232, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 11:45:54,665 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-08-27 11:45:54,666 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 11:45:54,667 INFO L124 PetriNetUnfolderBase]: 1/2 cut-off events. [2023-08-27 11:45:54,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 11:45:54,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:45:54,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-27 11:45:54,668 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-08-27 11:45:54,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:45:54,672 INFO L85 PathProgramCache]: Analyzing trace with hash 28997, now seen corresponding path program 1 times [2023-08-27 11:45:54,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:45:54,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10877840] [2023-08-27 11:45:54,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:45:54,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:45:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:45:54,891 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-27 11:45:54,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:45:54,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10877840] [2023-08-27 11:45:54,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10877840] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:45:54,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:45:54,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 11:45:54,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287815323] [2023-08-27 11:45:54,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:45:54,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:45:54,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:45:54,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:45:54,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:45:54,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 436 [2023-08-27 11:45:54,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 82 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:54,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:45:54,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 436 [2023-08-27 11:45:54,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:45:55,154 INFO L124 PetriNetUnfolderBase]: 521/1093 cut-off events. [2023-08-27 11:45:55,154 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-27 11:45:55,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2125 conditions, 1093 events. 521/1093 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5985 event pairs, 475 based on Foata normal form. 118/858 useless extension candidates. Maximal degree in co-relation 2053. Up to 1025 conditions per place. [2023-08-27 11:45:55,165 INFO L140 encePairwiseOnDemand]: 408/436 looper letters, 51 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-27 11:45:55,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 232 flow [2023-08-27 11:45:55,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:45:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:45:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 644 transitions. [2023-08-27 11:45:55,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4923547400611621 [2023-08-27 11:45:55,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 644 transitions. [2023-08-27 11:45:55,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 644 transitions. [2023-08-27 11:45:55,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:45:55,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 644 transitions. [2023-08-27 11:45:55,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-27 11:45:55,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:55,201 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:55,203 INFO L175 Difference]: Start difference. First operand has 60 places, 82 transitions, 172 flow. Second operand 3 states and 644 transitions. [2023-08-27 11:45:55,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 232 flow [2023-08-27 11:45:55,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 232 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 11:45:55,208 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 138 flow [2023-08-27 11:45:55,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2023-08-27 11:45:55,212 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2023-08-27 11:45:55,213 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 138 flow [2023-08-27 11:45:55,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:55,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:45:55,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 11:45:55,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 11:45:55,214 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-08-27 11:45:55,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:45:55,214 INFO L85 PathProgramCache]: Analyzing trace with hash 900686, now seen corresponding path program 1 times [2023-08-27 11:45:55,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:45:55,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488095262] [2023-08-27 11:45:55,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:45:55,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:45:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:45:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 11:45:55,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:45:55,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488095262] [2023-08-27 11:45:55,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488095262] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:45:55,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:45:55,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:45:55,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97488469] [2023-08-27 11:45:55,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:45:55,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:45:55,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:45:55,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:45:55,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:45:55,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 436 [2023-08-27 11:45:55,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:55,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:45:55,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 436 [2023-08-27 11:45:55,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:45:55,462 INFO L124 PetriNetUnfolderBase]: 521/1092 cut-off events. [2023-08-27 11:45:55,462 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-27 11:45:55,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2130 conditions, 1092 events. 521/1092 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5996 event pairs, 475 based on Foata normal form. 0/740 useless extension candidates. Maximal degree in co-relation 2118. Up to 1022 conditions per place. [2023-08-27 11:45:55,470 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 50 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-27 11:45:55,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 238 flow [2023-08-27 11:45:55,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:45:55,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:45:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 616 transitions. [2023-08-27 11:45:55,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4709480122324159 [2023-08-27 11:45:55,473 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 616 transitions. [2023-08-27 11:45:55,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 616 transitions. [2023-08-27 11:45:55,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:45:55,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 616 transitions. [2023-08-27 11:45:55,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:55,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:55,480 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:55,480 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 138 flow. Second operand 3 states and 616 transitions. [2023-08-27 11:45:55,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 238 flow [2023-08-27 11:45:55,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 234 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 11:45:55,483 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 134 flow [2023-08-27 11:45:55,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2023-08-27 11:45:55,484 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2023-08-27 11:45:55,484 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 134 flow [2023-08-27 11:45:55,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:55,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:45:55,485 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 11:45:55,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 11:45:55,486 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-08-27 11:45:55,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:45:55,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1065048238, now seen corresponding path program 1 times [2023-08-27 11:45:55,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:45:55,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825166800] [2023-08-27 11:45:55,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:45:55,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:45:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:45:55,613 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-27 11:45:55,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:45:55,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825166800] [2023-08-27 11:45:55,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825166800] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:45:55,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097823459] [2023-08-27 11:45:55,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:45:55,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:45:55,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:45:55,625 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-27 11:45:55,650 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-27 11:45:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:45:55,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 11:45:55,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:45:55,749 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-27 11:45:55,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:45:55,770 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-27 11:45:55,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097823459] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:45:55,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:45:55,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-27 11:45:55,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706910096] [2023-08-27 11:45:55,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:45:55,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 11:45:55,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:45:55,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 11:45:55,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 11:45:55,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 436 [2023-08-27 11:45:55,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 134 flow. Second operand has 7 states, 7 states have (on average 189.57142857142858) internal successors, (1327), 7 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:55,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:45:55,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 436 [2023-08-27 11:45:55,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:45:55,982 INFO L124 PetriNetUnfolderBase]: 521/1095 cut-off events. [2023-08-27 11:45:55,982 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 11:45:55,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2139 conditions, 1095 events. 521/1095 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5995 event pairs, 475 based on Foata normal form. 3/747 useless extension candidates. Maximal degree in co-relation 2112. Up to 1024 conditions per place. [2023-08-27 11:45:55,988 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 50 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2023-08-27 11:45:55,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 256 flow [2023-08-27 11:45:55,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 11:45:55,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 11:45:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1186 transitions. [2023-08-27 11:45:55,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533639143730887 [2023-08-27 11:45:55,992 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1186 transitions. [2023-08-27 11:45:55,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1186 transitions. [2023-08-27 11:45:55,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:45:55,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1186 transitions. [2023-08-27 11:45:55,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 197.66666666666666) internal successors, (1186), 6 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:56,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 436.0) internal successors, (3052), 7 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:56,002 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 436.0) internal successors, (3052), 7 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:56,002 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 134 flow. Second operand 6 states and 1186 transitions. [2023-08-27 11:45:56,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 256 flow [2023-08-27 11:45:56,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 11:45:56,006 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 166 flow [2023-08-27 11:45:56,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2023-08-27 11:45:56,008 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2023-08-27 11:45:56,008 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 166 flow [2023-08-27 11:45:56,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 189.57142857142858) internal successors, (1327), 7 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:56,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:45:56,009 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2023-08-27 11:45:56,015 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-27 11:45:56,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:45:56,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-08-27 11:45:56,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:45:56,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1097272343, now seen corresponding path program 2 times [2023-08-27 11:45:56,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:45:56,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111810848] [2023-08-27 11:45:56,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:45:56,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:45:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:45:56,288 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-27 11:45:56,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:45:56,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111810848] [2023-08-27 11:45:56,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111810848] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:45:56,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:45:56,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:45:56,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999663149] [2023-08-27 11:45:56,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:45:56,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:45:56,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:45:56,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:45:56,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:45:56,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 436 [2023-08-27 11:45:56,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:56,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:45:56,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 436 [2023-08-27 11:45:56,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:45:56,437 INFO L124 PetriNetUnfolderBase]: 459/991 cut-off events. [2023-08-27 11:45:56,438 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-27 11:45:56,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1968 conditions, 991 events. 459/991 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6137 event pairs, 0 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 1934. Up to 907 conditions per place. [2023-08-27 11:45:56,443 INFO L140 encePairwiseOnDemand]: 431/436 looper letters, 71 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2023-08-27 11:45:56,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 79 transitions, 348 flow [2023-08-27 11:45:56,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:45:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:45:56,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2023-08-27 11:45:56,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48623853211009177 [2023-08-27 11:45:56,445 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 636 transitions. [2023-08-27 11:45:56,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 636 transitions. [2023-08-27 11:45:56,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:45:56,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 636 transitions. [2023-08-27 11:45:56,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:56,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:56,451 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:56,451 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 166 flow. Second operand 3 states and 636 transitions. [2023-08-27 11:45:56,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 79 transitions, 348 flow [2023-08-27 11:45:56,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 79 transitions, 334 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-27 11:45:56,457 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 156 flow [2023-08-27 11:45:56,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2023-08-27 11:45:56,458 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2023-08-27 11:45:56,458 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 156 flow [2023-08-27 11:45:56,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:56,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:45:56,459 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:45:56,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 11:45:56,459 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-08-27 11:45:56,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:45:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash -153310722, now seen corresponding path program 1 times [2023-08-27 11:45:56,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:45:56,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276813811] [2023-08-27 11:45:56,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:45:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:45:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:45:56,606 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-27 11:45:56,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:45:56,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276813811] [2023-08-27 11:45:56,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276813811] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:45:56,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132369682] [2023-08-27 11:45:56,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:45:56,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:45:56,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:45:56,613 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-27 11:45:56,642 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-27 11:45:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:45:56,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-27 11:45:56,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:45:56,728 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-27 11:45:56,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:45:56,779 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-27 11:45:56,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132369682] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:45:56,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:45:56,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-27 11:45:56,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113663172] [2023-08-27 11:45:56,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:45:56,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-27 11:45:56,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:45:56,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-27 11:45:56,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-27 11:45:56,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 436 [2023-08-27 11:45:56,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 156 flow. Second operand has 13 states, 13 states have (on average 189.53846153846155) internal successors, (2464), 13 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:56,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:45:56,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 436 [2023-08-27 11:45:56,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:45:56,955 INFO L124 PetriNetUnfolderBase]: 480/992 cut-off events. [2023-08-27 11:45:56,955 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2023-08-27 11:45:56,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2025 conditions, 992 events. 480/992 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5317 event pairs, 437 based on Foata normal form. 6/728 useless extension candidates. Maximal degree in co-relation 1972. Up to 925 conditions per place. [2023-08-27 11:45:56,978 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 48 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2023-08-27 11:45:56,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 65 transitions, 310 flow [2023-08-27 11:45:56,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 11:45:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 11:45:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2321 transitions. [2023-08-27 11:45:56,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4436162079510703 [2023-08-27 11:45:56,985 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2321 transitions. [2023-08-27 11:45:56,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2321 transitions. [2023-08-27 11:45:56,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:45:56,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2321 transitions. [2023-08-27 11:45:56,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 193.41666666666666) internal successors, (2321), 12 states have internal predecessors, (2321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:56,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 436.0) internal successors, (5668), 13 states have internal predecessors, (5668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:57,001 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 436.0) internal successors, (5668), 13 states have internal predecessors, (5668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:57,001 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 156 flow. Second operand 12 states and 2321 transitions. [2023-08-27 11:45:57,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 65 transitions, 310 flow [2023-08-27 11:45:57,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 65 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 11:45:57,003 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 236 flow [2023-08-27 11:45:57,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=236, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2023-08-27 11:45:57,004 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 22 predicate places. [2023-08-27 11:45:57,004 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 236 flow [2023-08-27 11:45:57,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 189.53846153846155) internal successors, (2464), 13 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:57,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:45:57,005 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:45:57,015 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-27 11:45:57,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:45:57,211 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-08-27 11:45:57,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:45:57,212 INFO L85 PathProgramCache]: Analyzing trace with hash -854491810, now seen corresponding path program 2 times [2023-08-27 11:45:57,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:45:57,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566561093] [2023-08-27 11:45:57,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:45:57,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:45:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:45:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:45:57,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:45:57,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566561093] [2023-08-27 11:45:57,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566561093] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:45:57,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:45:57,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 11:45:57,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052985229] [2023-08-27 11:45:57,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:45:57,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 11:45:57,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:45:57,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 11:45:57,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 11:45:57,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 436 [2023-08-27 11:45:57,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 148.5) internal successors, (891), 6 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:57,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:45:57,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 436 [2023-08-27 11:45:57,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:45:57,822 INFO L124 PetriNetUnfolderBase]: 458/1035 cut-off events. [2023-08-27 11:45:57,825 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-08-27 11:45:57,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2127 conditions, 1035 events. 458/1035 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5849 event pairs, 107 based on Foata normal form. 0/831 useless extension candidates. Maximal degree in co-relation 2050. Up to 654 conditions per place. [2023-08-27 11:45:57,831 INFO L140 encePairwiseOnDemand]: 422/436 looper letters, 112 selfloop transitions, 10 changer transitions 3/130 dead transitions. [2023-08-27 11:45:57,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 130 transitions, 628 flow [2023-08-27 11:45:57,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 11:45:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 11:45:57,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1006 transitions. [2023-08-27 11:45:57,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3845565749235474 [2023-08-27 11:45:57,835 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1006 transitions. [2023-08-27 11:45:57,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1006 transitions. [2023-08-27 11:45:57,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:45:57,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1006 transitions. [2023-08-27 11:45:57,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 167.66666666666666) internal successors, (1006), 6 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:57,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 436.0) internal successors, (3052), 7 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:57,843 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 436.0) internal successors, (3052), 7 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:57,843 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 236 flow. Second operand 6 states and 1006 transitions. [2023-08-27 11:45:57,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 130 transitions, 628 flow [2023-08-27 11:45:57,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 130 transitions, 580 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-27 11:45:57,849 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 274 flow [2023-08-27 11:45:57,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2023-08-27 11:45:57,851 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 26 predicate places. [2023-08-27 11:45:57,851 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 274 flow [2023-08-27 11:45:57,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.5) internal successors, (891), 6 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:45:57,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:45:57,852 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:45:57,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 11:45:57,852 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-08-27 11:45:57,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:45:57,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1048340220, now seen corresponding path program 1 times [2023-08-27 11:45:57,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:45:57,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774370911] [2023-08-27 11:45:57,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:45:57,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:45:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:45:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:45:58,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:45:58,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774370911] [2023-08-27 11:45:58,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774370911] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:45:58,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807822942] [2023-08-27 11:45:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:45:58,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:45:58,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:45:58,512 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-27 11:45:58,522 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-27 11:45:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:45:58,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 11:45:58,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:45:58,646 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-27 11:45:58,733 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:45:58,733 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-27 11:45:58,756 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-27 11:45:58,813 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-27 11:45:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:45:58,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:46:08,881 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_163 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_163) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:46:08,897 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_163 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_163) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:46:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-27 11:46:09,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807822942] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:46:09,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:46:09,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2023-08-27 11:46:09,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728127077] [2023-08-27 11:46:09,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:46:09,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-27 11:46:09,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:09,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-27 11:46:09,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=5, NotChecked=46, Total=210 [2023-08-27 11:46:09,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 436 [2023-08-27 11:46:09,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 274 flow. Second operand has 15 states, 15 states have (on average 143.2) internal successors, (2148), 15 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:09,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:09,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 436 [2023-08-27 11:46:09,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:09,568 INFO L124 PetriNetUnfolderBase]: 457/1027 cut-off events. [2023-08-27 11:46:09,568 INFO L125 PetriNetUnfolderBase]: For 345/345 co-relation queries the response was YES. [2023-08-27 11:46:09,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2382 conditions, 1027 events. 457/1027 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5750 event pairs, 114 based on Foata normal form. 2/865 useless extension candidates. Maximal degree in co-relation 2324. Up to 654 conditions per place. [2023-08-27 11:46:09,575 INFO L140 encePairwiseOnDemand]: 426/436 looper letters, 105 selfloop transitions, 9 changer transitions 0/119 dead transitions. [2023-08-27 11:46:09,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 119 transitions, 608 flow [2023-08-27 11:46:09,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 11:46:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 11:46:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 952 transitions. [2023-08-27 11:46:09,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.363914373088685 [2023-08-27 11:46:09,578 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 952 transitions. [2023-08-27 11:46:09,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 952 transitions. [2023-08-27 11:46:09,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:09,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 952 transitions. [2023-08-27 11:46:09,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.66666666666666) internal successors, (952), 6 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:09,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 436.0) internal successors, (3052), 7 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:09,585 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 436.0) internal successors, (3052), 7 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:09,585 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 274 flow. Second operand 6 states and 952 transitions. [2023-08-27 11:46:09,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 119 transitions, 608 flow [2023-08-27 11:46:09,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 119 transitions, 606 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 11:46:09,589 INFO L231 Difference]: Finished difference. Result has 91 places, 73 transitions, 300 flow [2023-08-27 11:46:09,589 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=91, PETRI_TRANSITIONS=73} [2023-08-27 11:46:09,590 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 31 predicate places. [2023-08-27 11:46:09,590 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 73 transitions, 300 flow [2023-08-27 11:46:09,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 143.2) internal successors, (2148), 15 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:09,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:09,591 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:09,602 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-27 11:46:09,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:09,797 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-08-27 11:46:09,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:09,798 INFO L85 PathProgramCache]: Analyzing trace with hash -967363572, now seen corresponding path program 1 times [2023-08-27 11:46:09,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:09,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685855506] [2023-08-27 11:46:09,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:09,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:10,105 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:46:10,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:10,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685855506] [2023-08-27 11:46:10,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685855506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:10,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:46:10,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 11:46:10,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486978001] [2023-08-27 11:46:10,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:10,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 11:46:10,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:10,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 11:46:10,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-27 11:46:10,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 436 [2023-08-27 11:46:10,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 73 transitions, 300 flow. Second operand has 9 states, 9 states have (on average 146.44444444444446) internal successors, (1318), 9 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:10,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:10,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 436 [2023-08-27 11:46:10,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:10,489 INFO L124 PetriNetUnfolderBase]: 444/1045 cut-off events. [2023-08-27 11:46:10,489 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2023-08-27 11:46:10,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2511 conditions, 1045 events. 444/1045 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5984 event pairs, 71 based on Foata normal form. 0/893 useless extension candidates. Maximal degree in co-relation 2451. Up to 537 conditions per place. [2023-08-27 11:46:10,496 INFO L140 encePairwiseOnDemand]: 424/436 looper letters, 129 selfloop transitions, 17 changer transitions 5/156 dead transitions. [2023-08-27 11:46:10,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 156 transitions, 814 flow [2023-08-27 11:46:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 11:46:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 11:46:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1301 transitions. [2023-08-27 11:46:10,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37299311926605505 [2023-08-27 11:46:10,500 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1301 transitions. [2023-08-27 11:46:10,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1301 transitions. [2023-08-27 11:46:10,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:10,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1301 transitions. [2023-08-27 11:46:10,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 162.625) internal successors, (1301), 8 states have internal predecessors, (1301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:10,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 436.0) internal successors, (3924), 9 states have internal predecessors, (3924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:10,509 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 436.0) internal successors, (3924), 9 states have internal predecessors, (3924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:10,509 INFO L175 Difference]: Start difference. First operand has 91 places, 73 transitions, 300 flow. Second operand 8 states and 1301 transitions. [2023-08-27 11:46:10,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 156 transitions, 814 flow [2023-08-27 11:46:10,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 156 transitions, 802 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 11:46:10,514 INFO L231 Difference]: Finished difference. Result has 99 places, 81 transitions, 391 flow [2023-08-27 11:46:10,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=391, PETRI_PLACES=99, PETRI_TRANSITIONS=81} [2023-08-27 11:46:10,515 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 39 predicate places. [2023-08-27 11:46:10,515 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 81 transitions, 391 flow [2023-08-27 11:46:10,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 146.44444444444446) internal successors, (1318), 9 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:10,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:10,516 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:10,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 11:46:10,516 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-08-27 11:46:10,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash -967363571, now seen corresponding path program 1 times [2023-08-27 11:46:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:10,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072311382] [2023-08-27 11:46:10,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:10,620 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:46:10,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:10,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072311382] [2023-08-27 11:46:10,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072311382] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:10,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:46:10,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:46:10,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574877501] [2023-08-27 11:46:10,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:10,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:46:10,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:10,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:46:10,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:46:10,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 436 [2023-08-27 11:46:10,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 81 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:10,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:10,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 436 [2023-08-27 11:46:10,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:10,784 INFO L124 PetriNetUnfolderBase]: 399/943 cut-off events. [2023-08-27 11:46:10,785 INFO L125 PetriNetUnfolderBase]: For 1090/1092 co-relation queries the response was YES. [2023-08-27 11:46:10,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 943 events. 399/943 cut-off events. For 1090/1092 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5388 event pairs, 186 based on Foata normal form. 27/870 useless extension candidates. Maximal degree in co-relation 2415. Up to 558 conditions per place. [2023-08-27 11:46:10,791 INFO L140 encePairwiseOnDemand]: 429/436 looper letters, 88 selfloop transitions, 8 changer transitions 7/109 dead transitions. [2023-08-27 11:46:10,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 109 transitions, 683 flow [2023-08-27 11:46:10,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:46:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:46:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 597 transitions. [2023-08-27 11:46:10,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45642201834862384 [2023-08-27 11:46:10,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 597 transitions. [2023-08-27 11:46:10,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 597 transitions. [2023-08-27 11:46:10,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:10,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 597 transitions. [2023-08-27 11:46:10,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:10,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:10,798 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:10,798 INFO L175 Difference]: Start difference. First operand has 99 places, 81 transitions, 391 flow. Second operand 3 states and 597 transitions. [2023-08-27 11:46:10,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 109 transitions, 683 flow [2023-08-27 11:46:10,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 109 transitions, 650 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-27 11:46:10,804 INFO L231 Difference]: Finished difference. Result has 99 places, 81 transitions, 404 flow [2023-08-27 11:46:10,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=404, PETRI_PLACES=99, PETRI_TRANSITIONS=81} [2023-08-27 11:46:10,804 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 39 predicate places. [2023-08-27 11:46:10,804 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 81 transitions, 404 flow [2023-08-27 11:46:10,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:10,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:10,805 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:10,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 11:46:10,805 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-08-27 11:46:10,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:10,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1317340710, now seen corresponding path program 1 times [2023-08-27 11:46:10,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:10,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883253547] [2023-08-27 11:46:10,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:10,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:46:11,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:11,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883253547] [2023-08-27 11:46:11,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883253547] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:11,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396949709] [2023-08-27 11:46:11,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:11,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:11,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:11,312 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-27 11:46:11,315 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-27 11:46:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:11,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-27 11:46:11,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:11,425 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-27 11:46:11,491 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:46:11,492 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-27 11:46:11,513 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-27 11:46:11,587 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 27 treesize of output 20 [2023-08-27 11:46:11,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 11:46:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:46:11,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:46:11,680 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 2147483648))) is different from false [2023-08-27 11:46:11,718 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (v_ArrVal_312 (Array Int Int))) (or (< v_ArrVal_310 (+ |c_t_funThread1of1ForFork0_#t~mem35#1| 1)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 2147483648)))) is different from false [2023-08-27 11:46:11,727 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_312 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_~p~0#1.base|))) (or (< 0 (+ 2147483648 (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_~p~0#1.base| (store .cse0 |t_funThread1of1ForFork0_~p~0#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|))) (< v_ArrVal_310 (+ 1 (select .cse0 |t_funThread1of1ForFork0_~p~0#1.offset|)))))) is different from false [2023-08-27 11:46:11,759 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_312 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |t_funThread1of1ForFork0_~p~0#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_310 (+ (select .cse0 |t_funThread1of1ForFork0_~p~0#1.offset|) 1))))) is different from false [2023-08-27 11:46:11,793 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (v_ArrVal_309 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int) (v_ArrVal_312 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_309))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread1of1ForFork0_~p~0#1.offset| v_ArrVal_310)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_312) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_310 (+ (select .cse1 |t_funThread1of1ForFork0_~p~0#1.offset|) 1)))))) is different from false [2023-08-27 11:46:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-27 11:46:11,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396949709] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:46:11,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:46:11,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 20 [2023-08-27 11:46:11,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020658756] [2023-08-27 11:46:11,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:46:11,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-27 11:46:11,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:11,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-27 11:46:11,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=224, Unknown=5, NotChecked=170, Total=462 [2023-08-27 11:46:11,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 436 [2023-08-27 11:46:11,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 81 transitions, 404 flow. Second operand has 22 states, 22 states have (on average 141.04545454545453) internal successors, (3103), 22 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:11,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:11,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 436 [2023-08-27 11:46:11,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:13,009 INFO L124 PetriNetUnfolderBase]: 415/972 cut-off events. [2023-08-27 11:46:13,009 INFO L125 PetriNetUnfolderBase]: For 1106/1106 co-relation queries the response was YES. [2023-08-27 11:46:13,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2643 conditions, 972 events. 415/972 cut-off events. For 1106/1106 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5446 event pairs, 62 based on Foata normal form. 2/876 useless extension candidates. Maximal degree in co-relation 2579. Up to 456 conditions per place. [2023-08-27 11:46:13,016 INFO L140 encePairwiseOnDemand]: 424/436 looper letters, 139 selfloop transitions, 15 changer transitions 6/165 dead transitions. [2023-08-27 11:46:13,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 165 transitions, 922 flow [2023-08-27 11:46:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 11:46:13,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 11:46:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1539 transitions. [2023-08-27 11:46:13,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3529816513761468 [2023-08-27 11:46:13,068 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1539 transitions. [2023-08-27 11:46:13,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1539 transitions. [2023-08-27 11:46:13,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:13,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1539 transitions. [2023-08-27 11:46:13,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 153.9) internal successors, (1539), 10 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:13,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 436.0) internal successors, (4796), 11 states have internal predecessors, (4796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:13,078 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 436.0) internal successors, (4796), 11 states have internal predecessors, (4796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:13,078 INFO L175 Difference]: Start difference. First operand has 99 places, 81 transitions, 404 flow. Second operand 10 states and 1539 transitions. [2023-08-27 11:46:13,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 165 transitions, 922 flow [2023-08-27 11:46:13,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 165 transitions, 906 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-27 11:46:13,091 INFO L231 Difference]: Finished difference. Result has 108 places, 77 transitions, 397 flow [2023-08-27 11:46:13,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=397, PETRI_PLACES=108, PETRI_TRANSITIONS=77} [2023-08-27 11:46:13,092 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 48 predicate places. [2023-08-27 11:46:13,092 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 77 transitions, 397 flow [2023-08-27 11:46:13,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 141.04545454545453) internal successors, (3103), 22 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:13,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:13,094 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:13,103 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-27 11:46:13,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:13,300 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-08-27 11:46:13,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:13,300 INFO L85 PathProgramCache]: Analyzing trace with hash 2095289083, now seen corresponding path program 1 times [2023-08-27 11:46:13,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:13,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000055177] [2023-08-27 11:46:13,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:13,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:46:13,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:13,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000055177] [2023-08-27 11:46:13,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000055177] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:13,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184864919] [2023-08-27 11:46:13,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:13,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:13,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:13,361 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-27 11:46:13,363 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-27 11:46:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:13,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 11:46:13,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:46:13,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:46:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:46:13,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184864919] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:46:13,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:46:13,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-27 11:46:13,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391215463] [2023-08-27 11:46:13,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:46:13,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 11:46:13,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:13,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 11:46:13,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 11:46:13,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 436 [2023-08-27 11:46:13,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 77 transitions, 397 flow. Second operand has 7 states, 7 states have (on average 191.28571428571428) internal successors, (1339), 7 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:13,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:13,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 436 [2023-08-27 11:46:13,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:13,546 INFO L124 PetriNetUnfolderBase]: 19/94 cut-off events. [2023-08-27 11:46:13,546 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2023-08-27 11:46:13,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 94 events. 19/94 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 249 event pairs, 3 based on Foata normal form. 16/107 useless extension candidates. Maximal degree in co-relation 320. Up to 55 conditions per place. [2023-08-27 11:46:13,547 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 28 selfloop transitions, 2 changer transitions 18/51 dead transitions. [2023-08-27 11:46:13,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 51 transitions, 366 flow [2023-08-27 11:46:13,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 11:46:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 11:46:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 789 transitions. [2023-08-27 11:46:13,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45240825688073394 [2023-08-27 11:46:13,550 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 789 transitions. [2023-08-27 11:46:13,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 789 transitions. [2023-08-27 11:46:13,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:13,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 789 transitions. [2023-08-27 11:46:13,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.25) internal successors, (789), 4 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:13,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 436.0) internal successors, (2180), 5 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:13,555 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 436.0) internal successors, (2180), 5 states have internal predecessors, (2180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:13,555 INFO L175 Difference]: Start difference. First operand has 108 places, 77 transitions, 397 flow. Second operand 4 states and 789 transitions. [2023-08-27 11:46:13,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 51 transitions, 366 flow [2023-08-27 11:46:13,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 51 transitions, 278 flow, removed 5 selfloop flow, removed 22 redundant places. [2023-08-27 11:46:13,557 INFO L231 Difference]: Finished difference. Result has 57 places, 27 transitions, 126 flow [2023-08-27 11:46:13,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=57, PETRI_TRANSITIONS=27} [2023-08-27 11:46:13,558 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-08-27 11:46:13,558 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 27 transitions, 126 flow [2023-08-27 11:46:13,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 191.28571428571428) internal successors, (1339), 7 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:13,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:13,559 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:13,566 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-27 11:46:13,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-27 11:46:13,765 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2023-08-27 11:46:13,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:13,765 INFO L85 PathProgramCache]: Analyzing trace with hash -748173133, now seen corresponding path program 1 times [2023-08-27 11:46:13,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:13,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761525784] [2023-08-27 11:46:13,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:13,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:46:14,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:14,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761525784] [2023-08-27 11:46:14,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761525784] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:14,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229689916] [2023-08-27 11:46:14,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:14,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:14,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:14,034 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-27 11:46:14,055 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-27 11:46:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:14,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-27 11:46:14,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:14,185 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:46:14,185 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-27 11:46:14,232 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-27 11:46:14,252 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-27 11:46:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:46:14,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:46:14,288 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_459 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_459) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 2147483649)) is different from false [2023-08-27 11:46:14,295 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:46:14,295 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-08-27 11:46:14,299 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-08-27 11:46:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-27 11:46:14,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229689916] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:46:14,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:46:14,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2023-08-27 11:46:14,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620208245] [2023-08-27 11:46:14,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:46:14,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 11:46:14,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:14,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 11:46:14,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=220, Unknown=1, NotChecked=30, Total=306 [2023-08-27 11:46:14,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 436 [2023-08-27 11:46:14,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 27 transitions, 126 flow. Second operand has 18 states, 18 states have (on average 156.33333333333334) internal successors, (2814), 18 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:14,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:14,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 436 [2023-08-27 11:46:14,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:14,565 INFO L124 PetriNetUnfolderBase]: 10/54 cut-off events. [2023-08-27 11:46:14,566 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-08-27 11:46:14,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 54 events. 10/54 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 80 event pairs, 0 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 159. Up to 14 conditions per place. [2023-08-27 11:46:14,566 INFO L140 encePairwiseOnDemand]: 428/436 looper letters, 0 selfloop transitions, 0 changer transitions 38/38 dead transitions. [2023-08-27 11:46:14,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 38 transitions, 232 flow [2023-08-27 11:46:14,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 11:46:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 11:46:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1720 transitions. [2023-08-27 11:46:14,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3586321934945788 [2023-08-27 11:46:14,571 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1720 transitions. [2023-08-27 11:46:14,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1720 transitions. [2023-08-27 11:46:14,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:14,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1720 transitions. [2023-08-27 11:46:14,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 156.36363636363637) internal successors, (1720), 11 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:14,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 436.0) internal successors, (5232), 12 states have internal predecessors, (5232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:14,586 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 436.0) internal successors, (5232), 12 states have internal predecessors, (5232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:14,586 INFO L175 Difference]: Start difference. First operand has 57 places, 27 transitions, 126 flow. Second operand 11 states and 1720 transitions. [2023-08-27 11:46:14,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 38 transitions, 232 flow [2023-08-27 11:46:14,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 38 transitions, 223 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 11:46:14,588 INFO L231 Difference]: Finished difference. Result has 54 places, 0 transitions, 0 flow [2023-08-27 11:46:14,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=54, PETRI_TRANSITIONS=0} [2023-08-27 11:46:14,588 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2023-08-27 11:46:14,588 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 0 transitions, 0 flow [2023-08-27 11:46:14,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 156.33333333333334) internal successors, (2814), 18 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:14,591 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 21 remaining) [2023-08-27 11:46:14,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2023-08-27 11:46:14,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2023-08-27 11:46:14,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2023-08-27 11:46:14,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2023-08-27 11:46:14,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2023-08-27 11:46:14,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2023-08-27 11:46:14,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (13 of 21 remaining) [2023-08-27 11:46:14,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2023-08-27 11:46:14,592 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2023-08-27 11:46:14,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2023-08-27 11:46:14,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2023-08-27 11:46:14,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2023-08-27 11:46:14,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2023-08-27 11:46:14,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2023-08-27 11:46:14,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2023-08-27 11:46:14,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONASSERT (4 of 21 remaining) [2023-08-27 11:46:14,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONASSERT (3 of 21 remaining) [2023-08-27 11:46:14,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2023-08-27 11:46:14,593 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2023-08-27 11:46:14,594 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2023-08-27 11:46:14,602 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-27 11:46:14,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:14,800 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:14,802 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-27 11:46:14,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 229 transitions, 466 flow [2023-08-27 11:46:14,826 INFO L124 PetriNetUnfolderBase]: 48/313 cut-off events. [2023-08-27 11:46:14,826 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-27 11:46:14,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 313 events. 48/313 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1123 event pairs, 0 based on Foata normal form. 0/241 useless extension candidates. Maximal degree in co-relation 173. Up to 8 conditions per place. [2023-08-27 11:46:14,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 229 transitions, 466 flow [2023-08-27 11:46:14,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 218 transitions, 441 flow [2023-08-27 11:46:14,830 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 11:46:14,830 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 218 transitions, 441 flow [2023-08-27 11:46:14,830 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 218 transitions, 441 flow [2023-08-27 11:46:14,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 218 transitions, 441 flow [2023-08-27 11:46:14,848 INFO L124 PetriNetUnfolderBase]: 47/302 cut-off events. [2023-08-27 11:46:14,848 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 11:46:14,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 302 events. 47/302 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1074 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 173. Up to 8 conditions per place. [2023-08-27 11:46:14,855 INFO L119 LiptonReduction]: Number of co-enabled transitions 15040 [2023-08-27 11:46:17,447 INFO L134 LiptonReduction]: Checked pairs total: 25118 [2023-08-27 11:46:17,447 INFO L136 LiptonReduction]: Total number of compositions: 197 [2023-08-27 11:46:17,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-27 11:46:17,451 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;@700d1232, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 11:46:17,452 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-27 11:46:17,455 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 11:46:17,455 INFO L124 PetriNetUnfolderBase]: 12/42 cut-off events. [2023-08-27 11:46:17,455 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 11:46:17,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:17,455 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-27 11:46:17,455 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 11:46:17,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:17,456 INFO L85 PathProgramCache]: Analyzing trace with hash 2112497798, now seen corresponding path program 1 times [2023-08-27 11:46:17,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:17,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836488745] [2023-08-27 11:46:17,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:17,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:17,472 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-27 11:46:17,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:17,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836488745] [2023-08-27 11:46:17,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836488745] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:17,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:46:17,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:46:17,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354562197] [2023-08-27 11:46:17,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:17,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:46:17,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:17,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:46:17,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:46:17,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 426 [2023-08-27 11:46:17,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 77 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:17,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:17,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 426 [2023-08-27 11:46:17,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:17,581 INFO L124 PetriNetUnfolderBase]: 518/1090 cut-off events. [2023-08-27 11:46:17,581 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 11:46:17,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 1090 events. 518/1090 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5947 event pairs, 475 based on Foata normal form. 116/856 useless extension candidates. Maximal degree in co-relation 2054. Up to 1021 conditions per place. [2023-08-27 11:46:17,584 INFO L140 encePairwiseOnDemand]: 400/426 looper letters, 27 selfloop transitions, 2 changer transitions 22/55 dead transitions. [2023-08-27 11:46:17,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 213 flow [2023-08-27 11:46:17,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:46:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:46:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2023-08-27 11:46:17,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984350547730829 [2023-08-27 11:46:17,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 637 transitions. [2023-08-27 11:46:17,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 637 transitions. [2023-08-27 11:46:17,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:17,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 637 transitions. [2023-08-27 11:46:17,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:17,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:17,590 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 426.0) internal successors, (1704), 4 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:17,590 INFO L175 Difference]: Start difference. First operand has 55 places, 77 transitions, 159 flow. Second operand 3 states and 637 transitions. [2023-08-27 11:46:17,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 213 flow [2023-08-27 11:46:17,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 213 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 11:46:17,591 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 81 flow [2023-08-27 11:46:17,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2023-08-27 11:46:17,593 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2023-08-27 11:46:17,593 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 81 flow [2023-08-27 11:46:17,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:17,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:17,593 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:17,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 11:46:17,593 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 11:46:17,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:17,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1170759422, now seen corresponding path program 1 times [2023-08-27 11:46:17,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:17,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512386260] [2023-08-27 11:46:17,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:17,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:17,615 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-27 11:46:17,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:17,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512386260] [2023-08-27 11:46:17,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512386260] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:17,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043836716] [2023-08-27 11:46:17,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:17,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:17,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:17,617 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-27 11:46:17,649 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-27 11:46:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:17,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 11:46:17,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:17,719 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-27 11:46:17,719 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:46:17,729 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-27 11:46:17,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043836716] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:46:17,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:46:17,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-27 11:46:17,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252528388] [2023-08-27 11:46:17,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:46:17,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 11:46:17,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:17,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 11:46:17,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 11:46:17,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 426 [2023-08-27 11:46:17,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 33 transitions, 81 flow. Second operand has 6 states, 6 states have (on average 189.5) internal successors, (1137), 6 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:17,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:17,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 426 [2023-08-27 11:46:17,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:17,779 INFO L124 PetriNetUnfolderBase]: 102/243 cut-off events. [2023-08-27 11:46:17,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 11:46:17,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 243 events. 102/243 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 911 event pairs, 95 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 471. Up to 221 conditions per place. [2023-08-27 11:46:17,780 INFO L140 encePairwiseOnDemand]: 423/426 looper letters, 27 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2023-08-27 11:46:17,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 157 flow [2023-08-27 11:46:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 11:46:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 11:46:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1163 transitions. [2023-08-27 11:46:17,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4550078247261346 [2023-08-27 11:46:17,783 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1163 transitions. [2023-08-27 11:46:17,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1163 transitions. [2023-08-27 11:46:17,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:17,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1163 transitions. [2023-08-27 11:46:17,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 193.83333333333334) internal successors, (1163), 6 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:17,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 426.0) internal successors, (2982), 7 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:17,790 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 426.0) internal successors, (2982), 7 states have internal predecessors, (2982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:17,790 INFO L175 Difference]: Start difference. First operand has 57 places, 33 transitions, 81 flow. Second operand 6 states and 1163 transitions. [2023-08-27 11:46:17,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 157 flow [2023-08-27 11:46:17,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 153 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 11:46:17,791 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 113 flow [2023-08-27 11:46:17,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=113, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-08-27 11:46:17,792 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -12 predicate places. [2023-08-27 11:46:17,792 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 113 flow [2023-08-27 11:46:17,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.5) internal successors, (1137), 6 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:17,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:17,792 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-27 11:46:17,803 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-27 11:46:18,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:18,003 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 11:46:18,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:18,003 INFO L85 PathProgramCache]: Analyzing trace with hash -507353210, now seen corresponding path program 2 times [2023-08-27 11:46:18,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:18,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246960286] [2023-08-27 11:46:18,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:18,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:18,056 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-27 11:46:18,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:18,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246960286] [2023-08-27 11:46:18,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246960286] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:18,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59842511] [2023-08-27 11:46:18,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 11:46:18,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:18,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:18,058 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-27 11:46:18,061 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-27 11:46:18,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 11:46:18,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:46:18,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-27 11:46:18,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:18,155 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-27 11:46:18,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:46:18,201 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-27 11:46:18,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59842511] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:46:18,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:46:18,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-27 11:46:18,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537614750] [2023-08-27 11:46:18,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:46:18,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-27 11:46:18,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:18,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-27 11:46:18,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-27 11:46:18,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 426 [2023-08-27 11:46:18,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 113 flow. Second operand has 12 states, 12 states have (on average 189.25) internal successors, (2271), 12 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:18,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:18,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 426 [2023-08-27 11:46:18,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:18,314 INFO L124 PetriNetUnfolderBase]: 102/249 cut-off events. [2023-08-27 11:46:18,314 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-27 11:46:18,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 249 events. 102/249 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 914 event pairs, 95 based on Foata normal form. 6/158 useless extension candidates. Maximal degree in co-relation 462. Up to 221 conditions per place. [2023-08-27 11:46:18,315 INFO L140 encePairwiseOnDemand]: 423/426 looper letters, 27 selfloop transitions, 11 changer transitions 0/42 dead transitions. [2023-08-27 11:46:18,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 42 transitions, 225 flow [2023-08-27 11:46:18,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 11:46:18,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 11:46:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2300 transitions. [2023-08-27 11:46:18,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44992175273865415 [2023-08-27 11:46:18,322 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2300 transitions. [2023-08-27 11:46:18,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2300 transitions. [2023-08-27 11:46:18,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:18,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2300 transitions. [2023-08-27 11:46:18,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 191.66666666666666) internal successors, (2300), 12 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:18,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 426.0) internal successors, (5538), 13 states have internal predecessors, (5538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:18,333 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 426.0) internal successors, (5538), 13 states have internal predecessors, (5538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:18,333 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 113 flow. Second operand 12 states and 2300 transitions. [2023-08-27 11:46:18,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 42 transitions, 225 flow [2023-08-27 11:46:18,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 42 transitions, 211 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-27 11:46:18,334 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 183 flow [2023-08-27 11:46:18,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=426, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=183, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2023-08-27 11:46:18,336 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2023-08-27 11:46:18,336 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 183 flow [2023-08-27 11:46:18,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 189.25) internal successors, (2271), 12 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:18,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:18,337 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-27 11:46:18,352 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-27 11:46:18,545 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,SelfDestructingSolverStorable14 [2023-08-27 11:46:18,545 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 11:46:18,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:18,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1597327866, now seen corresponding path program 3 times [2023-08-27 11:46:18,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:18,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199443883] [2023-08-27 11:46:18,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:18,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 11:46:18,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 11:46:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 11:46:18,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 11:46:18,595 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 11:46:18,596 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-27 11:46:18,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 11:46:18,596 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-27 11:46:18,597 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-27 11:46:18,597 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-27 11:46:18,597 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-27 11:46:18,634 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-27 11:46:18,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 268 places, 311 transitions, 640 flow [2023-08-27 11:46:18,680 INFO L124 PetriNetUnfolderBase]: 80/516 cut-off events. [2023-08-27 11:46:18,680 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-27 11:46:18,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 516 events. 80/516 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2249 event pairs, 0 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 315. Up to 12 conditions per place. [2023-08-27 11:46:18,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 268 places, 311 transitions, 640 flow [2023-08-27 11:46:18,692 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 268 places, 311 transitions, 640 flow [2023-08-27 11:46:18,692 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 11:46:18,692 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 268 places, 311 transitions, 640 flow [2023-08-27 11:46:18,692 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 268 places, 311 transitions, 640 flow [2023-08-27 11:46:18,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 268 places, 311 transitions, 640 flow [2023-08-27 11:46:18,737 INFO L124 PetriNetUnfolderBase]: 80/516 cut-off events. [2023-08-27 11:46:18,737 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-27 11:46:18,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 516 events. 80/516 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2249 event pairs, 0 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 315. Up to 12 conditions per place. [2023-08-27 11:46:18,759 INFO L119 LiptonReduction]: Number of co-enabled transitions 45920 [2023-08-27 11:46:22,201 INFO L134 LiptonReduction]: Checked pairs total: 80999 [2023-08-27 11:46:22,201 INFO L136 LiptonReduction]: Total number of compositions: 286 [2023-08-27 11:46:22,203 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 11:46:22,203 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;@700d1232, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 11:46:22,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-27 11:46:22,204 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 11:46:22,204 INFO L124 PetriNetUnfolderBase]: 1/2 cut-off events. [2023-08-27 11:46:22,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 11:46:22,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:22,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-27 11:46:22,204 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:46:22,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:22,204 INFO L85 PathProgramCache]: Analyzing trace with hash 56947, now seen corresponding path program 1 times [2023-08-27 11:46:22,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:22,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680817278] [2023-08-27 11:46:22,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:22,238 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-27 11:46:22,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:22,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680817278] [2023-08-27 11:46:22,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680817278] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:22,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:46:22,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 11:46:22,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524153983] [2023-08-27 11:46:22,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:22,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:46:22,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:22,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:46:22,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:46:22,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:46:22,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 119 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:22,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:22,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:46:22,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:24,541 INFO L124 PetriNetUnfolderBase]: 21032/33098 cut-off events. [2023-08-27 11:46:24,541 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-08-27 11:46:24,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64014 conditions, 33098 events. 21032/33098 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 1354. Compared 250058 event pairs, 19766 based on Foata normal form. 4560/26870 useless extension candidates. Maximal degree in co-relation 27025. Up to 30793 conditions per place. [2023-08-27 11:46:24,752 INFO L140 encePairwiseOnDemand]: 560/597 looper letters, 73 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-27 11:46:24,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 87 transitions, 342 flow [2023-08-27 11:46:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:46:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:46:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 873 transitions. [2023-08-27 11:46:24,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48743718592964824 [2023-08-27 11:46:24,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 873 transitions. [2023-08-27 11:46:24,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 873 transitions. [2023-08-27 11:46:24,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:24,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 873 transitions. [2023-08-27 11:46:24,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:24,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 597.0) internal successors, (2388), 4 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:24,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 597.0) internal successors, (2388), 4 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:24,761 INFO L175 Difference]: Start difference. First operand has 86 places, 119 transitions, 256 flow. Second operand 3 states and 873 transitions. [2023-08-27 11:46:24,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 87 transitions, 342 flow [2023-08-27 11:46:24,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 87 transitions, 342 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 11:46:24,763 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 204 flow [2023-08-27 11:46:24,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2023-08-27 11:46:24,764 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 2 predicate places. [2023-08-27 11:46:24,764 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 204 flow [2023-08-27 11:46:24,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 254.66666666666666) internal successors, (764), 3 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:24,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:24,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 11:46:24,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 11:46:24,765 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:46:24,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:24,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1768767, now seen corresponding path program 1 times [2023-08-27 11:46:24,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:24,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811576069] [2023-08-27 11:46:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:24,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 11:46:24,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:24,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811576069] [2023-08-27 11:46:24,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811576069] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:24,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:46:24,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:46:24,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154852880] [2023-08-27 11:46:24,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:24,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:46:24,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:24,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:46:24,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:46:24,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:46:24,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:24,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:24,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:46:24,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:26,490 INFO L124 PetriNetUnfolderBase]: 21032/33097 cut-off events. [2023-08-27 11:46:26,490 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-08-27 11:46:26,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64019 conditions, 33097 events. 21032/33097 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 1354. Compared 249891 event pairs, 19766 based on Foata normal form. 0/22310 useless extension candidates. Maximal degree in co-relation 64006. Up to 30790 conditions per place. [2023-08-27 11:46:26,683 INFO L140 encePairwiseOnDemand]: 594/597 looper letters, 72 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2023-08-27 11:46:26,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 86 transitions, 348 flow [2023-08-27 11:46:26,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:46:26,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:46:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 836 transitions. [2023-08-27 11:46:26,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4667783361250698 [2023-08-27 11:46:26,688 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 836 transitions. [2023-08-27 11:46:26,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 836 transitions. [2023-08-27 11:46:26,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:26,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 836 transitions. [2023-08-27 11:46:26,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 278.6666666666667) internal successors, (836), 3 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:26,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 597.0) internal successors, (2388), 4 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:26,694 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 597.0) internal successors, (2388), 4 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:26,694 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 204 flow. Second operand 3 states and 836 transitions. [2023-08-27 11:46:26,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 86 transitions, 348 flow [2023-08-27 11:46:26,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 86 transitions, 344 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 11:46:26,696 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 200 flow [2023-08-27 11:46:26,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-08-27 11:46:26,696 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 2 predicate places. [2023-08-27 11:46:26,697 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 200 flow [2023-08-27 11:46:26,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:26,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:26,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:26,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 11:46:26,697 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:46:26,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1527012207, now seen corresponding path program 1 times [2023-08-27 11:46:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:26,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396190048] [2023-08-27 11:46:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:26,725 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-27 11:46:26,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:26,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396190048] [2023-08-27 11:46:26,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396190048] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:26,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567415819] [2023-08-27 11:46:26,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:26,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:26,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:26,727 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-27 11:46:26,730 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-27 11:46:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:26,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 11:46:26,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:26,830 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-27 11:46:26,830 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:46:26,842 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-27 11:46:26,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567415819] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:46:26,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:46:26,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-27 11:46:26,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248853938] [2023-08-27 11:46:26,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:46:26,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 11:46:26,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:26,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 11:46:26,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 11:46:26,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:46:26,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 200 flow. Second operand has 7 states, 7 states have (on average 255.57142857142858) internal successors, (1789), 7 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:26,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:26,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:46:26,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:28,584 INFO L124 PetriNetUnfolderBase]: 21032/33100 cut-off events. [2023-08-27 11:46:28,585 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-08-27 11:46:28,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64028 conditions, 33100 events. 21032/33100 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 1354. Compared 250072 event pairs, 19766 based on Foata normal form. 3/22317 useless extension candidates. Maximal degree in co-relation 64000. Up to 30792 conditions per place. [2023-08-27 11:46:28,739 INFO L140 encePairwiseOnDemand]: 594/597 looper letters, 72 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2023-08-27 11:46:28,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 89 transitions, 366 flow [2023-08-27 11:46:28,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 11:46:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 11:46:28,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1604 transitions. [2023-08-27 11:46:28,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44779452819653826 [2023-08-27 11:46:28,742 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1604 transitions. [2023-08-27 11:46:28,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1604 transitions. [2023-08-27 11:46:28,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:28,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1604 transitions. [2023-08-27 11:46:28,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 267.3333333333333) internal successors, (1604), 6 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:28,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 597.0) internal successors, (4179), 7 states have internal predecessors, (4179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:28,748 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 597.0) internal successors, (4179), 7 states have internal predecessors, (4179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:28,748 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 200 flow. Second operand 6 states and 1604 transitions. [2023-08-27 11:46:28,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 89 transitions, 366 flow [2023-08-27 11:46:28,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 11:46:28,750 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 232 flow [2023-08-27 11:46:28,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=232, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2023-08-27 11:46:28,751 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 8 predicate places. [2023-08-27 11:46:28,751 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 232 flow [2023-08-27 11:46:28,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 255.57142857142858) internal successors, (1789), 7 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:28,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:28,751 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:28,761 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-27 11:46:28,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:28,957 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:46:28,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:28,957 INFO L85 PathProgramCache]: Analyzing trace with hash -922462813, now seen corresponding path program 2 times [2023-08-27 11:46:28,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:28,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15054162] [2023-08-27 11:46:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:28,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:28,993 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-27 11:46:28,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:28,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15054162] [2023-08-27 11:46:28,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15054162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:28,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:46:28,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:46:28,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088610520] [2023-08-27 11:46:28,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:28,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:46:28,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:28,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:46:28,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:46:28,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:46:28,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 232 flow. Second operand has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:28,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:28,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:46:28,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:30,852 INFO L124 PetriNetUnfolderBase]: 20651/32561 cut-off events. [2023-08-27 11:46:30,852 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-08-27 11:46:30,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63428 conditions, 32561 events. 20651/32561 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 1322. Compared 250161 event pairs, 9468 based on Foata normal form. 0/21779 useless extension candidates. Maximal degree in co-relation 63393. Up to 30676 conditions per place. [2023-08-27 11:46:31,018 INFO L140 encePairwiseOnDemand]: 592/597 looper letters, 96 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2023-08-27 11:46:31,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 110 transitions, 470 flow [2023-08-27 11:46:31,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:46:31,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:46:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2023-08-27 11:46:31,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796203238414294 [2023-08-27 11:46:31,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 859 transitions. [2023-08-27 11:46:31,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 859 transitions. [2023-08-27 11:46:31,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:31,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 859 transitions. [2023-08-27 11:46:31,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:31,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 597.0) internal successors, (2388), 4 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:31,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 597.0) internal successors, (2388), 4 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:31,024 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 232 flow. Second operand 3 states and 859 transitions. [2023-08-27 11:46:31,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 110 transitions, 470 flow [2023-08-27 11:46:31,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 110 transitions, 456 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-27 11:46:31,026 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 234 flow [2023-08-27 11:46:31,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2023-08-27 11:46:31,026 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 10 predicate places. [2023-08-27 11:46:31,026 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 234 flow [2023-08-27 11:46:31,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:31,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:31,027 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:31,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-27 11:46:31,027 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:46:31,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:31,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1706142676, now seen corresponding path program 1 times [2023-08-27 11:46:31,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:31,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014196754] [2023-08-27 11:46:31,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:31,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:31,078 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-27 11:46:31,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:31,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014196754] [2023-08-27 11:46:31,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014196754] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:31,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386711599] [2023-08-27 11:46:31,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:31,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:31,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:31,080 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-27 11:46:31,107 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-27 11:46:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:31,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-27 11:46:31,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:31,198 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-27 11:46:31,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:46:31,243 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-27 11:46:31,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386711599] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:46:31,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:46:31,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-27 11:46:31,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701654092] [2023-08-27 11:46:31,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:46:31,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-27 11:46:31,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:31,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-27 11:46:31,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-27 11:46:31,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:46:31,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 234 flow. Second operand has 13 states, 13 states have (on average 255.53846153846155) internal successors, (3322), 13 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:31,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:31,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:46:31,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:33,081 INFO L124 PetriNetUnfolderBase]: 21098/32768 cut-off events. [2023-08-27 11:46:33,082 INFO L125 PetriNetUnfolderBase]: For 994/994 co-relation queries the response was YES. [2023-08-27 11:46:33,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65205 conditions, 32768 events. 21098/32768 cut-off events. For 994/994 co-relation queries the response was YES. Maximal size of possible extension queue 1378. Compared 244580 event pairs, 19728 based on Foata normal form. 6/22391 useless extension candidates. Maximal degree in co-relation 65151. Up to 30694 conditions per place. [2023-08-27 11:46:33,279 INFO L140 encePairwiseOnDemand]: 594/597 looper letters, 73 selfloop transitions, 11 changer transitions 0/96 dead transitions. [2023-08-27 11:46:33,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 96 transitions, 438 flow [2023-08-27 11:46:33,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 11:46:33,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 11:46:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3137 transitions. [2023-08-27 11:46:33,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43788386376326077 [2023-08-27 11:46:33,283 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3137 transitions. [2023-08-27 11:46:33,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3137 transitions. [2023-08-27 11:46:33,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:33,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3137 transitions. [2023-08-27 11:46:33,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 261.4166666666667) internal successors, (3137), 12 states have internal predecessors, (3137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:33,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 597.0) internal successors, (7761), 13 states have internal predecessors, (7761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:33,294 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 597.0) internal successors, (7761), 13 states have internal predecessors, (7761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:33,295 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 234 flow. Second operand 12 states and 3137 transitions. [2023-08-27 11:46:33,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 96 transitions, 438 flow [2023-08-27 11:46:33,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 96 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 11:46:33,299 INFO L231 Difference]: Finished difference. Result has 112 places, 96 transitions, 316 flow [2023-08-27 11:46:33,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=316, PETRI_PLACES=112, PETRI_TRANSITIONS=96} [2023-08-27 11:46:33,299 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 26 predicate places. [2023-08-27 11:46:33,299 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 96 transitions, 316 flow [2023-08-27 11:46:33,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 255.53846153846155) internal successors, (3322), 13 states have internal predecessors, (3322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:33,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:33,300 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:33,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-27 11:46:33,505 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,SelfDestructingSolverStorable20 [2023-08-27 11:46:33,505 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:46:33,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:33,506 INFO L85 PathProgramCache]: Analyzing trace with hash -113041236, now seen corresponding path program 2 times [2023-08-27 11:46:33,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:33,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409377166] [2023-08-27 11:46:33,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:33,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:46:33,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:33,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409377166] [2023-08-27 11:46:33,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409377166] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:33,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:46:33,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 11:46:33,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263059524] [2023-08-27 11:46:33,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:33,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 11:46:33,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:33,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 11:46:33,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 11:46:33,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 597 [2023-08-27 11:46:33,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 96 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 221.5) internal successors, (1329), 6 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:33,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:33,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 597 [2023-08-27 11:46:33,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:36,926 INFO L124 PetriNetUnfolderBase]: 26298/42137 cut-off events. [2023-08-27 11:46:36,926 INFO L125 PetriNetUnfolderBase]: For 1385/1385 co-relation queries the response was YES. [2023-08-27 11:46:37,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84578 conditions, 42137 events. 26298/42137 cut-off events. For 1385/1385 co-relation queries the response was YES. Maximal size of possible extension queue 1669. Compared 345948 event pairs, 7963 based on Foata normal form. 0/29993 useless extension candidates. Maximal degree in co-relation 84500. Up to 25656 conditions per place. [2023-08-27 11:46:37,165 INFO L140 encePairwiseOnDemand]: 580/597 looper letters, 244 selfloop transitions, 25 changer transitions 0/281 dead transitions. [2023-08-27 11:46:37,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 281 transitions, 1280 flow [2023-08-27 11:46:37,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 11:46:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 11:46:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1808 transitions. [2023-08-27 11:46:37,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43263938741325675 [2023-08-27 11:46:37,167 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1808 transitions. [2023-08-27 11:46:37,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1808 transitions. [2023-08-27 11:46:37,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:37,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1808 transitions. [2023-08-27 11:46:37,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 258.2857142857143) internal successors, (1808), 7 states have internal predecessors, (1808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:37,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 597.0) internal successors, (4776), 8 states have internal predecessors, (4776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:37,173 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 597.0) internal successors, (4776), 8 states have internal predecessors, (4776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:37,173 INFO L175 Difference]: Start difference. First operand has 112 places, 96 transitions, 316 flow. Second operand 7 states and 1808 transitions. [2023-08-27 11:46:37,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 281 transitions, 1280 flow [2023-08-27 11:46:37,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 281 transitions, 1232 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-27 11:46:37,179 INFO L231 Difference]: Finished difference. Result has 117 places, 120 transitions, 440 flow [2023-08-27 11:46:37,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=117, PETRI_TRANSITIONS=120} [2023-08-27 11:46:37,180 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 31 predicate places. [2023-08-27 11:46:37,180 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 120 transitions, 440 flow [2023-08-27 11:46:37,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 221.5) internal successors, (1329), 6 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:37,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:37,180 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:37,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-27 11:46:37,181 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:46:37,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:37,181 INFO L85 PathProgramCache]: Analyzing trace with hash -658469694, now seen corresponding path program 1 times [2023-08-27 11:46:37,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:37,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903737301] [2023-08-27 11:46:37,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:37,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:37,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:37,239 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-27 11:46:37,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:37,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903737301] [2023-08-27 11:46:37,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903737301] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:37,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666437570] [2023-08-27 11:46:37,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:37,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:37,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:37,241 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-27 11:46:37,264 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-27 11:46:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:37,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-27 11:46:37,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:46:37,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 11:46:37,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666437570] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:37,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 11:46:37,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2023-08-27 11:46:37,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738011482] [2023-08-27 11:46:37,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:37,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 11:46:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:37,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 11:46:37,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-27 11:46:37,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:46:37,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 120 transitions, 440 flow. Second operand has 4 states, 4 states have (on average 256.25) internal successors, (1025), 4 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:37,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:37,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:46:37,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:40,303 INFO L124 PetriNetUnfolderBase]: 25296/40363 cut-off events. [2023-08-27 11:46:40,303 INFO L125 PetriNetUnfolderBase]: For 11207/11207 co-relation queries the response was YES. [2023-08-27 11:46:40,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94311 conditions, 40363 events. 25296/40363 cut-off events. For 11207/11207 co-relation queries the response was YES. Maximal size of possible extension queue 1626. Compared 335122 event pairs, 3368 based on Foata normal form. 0/31435 useless extension candidates. Maximal degree in co-relation 94252. Up to 32964 conditions per place. [2023-08-27 11:46:40,560 INFO L140 encePairwiseOnDemand]: 593/597 looper letters, 166 selfloop transitions, 3 changer transitions 0/181 dead transitions. [2023-08-27 11:46:40,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 181 transitions, 959 flow [2023-08-27 11:46:40,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 11:46:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 11:46:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1144 transitions. [2023-08-27 11:46:40,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47906197654941374 [2023-08-27 11:46:40,563 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1144 transitions. [2023-08-27 11:46:40,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1144 transitions. [2023-08-27 11:46:40,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:40,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1144 transitions. [2023-08-27 11:46:40,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:40,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 597.0) internal successors, (2985), 5 states have internal predecessors, (2985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:40,566 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 597.0) internal successors, (2985), 5 states have internal predecessors, (2985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:40,566 INFO L175 Difference]: Start difference. First operand has 117 places, 120 transitions, 440 flow. Second operand 4 states and 1144 transitions. [2023-08-27 11:46:40,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 181 transitions, 959 flow [2023-08-27 11:46:40,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 181 transitions, 959 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 11:46:40,591 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 442 flow [2023-08-27 11:46:40,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=442, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2023-08-27 11:46:40,592 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 33 predicate places. [2023-08-27 11:46:40,592 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 442 flow [2023-08-27 11:46:40,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 256.25) internal successors, (1025), 4 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:40,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:40,592 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:40,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-27 11:46:40,797 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,SelfDestructingSolverStorable22 [2023-08-27 11:46:40,798 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:46:40,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:40,798 INFO L85 PathProgramCache]: Analyzing trace with hash -658469634, now seen corresponding path program 1 times [2023-08-27 11:46:40,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:40,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210692727] [2023-08-27 11:46:40,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:40,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-27 11:46:40,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:40,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210692727] [2023-08-27 11:46:40,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210692727] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:40,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:46:40,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:46:40,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145565972] [2023-08-27 11:46:40,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:40,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:46:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:40,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:46:40,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:46:40,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:46:40,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:40,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:40,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:46:40,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:43,555 INFO L124 PetriNetUnfolderBase]: 24259/38600 cut-off events. [2023-08-27 11:46:43,555 INFO L125 PetriNetUnfolderBase]: For 9672/9672 co-relation queries the response was YES. [2023-08-27 11:46:43,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90720 conditions, 38600 events. 24259/38600 cut-off events. For 9672/9672 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 316741 event pairs, 2911 based on Foata normal form. 0/30505 useless extension candidates. Maximal degree in co-relation 90660. Up to 34517 conditions per place. [2023-08-27 11:46:43,832 INFO L140 encePairwiseOnDemand]: 593/597 looper letters, 146 selfloop transitions, 6 changer transitions 0/164 dead transitions. [2023-08-27 11:46:43,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 164 transitions, 886 flow [2023-08-27 11:46:43,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:46:43,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:46:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2023-08-27 11:46:43,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868788386376326 [2023-08-27 11:46:43,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 872 transitions. [2023-08-27 11:46:43,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 872 transitions. [2023-08-27 11:46:43,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:43,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 872 transitions. [2023-08-27 11:46:43,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:43,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 597.0) internal successors, (2388), 4 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:43,836 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 597.0) internal successors, (2388), 4 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:43,836 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 442 flow. Second operand 3 states and 872 transitions. [2023-08-27 11:46:43,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 164 transitions, 886 flow [2023-08-27 11:46:43,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 164 transitions, 882 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 11:46:43,861 INFO L231 Difference]: Finished difference. Result has 119 places, 119 transitions, 460 flow [2023-08-27 11:46:43,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=119, PETRI_TRANSITIONS=119} [2023-08-27 11:46:43,862 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 33 predicate places. [2023-08-27 11:46:43,862 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 119 transitions, 460 flow [2023-08-27 11:46:43,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:43,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:43,862 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:43,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-27 11:46:43,863 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:46:43,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:43,863 INFO L85 PathProgramCache]: Analyzing trace with hash -661917299, now seen corresponding path program 1 times [2023-08-27 11:46:43,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:43,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649655265] [2023-08-27 11:46:43,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:43,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:44,014 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:46:44,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:44,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649655265] [2023-08-27 11:46:44,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649655265] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:44,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259072947] [2023-08-27 11:46:44,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:44,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:44,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:44,016 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-27 11:46:44,028 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-27 11:46:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:44,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 11:46:44,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:44,147 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-27 11:46:44,215 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:46:44,216 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-27 11:46:44,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 13 treesize of output 15 [2023-08-27 11:46:44,271 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-27 11:46:44,286 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:46:44,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:46:52,308 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_785 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_785) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:46:54,317 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_785 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_785) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:46:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-27 11:46:54,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259072947] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:46:54,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:46:54,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-27 11:46:54,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094278255] [2023-08-27 11:46:54,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:46:54,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-27 11:46:54,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:54,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-27 11:46:54,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=80, Unknown=5, NotChecked=38, Total=156 [2023-08-27 11:46:54,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 597 [2023-08-27 11:46:54,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 119 transitions, 460 flow. Second operand has 13 states, 13 states have (on average 222.3846153846154) internal successors, (2891), 13 states have internal predecessors, (2891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:54,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:54,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 597 [2023-08-27 11:46:54,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:59,500 INFO L124 PetriNetUnfolderBase]: 23245/37410 cut-off events. [2023-08-27 11:46:59,500 INFO L125 PetriNetUnfolderBase]: For 17143/17214 co-relation queries the response was YES. [2023-08-27 11:46:59,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87342 conditions, 37410 events. 23245/37410 cut-off events. For 17143/17214 co-relation queries the response was YES. Maximal size of possible extension queue 1526. Compared 302133 event pairs, 6944 based on Foata normal form. 399/30023 useless extension candidates. Maximal degree in co-relation 87282. Up to 24014 conditions per place. [2023-08-27 11:46:59,782 INFO L140 encePairwiseOnDemand]: 583/597 looper letters, 222 selfloop transitions, 26 changer transitions 0/260 dead transitions. [2023-08-27 11:46:59,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 260 transitions, 1340 flow [2023-08-27 11:46:59,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 11:46:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 11:46:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1771 transitions. [2023-08-27 11:46:59,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.423785594639866 [2023-08-27 11:46:59,784 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1771 transitions. [2023-08-27 11:46:59,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1771 transitions. [2023-08-27 11:46:59,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:59,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1771 transitions. [2023-08-27 11:46:59,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 253.0) internal successors, (1771), 7 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:59,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 597.0) internal successors, (4776), 8 states have internal predecessors, (4776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:59,788 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 597.0) internal successors, (4776), 8 states have internal predecessors, (4776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:59,788 INFO L175 Difference]: Start difference. First operand has 119 places, 119 transitions, 460 flow. Second operand 7 states and 1771 transitions. [2023-08-27 11:46:59,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 260 transitions, 1340 flow [2023-08-27 11:46:59,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 260 transitions, 1327 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 11:46:59,879 INFO L231 Difference]: Finished difference. Result has 126 places, 123 transitions, 553 flow [2023-08-27 11:46:59,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=553, PETRI_PLACES=126, PETRI_TRANSITIONS=123} [2023-08-27 11:46:59,880 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 40 predicate places. [2023-08-27 11:46:59,880 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 123 transitions, 553 flow [2023-08-27 11:46:59,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 222.3846153846154) internal successors, (2891), 13 states have internal predecessors, (2891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:59,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:59,880 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:59,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-27 11:47:00,086 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,SelfDestructingSolverStorable24 [2023-08-27 11:47:00,086 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:47:00,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:00,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1411555860, now seen corresponding path program 1 times [2023-08-27 11:47:00,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:00,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257343315] [2023-08-27 11:47:00,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:00,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:00,224 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-27 11:47:00,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:00,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257343315] [2023-08-27 11:47:00,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257343315] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:47:00,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046773149] [2023-08-27 11:47:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:00,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:00,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:47:00,229 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-27 11:47:00,233 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-27 11:47:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:00,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 11:47:00,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:47:00,368 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-27 11:47:00,416 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:47:00,417 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-27 11:47:00,431 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-27 11:47:00,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 13 treesize of output 15 [2023-08-27 11:47:00,481 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-27 11:47:00,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:47:12,522 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_850 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_850) |c_~#a~0.base|))) is different from false [2023-08-27 11:47:12,583 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-27 11:47:12,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046773149] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:47:12,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:47:12,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-27 11:47:12,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757522269] [2023-08-27 11:47:12,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:47:12,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-27 11:47:12,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:12,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-27 11:47:12,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=4, NotChecked=18, Total=132 [2023-08-27 11:47:12,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 597 [2023-08-27 11:47:12,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 123 transitions, 553 flow. Second operand has 12 states, 12 states have (on average 222.75) internal successors, (2673), 12 states have internal predecessors, (2673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:12,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:12,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 597 [2023-08-27 11:47:12,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:18,636 WARN L234 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 21 DAG size of output: 19 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:47:21,711 INFO L124 PetriNetUnfolderBase]: 23698/38378 cut-off events. [2023-08-27 11:47:21,711 INFO L125 PetriNetUnfolderBase]: For 24696/24696 co-relation queries the response was YES. [2023-08-27 11:47:21,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93508 conditions, 38378 events. 23698/38378 cut-off events. For 24696/24696 co-relation queries the response was YES. Maximal size of possible extension queue 1697. Compared 309860 event pairs, 7258 based on Foata normal form. 0/31010 useless extension candidates. Maximal degree in co-relation 93444. Up to 26499 conditions per place. [2023-08-27 11:47:22,000 INFO L140 encePairwiseOnDemand]: 580/597 looper letters, 219 selfloop transitions, 40 changer transitions 0/271 dead transitions. [2023-08-27 11:47:22,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 271 transitions, 1605 flow [2023-08-27 11:47:22,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 11:47:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 11:47:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1984 transitions. [2023-08-27 11:47:22,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4154103852596315 [2023-08-27 11:47:22,003 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1984 transitions. [2023-08-27 11:47:22,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1984 transitions. [2023-08-27 11:47:22,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:22,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1984 transitions. [2023-08-27 11:47:22,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:22,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 597.0) internal successors, (5373), 9 states have internal predecessors, (5373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:22,007 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 597.0) internal successors, (5373), 9 states have internal predecessors, (5373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:22,007 INFO L175 Difference]: Start difference. First operand has 126 places, 123 transitions, 553 flow. Second operand 8 states and 1984 transitions. [2023-08-27 11:47:22,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 271 transitions, 1605 flow [2023-08-27 11:47:22,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 271 transitions, 1547 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-27 11:47:22,070 INFO L231 Difference]: Finished difference. Result has 135 places, 145 transitions, 815 flow [2023-08-27 11:47:22,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=815, PETRI_PLACES=135, PETRI_TRANSITIONS=145} [2023-08-27 11:47:22,071 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 49 predicate places. [2023-08-27 11:47:22,071 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 145 transitions, 815 flow [2023-08-27 11:47:22,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 222.75) internal successors, (2673), 12 states have internal predecessors, (2673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:22,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:22,071 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:22,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-27 11:47:22,276 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,SelfDestructingSolverStorable25 [2023-08-27 11:47:22,277 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:47:22,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:22,277 INFO L85 PathProgramCache]: Analyzing trace with hash 666478715, now seen corresponding path program 1 times [2023-08-27 11:47:22,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:22,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889279851] [2023-08-27 11:47:22,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:22,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:47:22,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:22,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889279851] [2023-08-27 11:47:22,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889279851] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:47:22,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:47:22,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 11:47:22,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910038152] [2023-08-27 11:47:22,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:47:22,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 11:47:22,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:22,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 11:47:22,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-27 11:47:22,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 597 [2023-08-27 11:47:22,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 145 transitions, 815 flow. Second operand has 8 states, 8 states have (on average 215.5) internal successors, (1724), 8 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:22,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:22,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 597 [2023-08-27 11:47:22,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:26,822 INFO L124 PetriNetUnfolderBase]: 31140/49720 cut-off events. [2023-08-27 11:47:26,822 INFO L125 PetriNetUnfolderBase]: For 44680/44691 co-relation queries the response was YES. [2023-08-27 11:47:27,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130090 conditions, 49720 events. 31140/49720 cut-off events. For 44680/44691 co-relation queries the response was YES. Maximal size of possible extension queue 2226. Compared 409937 event pairs, 8080 based on Foata normal form. 2/41142 useless extension candidates. Maximal degree in co-relation 130021. Up to 26853 conditions per place. [2023-08-27 11:47:27,192 INFO L140 encePairwiseOnDemand]: 580/597 looper letters, 427 selfloop transitions, 84 changer transitions 0/523 dead transitions. [2023-08-27 11:47:27,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 523 transitions, 3244 flow [2023-08-27 11:47:27,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-27 11:47:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-27 11:47:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3451 transitions. [2023-08-27 11:47:27,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4128978224455611 [2023-08-27 11:47:27,199 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3451 transitions. [2023-08-27 11:47:27,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3451 transitions. [2023-08-27 11:47:27,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:27,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3451 transitions. [2023-08-27 11:47:27,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 246.5) internal successors, (3451), 14 states have internal predecessors, (3451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:27,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 597.0) internal successors, (8955), 15 states have internal predecessors, (8955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:27,206 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 597.0) internal successors, (8955), 15 states have internal predecessors, (8955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:27,207 INFO L175 Difference]: Start difference. First operand has 135 places, 145 transitions, 815 flow. Second operand 14 states and 3451 transitions. [2023-08-27 11:47:27,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 523 transitions, 3244 flow [2023-08-27 11:47:27,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 523 transitions, 3244 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 11:47:27,317 INFO L231 Difference]: Finished difference. Result has 154 places, 187 transitions, 1467 flow [2023-08-27 11:47:27,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1467, PETRI_PLACES=154, PETRI_TRANSITIONS=187} [2023-08-27 11:47:27,318 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 68 predicate places. [2023-08-27 11:47:27,318 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 187 transitions, 1467 flow [2023-08-27 11:47:27,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 215.5) internal successors, (1724), 8 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:27,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:27,319 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:27,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-27 11:47:27,319 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:47:27,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash 666478716, now seen corresponding path program 1 times [2023-08-27 11:47:27,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:27,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748696407] [2023-08-27 11:47:27,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:27,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:47:27,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:27,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748696407] [2023-08-27 11:47:27,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748696407] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:47:27,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:47:27,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 11:47:27,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495643192] [2023-08-27 11:47:27,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:47:27,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 11:47:27,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:27,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 11:47:27,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 11:47:27,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 597 [2023-08-27 11:47:27,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 187 transitions, 1467 flow. Second operand has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:27,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:27,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 597 [2023-08-27 11:47:27,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:33,737 INFO L124 PetriNetUnfolderBase]: 39498/63689 cut-off events. [2023-08-27 11:47:33,737 INFO L125 PetriNetUnfolderBase]: For 109922/109925 co-relation queries the response was YES. [2023-08-27 11:47:34,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186201 conditions, 63689 events. 39498/63689 cut-off events. For 109922/109925 co-relation queries the response was YES. Maximal size of possible extension queue 2725. Compared 545440 event pairs, 15304 based on Foata normal form. 1155/56585 useless extension candidates. Maximal degree in co-relation 186124. Up to 26023 conditions per place. [2023-08-27 11:47:34,299 INFO L140 encePairwiseOnDemand]: 587/597 looper letters, 331 selfloop transitions, 42 changer transitions 0/385 dead transitions. [2023-08-27 11:47:34,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 385 transitions, 3333 flow [2023-08-27 11:47:34,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 11:47:34,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 11:47:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1363 transitions. [2023-08-27 11:47:34,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4566164154103853 [2023-08-27 11:47:34,301 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1363 transitions. [2023-08-27 11:47:34,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1363 transitions. [2023-08-27 11:47:34,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:34,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1363 transitions. [2023-08-27 11:47:34,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 272.6) internal successors, (1363), 5 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:34,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 597.0) internal successors, (3582), 6 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:34,305 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 597.0) internal successors, (3582), 6 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:34,305 INFO L175 Difference]: Start difference. First operand has 154 places, 187 transitions, 1467 flow. Second operand 5 states and 1363 transitions. [2023-08-27 11:47:34,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 385 transitions, 3333 flow [2023-08-27 11:47:35,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 385 transitions, 3167 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-08-27 11:47:35,135 INFO L231 Difference]: Finished difference. Result has 158 places, 206 transitions, 1746 flow [2023-08-27 11:47:35,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1746, PETRI_PLACES=158, PETRI_TRANSITIONS=206} [2023-08-27 11:47:35,136 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 72 predicate places. [2023-08-27 11:47:35,136 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 206 transitions, 1746 flow [2023-08-27 11:47:35,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:35,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:35,136 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:35,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-08-27 11:47:35,136 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:47:35,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:35,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1186099874, now seen corresponding path program 1 times [2023-08-27 11:47:35,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:35,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720157870] [2023-08-27 11:47:35,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:35,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:47:35,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:35,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720157870] [2023-08-27 11:47:35,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720157870] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:47:35,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442933145] [2023-08-27 11:47:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:35,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:35,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:47:35,545 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-27 11:47:35,553 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-27 11:47:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:35,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-27 11:47:35,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:47:35,699 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-27 11:47:35,750 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:47:35,750 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-27 11:47:35,758 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-27 11:47:35,828 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 27 treesize of output 20 [2023-08-27 11:47:35,869 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-27 11:47:35,890 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:47:35,890 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:47:35,933 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_998 Int)) (or (< v_ArrVal_998 (+ |c_t_funThread1of2ForFork0_#t~post36#1| 1)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_998)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_999) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)))) is different from false [2023-08-27 11:47:35,943 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_998 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_998)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_999) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_998 (+ (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|) 1))))) is different from false [2023-08-27 11:47:35,969 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_999 (Array Int Int)) (v_ArrVal_998 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (or (< v_ArrVal_998 (+ (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_998)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_999) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648))))) is different from false [2023-08-27 11:47:35,994 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_996 (Array Int Int)) (v_ArrVal_999 (Array Int Int)) (v_ArrVal_998 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_996))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_998)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_999) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_998 (+ (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|) 1)))))) is different from false [2023-08-27 11:47:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-27 11:47:36,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442933145] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:47:36,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:47:36,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 17 [2023-08-27 11:47:36,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849380599] [2023-08-27 11:47:36,135 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:47:36,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 11:47:36,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:36,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 11:47:36,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=163, Unknown=6, NotChecked=116, Total=342 [2023-08-27 11:47:36,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 597 [2023-08-27 11:47:36,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 206 transitions, 1746 flow. Second operand has 19 states, 19 states have (on average 215.89473684210526) internal successors, (4102), 19 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:36,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:36,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 597 [2023-08-27 11:47:36,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:45,279 INFO L124 PetriNetUnfolderBase]: 45097/73108 cut-off events. [2023-08-27 11:47:45,279 INFO L125 PetriNetUnfolderBase]: For 170113/170116 co-relation queries the response was YES. [2023-08-27 11:47:45,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231357 conditions, 73108 events. 45097/73108 cut-off events. For 170113/170116 co-relation queries the response was YES. Maximal size of possible extension queue 3142. Compared 644665 event pairs, 11182 based on Foata normal form. 856/64510 useless extension candidates. Maximal degree in co-relation 231278. Up to 34150 conditions per place. [2023-08-27 11:47:46,057 INFO L140 encePairwiseOnDemand]: 580/597 looper letters, 679 selfloop transitions, 204 changer transitions 14/909 dead transitions. [2023-08-27 11:47:46,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 909 transitions, 7003 flow [2023-08-27 11:47:46,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-27 11:47:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-27 11:47:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5208 transitions. [2023-08-27 11:47:46,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4154103852596315 [2023-08-27 11:47:46,064 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 5208 transitions. [2023-08-27 11:47:46,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 5208 transitions. [2023-08-27 11:47:46,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:46,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 5208 transitions. [2023-08-27 11:47:46,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 248.0) internal successors, (5208), 21 states have internal predecessors, (5208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:46,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 597.0) internal successors, (13134), 22 states have internal predecessors, (13134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:46,083 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 597.0) internal successors, (13134), 22 states have internal predecessors, (13134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:46,083 INFO L175 Difference]: Start difference. First operand has 158 places, 206 transitions, 1746 flow. Second operand 21 states and 5208 transitions. [2023-08-27 11:47:46,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 909 transitions, 7003 flow [2023-08-27 11:47:47,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 909 transitions, 7003 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 11:47:47,098 INFO L231 Difference]: Finished difference. Result has 190 places, 343 transitions, 3927 flow [2023-08-27 11:47:47,099 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=1746, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3927, PETRI_PLACES=190, PETRI_TRANSITIONS=343} [2023-08-27 11:47:47,099 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 104 predicate places. [2023-08-27 11:47:47,099 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 343 transitions, 3927 flow [2023-08-27 11:47:47,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 215.89473684210526) internal successors, (4102), 19 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:47,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:47,100 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:47,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-27 11:47:47,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:47,456 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:47:47,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:47,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1192715918, now seen corresponding path program 1 times [2023-08-27 11:47:47,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:47,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480678328] [2023-08-27 11:47:47,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:47,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:47,496 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:47:47,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:47,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480678328] [2023-08-27 11:47:47,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480678328] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:47:47,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042280419] [2023-08-27 11:47:47,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:47,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:47,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:47:47,498 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-27 11:47:47,519 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-27 11:47:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:47,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 11:47:47,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:47:47,652 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:47:47,652 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:47:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:47:47,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042280419] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:47:47,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:47:47,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-27 11:47:47,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000857150] [2023-08-27 11:47:47,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:47:47,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 11:47:47,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:47,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 11:47:47,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 11:47:47,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:47:47,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 343 transitions, 3927 flow. Second operand has 7 states, 7 states have (on average 257.2857142857143) internal successors, (1801), 7 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:47,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:47,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:47:47,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:48,607 INFO L124 PetriNetUnfolderBase]: 3884/7203 cut-off events. [2023-08-27 11:47:48,607 INFO L125 PetriNetUnfolderBase]: For 49682/49686 co-relation queries the response was YES. [2023-08-27 11:47:48,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32882 conditions, 7203 events. 3884/7203 cut-off events. For 49682/49686 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 55231 event pairs, 490 based on Foata normal form. 819/7409 useless extension candidates. Maximal degree in co-relation 32789. Up to 4957 conditions per place. [2023-08-27 11:47:48,663 INFO L140 encePairwiseOnDemand]: 594/597 looper letters, 282 selfloop transitions, 3 changer transitions 12/306 dead transitions. [2023-08-27 11:47:48,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 306 transitions, 4046 flow [2023-08-27 11:47:48,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 11:47:48,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 11:47:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1370 transitions. [2023-08-27 11:47:48,665 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45896147403685095 [2023-08-27 11:47:48,665 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1370 transitions. [2023-08-27 11:47:48,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1370 transitions. [2023-08-27 11:47:48,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:48,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1370 transitions. [2023-08-27 11:47:48,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 274.0) internal successors, (1370), 5 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:48,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 597.0) internal successors, (3582), 6 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:48,669 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 597.0) internal successors, (3582), 6 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:48,670 INFO L175 Difference]: Start difference. First operand has 190 places, 343 transitions, 3927 flow. Second operand 5 states and 1370 transitions. [2023-08-27 11:47:48,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 306 transitions, 4046 flow [2023-08-27 11:47:48,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 306 transitions, 3618 flow, removed 169 selfloop flow, removed 13 redundant places. [2023-08-27 11:47:48,987 INFO L231 Difference]: Finished difference. Result has 146 places, 170 transitions, 1702 flow [2023-08-27 11:47:48,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=1771, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1702, PETRI_PLACES=146, PETRI_TRANSITIONS=170} [2023-08-27 11:47:48,990 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 60 predicate places. [2023-08-27 11:47:48,990 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 170 transitions, 1702 flow [2023-08-27 11:47:48,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 257.2857142857143) internal successors, (1801), 7 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:48,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:48,990 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:48,996 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-27 11:47:49,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:49,196 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:47:49,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:49,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2037277619, now seen corresponding path program 1 times [2023-08-27 11:47:49,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:49,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303183478] [2023-08-27 11:47:49,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:49,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:47:49,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:49,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303183478] [2023-08-27 11:47:49,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303183478] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:47:49,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095086182] [2023-08-27 11:47:49,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:49,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:49,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:47:49,409 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-27 11:47:49,437 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-27 11:47:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:49,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-27 11:47:49,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:47:49,621 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:47:49,622 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-27 11:47:49,681 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-27 11:47:49,717 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-27 11:47:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:47:49,734 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:47:49,754 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1146 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1146) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 2147483649)) is different from false [2023-08-27 11:47:49,766 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:47:49,766 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-08-27 11:47:49,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2023-08-27 11:47:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-27 11:47:49,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095086182] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:47:49,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:47:49,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-27 11:47:49,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532262681] [2023-08-27 11:47:49,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:47:49,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-27 11:47:49,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:49,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-27 11:47:49,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=282, Unknown=1, NotChecked=34, Total=380 [2023-08-27 11:47:49,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 597 [2023-08-27 11:47:49,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 170 transitions, 1702 flow. Second operand has 20 states, 20 states have (on average 216.1) internal successors, (4322), 20 states have internal predecessors, (4322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:49,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:49,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 597 [2023-08-27 11:47:49,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:51,475 INFO L124 PetriNetUnfolderBase]: 3975/7446 cut-off events. [2023-08-27 11:47:51,475 INFO L125 PetriNetUnfolderBase]: For 48344/48346 co-relation queries the response was YES. [2023-08-27 11:47:51,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31708 conditions, 7446 events. 3975/7446 cut-off events. For 48344/48346 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 58708 event pairs, 931 based on Foata normal form. 66/6849 useless extension candidates. Maximal degree in co-relation 31624. Up to 1868 conditions per place. [2023-08-27 11:47:51,517 INFO L140 encePairwiseOnDemand]: 583/597 looper letters, 217 selfloop transitions, 92 changer transitions 37/355 dead transitions. [2023-08-27 11:47:51,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 355 transitions, 3583 flow [2023-08-27 11:47:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-27 11:47:51,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-27 11:47:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4297 transitions. [2023-08-27 11:47:51,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37882394428281757 [2023-08-27 11:47:51,520 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4297 transitions. [2023-08-27 11:47:51,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4297 transitions. [2023-08-27 11:47:51,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:51,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4297 transitions. [2023-08-27 11:47:51,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 226.1578947368421) internal successors, (4297), 19 states have internal predecessors, (4297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:51,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 597.0) internal successors, (11940), 20 states have internal predecessors, (11940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:51,534 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 597.0) internal successors, (11940), 20 states have internal predecessors, (11940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:51,534 INFO L175 Difference]: Start difference. First operand has 146 places, 170 transitions, 1702 flow. Second operand 19 states and 4297 transitions. [2023-08-27 11:47:51,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 355 transitions, 3583 flow [2023-08-27 11:47:51,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 355 transitions, 3472 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-27 11:47:51,690 INFO L231 Difference]: Finished difference. Result has 164 places, 178 transitions, 2003 flow [2023-08-27 11:47:51,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=1599, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2003, PETRI_PLACES=164, PETRI_TRANSITIONS=178} [2023-08-27 11:47:51,690 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 78 predicate places. [2023-08-27 11:47:51,691 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 178 transitions, 2003 flow [2023-08-27 11:47:51,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 216.1) internal successors, (4322), 20 states have internal predecessors, (4322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:51,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:51,691 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:51,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-27 11:47:51,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:51,897 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:47:51,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:51,898 INFO L85 PathProgramCache]: Analyzing trace with hash 470231585, now seen corresponding path program 1 times [2023-08-27 11:47:51,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:51,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011349829] [2023-08-27 11:47:51,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:51,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:51,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:52,094 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-27 11:47:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011349829] [2023-08-27 11:47:52,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011349829] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:47:52,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324855443] [2023-08-27 11:47:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:52,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:52,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:47:52,096 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-27 11:47:52,121 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-27 11:47:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:52,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-27 11:47:52,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:47:52,252 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-27 11:47:52,299 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:47:52,299 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-27 11:47:52,317 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-27 11:47:52,333 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-27 11:47:52,393 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 27 treesize of output 20 [2023-08-27 11:47:52,426 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-27 11:47:52,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:47:52,496 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_1223 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1223) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|)))) is different from false [2023-08-27 11:47:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-27 11:47:52,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324855443] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:47:52,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:47:52,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2023-08-27 11:47:52,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698992831] [2023-08-27 11:47:52,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:47:52,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 11:47:52,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:52,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 11:47:52,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=245, Unknown=1, NotChecked=32, Total=342 [2023-08-27 11:47:52,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 597 [2023-08-27 11:47:52,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 178 transitions, 2003 flow. Second operand has 19 states, 19 states have (on average 220.10526315789474) internal successors, (4182), 19 states have internal predecessors, (4182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:52,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:52,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 597 [2023-08-27 11:47:52,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:53,753 INFO L124 PetriNetUnfolderBase]: 3393/6545 cut-off events. [2023-08-27 11:47:53,753 INFO L125 PetriNetUnfolderBase]: For 49295/49351 co-relation queries the response was YES. [2023-08-27 11:47:53,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29240 conditions, 6545 events. 3393/6545 cut-off events. For 49295/49351 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 51103 event pairs, 746 based on Foata normal form. 14/5952 useless extension candidates. Maximal degree in co-relation 29153. Up to 3444 conditions per place. [2023-08-27 11:47:53,800 INFO L140 encePairwiseOnDemand]: 584/597 looper letters, 277 selfloop transitions, 106 changer transitions 6/398 dead transitions. [2023-08-27 11:47:53,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 398 transitions, 5207 flow [2023-08-27 11:47:53,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 11:47:53,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 11:47:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2561 transitions. [2023-08-27 11:47:53,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38998020405055583 [2023-08-27 11:47:53,804 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2561 transitions. [2023-08-27 11:47:53,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2561 transitions. [2023-08-27 11:47:53,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:53,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2561 transitions. [2023-08-27 11:47:53,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 232.8181818181818) internal successors, (2561), 11 states have internal predecessors, (2561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:53,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 597.0) internal successors, (7164), 12 states have internal predecessors, (7164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:53,811 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 597.0) internal successors, (7164), 12 states have internal predecessors, (7164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:53,811 INFO L175 Difference]: Start difference. First operand has 164 places, 178 transitions, 2003 flow. Second operand 11 states and 2561 transitions. [2023-08-27 11:47:53,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 398 transitions, 5207 flow [2023-08-27 11:47:53,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 398 transitions, 4794 flow, removed 88 selfloop flow, removed 12 redundant places. [2023-08-27 11:47:53,976 INFO L231 Difference]: Finished difference. Result has 167 places, 248 transitions, 3277 flow [2023-08-27 11:47:53,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=1811, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3277, PETRI_PLACES=167, PETRI_TRANSITIONS=248} [2023-08-27 11:47:53,976 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 81 predicate places. [2023-08-27 11:47:53,977 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 248 transitions, 3277 flow [2023-08-27 11:47:53,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 220.10526315789474) internal successors, (4182), 19 states have internal predecessors, (4182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:53,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:53,977 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:53,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-27 11:47:54,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:54,178 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:47:54,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:54,179 INFO L85 PathProgramCache]: Analyzing trace with hash 470231627, now seen corresponding path program 1 times [2023-08-27 11:47:54,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:54,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329313601] [2023-08-27 11:47:54,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:54,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:54,271 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-27 11:47:54,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:54,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329313601] [2023-08-27 11:47:54,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329313601] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:47:54,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:47:54,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:47:54,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58649717] [2023-08-27 11:47:54,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:47:54,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:47:54,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:54,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:47:54,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:47:54,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 597 [2023-08-27 11:47:54,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 248 transitions, 3277 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:54,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:54,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 597 [2023-08-27 11:47:54,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:55,061 INFO L124 PetriNetUnfolderBase]: 3310/6448 cut-off events. [2023-08-27 11:47:55,061 INFO L125 PetriNetUnfolderBase]: For 60308/60336 co-relation queries the response was YES. [2023-08-27 11:47:55,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31399 conditions, 6448 events. 3310/6448 cut-off events. For 60308/60336 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 50739 event pairs, 1629 based on Foata normal form. 160/6398 useless extension candidates. Maximal degree in co-relation 31311. Up to 4330 conditions per place. [2023-08-27 11:47:55,107 INFO L140 encePairwiseOnDemand]: 590/597 looper letters, 238 selfloop transitions, 61 changer transitions 3/311 dead transitions. [2023-08-27 11:47:55,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 311 transitions, 4698 flow [2023-08-27 11:47:55,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:47:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:47:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2023-08-27 11:47:55,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42936906756002235 [2023-08-27 11:47:55,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 769 transitions. [2023-08-27 11:47:55,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 769 transitions. [2023-08-27 11:47:55,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:55,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 769 transitions. [2023-08-27 11:47:55,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 256.3333333333333) internal successors, (769), 3 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:55,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 597.0) internal successors, (2388), 4 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:55,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 597.0) internal successors, (2388), 4 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:55,110 INFO L175 Difference]: Start difference. First operand has 167 places, 248 transitions, 3277 flow. Second operand 3 states and 769 transitions. [2023-08-27 11:47:55,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 311 transitions, 4698 flow [2023-08-27 11:47:55,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 311 transitions, 4505 flow, removed 60 selfloop flow, removed 5 redundant places. [2023-08-27 11:47:55,253 INFO L231 Difference]: Finished difference. Result has 166 places, 265 transitions, 3713 flow [2023-08-27 11:47:55,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=3068, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3713, PETRI_PLACES=166, PETRI_TRANSITIONS=265} [2023-08-27 11:47:55,253 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 80 predicate places. [2023-08-27 11:47:55,253 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 265 transitions, 3713 flow [2023-08-27 11:47:55,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:55,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:55,254 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:55,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-08-27 11:47:55,254 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:47:55,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:55,254 INFO L85 PathProgramCache]: Analyzing trace with hash 537923775, now seen corresponding path program 1 times [2023-08-27 11:47:55,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:55,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733812919] [2023-08-27 11:47:55,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:55,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:55,374 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-27 11:47:55,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:55,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733812919] [2023-08-27 11:47:55,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733812919] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:47:55,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:47:55,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 11:47:55,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530513273] [2023-08-27 11:47:55,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:47:55,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 11:47:55,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:55,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 11:47:55,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-27 11:47:55,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 597 [2023-08-27 11:47:55,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 265 transitions, 3713 flow. Second operand has 5 states, 5 states have (on average 225.2) internal successors, (1126), 5 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:55,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:55,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 597 [2023-08-27 11:47:55,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:55,933 INFO L124 PetriNetUnfolderBase]: 1733/3640 cut-off events. [2023-08-27 11:47:55,933 INFO L125 PetriNetUnfolderBase]: For 39552/39552 co-relation queries the response was YES. [2023-08-27 11:47:55,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17919 conditions, 3640 events. 1733/3640 cut-off events. For 39552/39552 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 26281 event pairs, 471 based on Foata normal form. 412/3836 useless extension candidates. Maximal degree in co-relation 17833. Up to 1989 conditions per place. [2023-08-27 11:47:55,958 INFO L140 encePairwiseOnDemand]: 583/597 looper letters, 174 selfloop transitions, 19 changer transitions 18/217 dead transitions. [2023-08-27 11:47:55,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 217 transitions, 3079 flow [2023-08-27 11:47:55,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 11:47:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 11:47:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 974 transitions. [2023-08-27 11:47:55,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40787269681742044 [2023-08-27 11:47:55,960 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 974 transitions. [2023-08-27 11:47:55,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 974 transitions. [2023-08-27 11:47:55,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:55,960 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 974 transitions. [2023-08-27 11:47:55,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 243.5) internal successors, (974), 4 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:55,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 597.0) internal successors, (2985), 5 states have internal predecessors, (2985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:55,962 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 597.0) internal successors, (2985), 5 states have internal predecessors, (2985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:55,962 INFO L175 Difference]: Start difference. First operand has 166 places, 265 transitions, 3713 flow. Second operand 4 states and 974 transitions. [2023-08-27 11:47:55,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 217 transitions, 3079 flow [2023-08-27 11:47:56,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 217 transitions, 2767 flow, removed 103 selfloop flow, removed 8 redundant places. [2023-08-27 11:47:56,033 INFO L231 Difference]: Finished difference. Result has 154 places, 151 transitions, 1658 flow [2023-08-27 11:47:56,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=1564, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1658, PETRI_PLACES=154, PETRI_TRANSITIONS=151} [2023-08-27 11:47:56,033 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 68 predicate places. [2023-08-27 11:47:56,033 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 151 transitions, 1658 flow [2023-08-27 11:47:56,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 225.2) internal successors, (1126), 5 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:56,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:56,033 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:56,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-08-27 11:47:56,034 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:47:56,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:56,034 INFO L85 PathProgramCache]: Analyzing trace with hash 558400526, now seen corresponding path program 1 times [2023-08-27 11:47:56,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:56,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324689920] [2023-08-27 11:47:56,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:56,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:56,348 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-27 11:47:56,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:56,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324689920] [2023-08-27 11:47:56,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324689920] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:47:56,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923188627] [2023-08-27 11:47:56,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:56,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:56,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:47:56,353 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-27 11:47:56,377 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-27 11:47:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:56,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-27 11:47:56,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:47:56,513 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-27 11:47:56,578 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:47:56,582 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-27 11:47:56,600 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-27 11:47:56,625 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-27 11:47:56,644 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-27 11:47:56,694 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:47:56,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-27 11:47:56,740 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-27 11:47:56,780 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-27 11:47:56,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:47:56,850 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-27 11:47:56,854 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-27 11:48:04,979 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-27 11:48:04,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923188627] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:48:04,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:48:04,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2023-08-27 11:48:04,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120586787] [2023-08-27 11:48:04,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:48:04,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 11:48:04,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:48:04,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 11:48:04,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=242, Unknown=3, NotChecked=0, Total=306 [2023-08-27 11:48:04,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 597 [2023-08-27 11:48:04,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 151 transitions, 1658 flow. Second operand has 18 states, 18 states have (on average 196.66666666666666) internal successors, (3540), 18 states have internal predecessors, (3540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:04,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:48:04,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 597 [2023-08-27 11:48:04,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:48:06,047 INFO L124 PetriNetUnfolderBase]: 2282/4787 cut-off events. [2023-08-27 11:48:06,047 INFO L125 PetriNetUnfolderBase]: For 37438/37450 co-relation queries the response was YES. [2023-08-27 11:48:06,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23245 conditions, 4787 events. 2282/4787 cut-off events. For 37438/37450 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 36854 event pairs, 459 based on Foata normal form. 63/4513 useless extension candidates. Maximal degree in co-relation 23160. Up to 2534 conditions per place. [2023-08-27 11:48:06,083 INFO L140 encePairwiseOnDemand]: 583/597 looper letters, 219 selfloop transitions, 61 changer transitions 11/297 dead transitions. [2023-08-27 11:48:06,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 297 transitions, 3540 flow [2023-08-27 11:48:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-27 11:48:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-27 11:48:06,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3076 transitions. [2023-08-27 11:48:06,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34349525404801784 [2023-08-27 11:48:06,085 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3076 transitions. [2023-08-27 11:48:06,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3076 transitions. [2023-08-27 11:48:06,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:48:06,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3076 transitions. [2023-08-27 11:48:06,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 205.06666666666666) internal successors, (3076), 15 states have internal predecessors, (3076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:06,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 597.0) internal successors, (9552), 16 states have internal predecessors, (9552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:06,092 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 597.0) internal successors, (9552), 16 states have internal predecessors, (9552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:06,092 INFO L175 Difference]: Start difference. First operand has 154 places, 151 transitions, 1658 flow. Second operand 15 states and 3076 transitions. [2023-08-27 11:48:06,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 297 transitions, 3540 flow [2023-08-27 11:48:06,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 297 transitions, 3527 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-27 11:48:06,181 INFO L231 Difference]: Finished difference. Result has 171 places, 192 transitions, 2419 flow [2023-08-27 11:48:06,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2419, PETRI_PLACES=171, PETRI_TRANSITIONS=192} [2023-08-27 11:48:06,181 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 85 predicate places. [2023-08-27 11:48:06,181 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 192 transitions, 2419 flow [2023-08-27 11:48:06,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 196.66666666666666) internal successors, (3540), 18 states have internal predecessors, (3540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:06,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:48:06,182 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:48:06,189 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-27 11:48:06,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:48:06,382 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:48:06,382 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:48:06,383 INFO L85 PathProgramCache]: Analyzing trace with hash 485417732, now seen corresponding path program 2 times [2023-08-27 11:48:06,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:48:06,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228393600] [2023-08-27 11:48:06,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:48:06,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:48:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:48:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 11:48:09,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:48:09,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228393600] [2023-08-27 11:48:09,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228393600] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:48:09,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121935853] [2023-08-27 11:48:09,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 11:48:09,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:48:09,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:48:09,425 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-27 11:48:09,429 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-27 11:48:09,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 11:48:09,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:48:09,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-27 11:48:09,585 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:48:09,592 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-27 11:48:09,681 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:48:09,681 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-27 11:48:09,721 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-27 11:48:09,744 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-27 11:48:09,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:48:09,808 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-27 11:48:09,845 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-27 11:48:09,911 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-27 11:48:09,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:48:09,962 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-27 11:48:10,020 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:48:10,021 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-27 11:48:10,072 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:48:10,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:48:10,123 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1471 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1471) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_83|)) 0)) (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) 0))) is different from false [2023-08-27 11:48:10,198 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1470 Int) (v_ArrVal_1468 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1471 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1471) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_83|)) 0)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1468))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1470))) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) 0))) is different from false [2023-08-27 11:48:10,238 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:48:10,238 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-27 11:48:10,250 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:48:10,250 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-27 11:48:10,254 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-27 11:48:10,275 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1470 Int) (v_ArrVal_1468 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1468) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83| v_ArrVal_1470) |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_83| |v_t_funThread2of2ForFork0_~p~0#1.offset_83|))) (or (forall ((v_ArrVal_1470 Int) (v_ArrVal_1468 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_83| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1468) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_83| v_ArrVal_1470) |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-27 11:48:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-27 11:48:12,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121935853] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:48:12,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:48:12,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 30 [2023-08-27 11:48:12,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631275748] [2023-08-27 11:48:12,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:48:12,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-27 11:48:12,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:48:12,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-27 11:48:12,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=676, Unknown=4, NotChecked=168, Total=992 [2023-08-27 11:48:12,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 597 [2023-08-27 11:48:12,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 192 transitions, 2419 flow. Second operand has 32 states, 32 states have (on average 194.875) internal successors, (6236), 32 states have internal predecessors, (6236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:12,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:48:12,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 597 [2023-08-27 11:48:12,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:48:14,527 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1470 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_83| Int) (v_ArrVal_1471 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1471) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_83|)) 0)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1470)) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_83|) 0))) (= (select (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:48:15,216 INFO L124 PetriNetUnfolderBase]: 2483/5198 cut-off events. [2023-08-27 11:48:15,216 INFO L125 PetriNetUnfolderBase]: For 46439/46457 co-relation queries the response was YES. [2023-08-27 11:48:15,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26298 conditions, 5198 events. 2483/5198 cut-off events. For 46439/46457 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 40548 event pairs, 414 based on Foata normal form. 48/4870 useless extension candidates. Maximal degree in co-relation 26208. Up to 2436 conditions per place. [2023-08-27 11:48:15,257 INFO L140 encePairwiseOnDemand]: 580/597 looper letters, 210 selfloop transitions, 107 changer transitions 8/331 dead transitions. [2023-08-27 11:48:15,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 331 transitions, 4290 flow [2023-08-27 11:48:15,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-27 11:48:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-27 11:48:15,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5015 transitions. [2023-08-27 11:48:15,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33601340033500837 [2023-08-27 11:48:15,262 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 5015 transitions. [2023-08-27 11:48:15,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 5015 transitions. [2023-08-27 11:48:15,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:48:15,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5015 transitions. [2023-08-27 11:48:15,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 200.6) internal successors, (5015), 25 states have internal predecessors, (5015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:15,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 597.0) internal successors, (15522), 26 states have internal predecessors, (15522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:15,278 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 597.0) internal successors, (15522), 26 states have internal predecessors, (15522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:15,278 INFO L175 Difference]: Start difference. First operand has 171 places, 192 transitions, 2419 flow. Second operand 25 states and 5015 transitions. [2023-08-27 11:48:15,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 331 transitions, 4290 flow [2023-08-27 11:48:15,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 331 transitions, 4201 flow, removed 30 selfloop flow, removed 2 redundant places. [2023-08-27 11:48:15,409 INFO L231 Difference]: Finished difference. Result has 199 places, 233 transitions, 3181 flow [2023-08-27 11:48:15,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=2325, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3181, PETRI_PLACES=199, PETRI_TRANSITIONS=233} [2023-08-27 11:48:15,409 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 113 predicate places. [2023-08-27 11:48:15,409 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 233 transitions, 3181 flow [2023-08-27 11:48:15,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 194.875) internal successors, (6236), 32 states have internal predecessors, (6236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:15,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:48:15,410 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:48:15,415 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-27 11:48:15,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:48:15,611 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:48:15,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:48:15,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2091039326, now seen corresponding path program 3 times [2023-08-27 11:48:15,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:48:15,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616728172] [2023-08-27 11:48:15,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:48:15,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:48:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:48:16,105 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-27 11:48:16,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:48:16,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616728172] [2023-08-27 11:48:16,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616728172] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:48:16,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166942665] [2023-08-27 11:48:16,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 11:48:16,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:48:16,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:48:16,106 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-27 11:48:16,109 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-27 11:48:16,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 11:48:16,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:48:16,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-27 11:48:16,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:48:16,247 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-27 11:48:16,328 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:48:16,328 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-27 11:48:16,350 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-27 11:48:16,378 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-27 11:48:16,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:48:16,439 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-27 11:48:16,477 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-27 11:48:16,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:48:16,509 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 11:48:16,534 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-27 11:48:16,570 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:48:16,571 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-27 11:48:16,598 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-27 11:48:16,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:48:16,650 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1557) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_85|)) 0)))) is different from false [2023-08-27 11:48:16,716 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:48:16,716 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-27 11:48:16,732 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:48:16,732 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-27 11:48:16,738 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-27 11:48:16,761 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((v_ArrVal_1558 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1555 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_85| v_ArrVal_1555)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_1558 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1555 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_85| v_ArrVal_1555)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_85| |v_t_funThread2of2ForFork0_~p~0#1.offset_85|))))) is different from false [2023-08-27 11:48:16,802 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1558 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1555 Int)) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_85| |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1551))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85| v_ArrVal_1555))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_1558 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_85| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1551 (Array Int Int)) (v_ArrVal_1555 Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1551))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_85| v_ArrVal_1555))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0)))) is different from false [2023-08-27 11:48:24,855 WARN L234 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:48:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-27 11:48:25,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166942665] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:48:25,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:48:25,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-08-27 11:48:25,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985510094] [2023-08-27 11:48:25,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:48:25,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 11:48:25,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:48:25,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 11:48:25,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=282, Unknown=7, NotChecked=114, Total=506 [2023-08-27 11:48:25,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 597 [2023-08-27 11:48:25,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 233 transitions, 3181 flow. Second operand has 23 states, 23 states have (on average 201.2173913043478) internal successors, (4628), 23 states have internal predecessors, (4628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:25,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:48:25,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 597 [2023-08-27 11:48:25,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:48:25,407 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (forall ((v_ArrVal_1558 (Array Int Int)) (v_ArrVal_1557 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int) (v_ArrVal_1555 Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_1555)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1557) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_85|)) 0)))) (forall ((v_ArrVal_1558 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1558) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0) (not (= (select .cse0 (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_85|)) 0)))) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_85| Int)) (or (not (= (select .cse0 (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_85|)) 0)) (= (select (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_85|) 0))))) is different from false [2023-08-27 11:48:26,567 INFO L124 PetriNetUnfolderBase]: 2669/5587 cut-off events. [2023-08-27 11:48:26,567 INFO L125 PetriNetUnfolderBase]: For 59221/59227 co-relation queries the response was YES. [2023-08-27 11:48:26,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31151 conditions, 5587 events. 2669/5587 cut-off events. For 59221/59227 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 44643 event pairs, 446 based on Foata normal form. 63/5254 useless extension candidates. Maximal degree in co-relation 31044. Up to 2446 conditions per place. [2023-08-27 11:48:26,610 INFO L140 encePairwiseOnDemand]: 580/597 looper letters, 256 selfloop transitions, 92 changer transitions 9/363 dead transitions. [2023-08-27 11:48:26,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 363 transitions, 5258 flow [2023-08-27 11:48:26,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-27 11:48:26,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-27 11:48:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2947 transitions. [2023-08-27 11:48:26,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3525963149078727 [2023-08-27 11:48:26,613 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2947 transitions. [2023-08-27 11:48:26,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2947 transitions. [2023-08-27 11:48:26,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:48:26,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2947 transitions. [2023-08-27 11:48:26,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 210.5) internal successors, (2947), 14 states have internal predecessors, (2947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:26,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 597.0) internal successors, (8955), 15 states have internal predecessors, (8955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:26,621 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 597.0) internal successors, (8955), 15 states have internal predecessors, (8955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:26,621 INFO L175 Difference]: Start difference. First operand has 199 places, 233 transitions, 3181 flow. Second operand 14 states and 2947 transitions. [2023-08-27 11:48:26,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 363 transitions, 5258 flow [2023-08-27 11:48:26,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 363 transitions, 4877 flow, removed 156 selfloop flow, removed 20 redundant places. [2023-08-27 11:48:26,769 INFO L231 Difference]: Finished difference. Result has 197 places, 267 transitions, 3657 flow [2023-08-27 11:48:26,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=2928, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3657, PETRI_PLACES=197, PETRI_TRANSITIONS=267} [2023-08-27 11:48:26,770 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 111 predicate places. [2023-08-27 11:48:26,770 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 267 transitions, 3657 flow [2023-08-27 11:48:26,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 201.2173913043478) internal successors, (4628), 23 states have internal predecessors, (4628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:26,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:48:26,771 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:48:26,778 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-27 11:48:26,978 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,SelfDestructingSolverStorable36 [2023-08-27 11:48:26,978 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:48:26,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:48:26,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2125627344, now seen corresponding path program 1 times [2023-08-27 11:48:26,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:48:26,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573217387] [2023-08-27 11:48:26,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:48:26,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:48:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:48:27,216 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-27 11:48:27,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:48:27,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573217387] [2023-08-27 11:48:27,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573217387] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:48:27,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44641663] [2023-08-27 11:48:27,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:48:27,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:48:27,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:48:27,221 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-27 11:48:27,244 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-27 11:48:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:48:27,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-27 11:48:27,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:48:27,403 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-27 11:48:27,453 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:48:27,453 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-27 11:48:27,471 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-27 11:48:27,492 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-27 11:48:27,511 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-27 11:48:27,554 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:48:27,554 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-27 11:48:27,603 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-27 11:48:27,642 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-27 11:48:27,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:48:27,707 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-27 11:48:27,710 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-27 11:48:35,739 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_87| Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_87| Int) (v_ArrVal_1643 Int) (v_ArrVal_1639 (Array Int Int))) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1639) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_87| v_ArrVal_1643) |v_t_funThread1of2ForFork0_~p~0#1.offset_87|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_87| |v_t_funThread2of2ForFork0_~p~0#1.offset_87|))) is different from false [2023-08-27 11:48:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-27 11:48:35,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44641663] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:48:35,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:48:35,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2023-08-27 11:48:35,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961715036] [2023-08-27 11:48:35,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:48:35,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 11:48:35,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:48:35,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 11:48:35,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=4, NotChecked=30, Total=306 [2023-08-27 11:48:35,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 597 [2023-08-27 11:48:35,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 267 transitions, 3657 flow. Second operand has 18 states, 18 states have (on average 202.72222222222223) internal successors, (3649), 18 states have internal predecessors, (3649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:35,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:48:35,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 597 [2023-08-27 11:48:35,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:48:37,116 INFO L124 PetriNetUnfolderBase]: 2893/6041 cut-off events. [2023-08-27 11:48:37,116 INFO L125 PetriNetUnfolderBase]: For 74265/74283 co-relation queries the response was YES. [2023-08-27 11:48:37,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35939 conditions, 6041 events. 2893/6041 cut-off events. For 74265/74283 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 48769 event pairs, 565 based on Foata normal form. 36/5652 useless extension candidates. Maximal degree in co-relation 35854. Up to 3699 conditions per place. [2023-08-27 11:48:37,167 INFO L140 encePairwiseOnDemand]: 581/597 looper letters, 297 selfloop transitions, 57 changer transitions 19/379 dead transitions. [2023-08-27 11:48:37,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 379 transitions, 5404 flow [2023-08-27 11:48:37,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-27 11:48:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-27 11:48:37,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2759 transitions. [2023-08-27 11:48:37,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35549542584718463 [2023-08-27 11:48:37,170 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2759 transitions. [2023-08-27 11:48:37,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2759 transitions. [2023-08-27 11:48:37,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:48:37,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2759 transitions. [2023-08-27 11:48:37,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 212.23076923076923) internal successors, (2759), 13 states have internal predecessors, (2759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:37,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 597.0) internal successors, (8358), 14 states have internal predecessors, (8358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:37,178 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 597.0) internal successors, (8358), 14 states have internal predecessors, (8358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:37,178 INFO L175 Difference]: Start difference. First operand has 197 places, 267 transitions, 3657 flow. Second operand 13 states and 2759 transitions. [2023-08-27 11:48:37,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 379 transitions, 5404 flow [2023-08-27 11:48:37,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 379 transitions, 5171 flow, removed 81 selfloop flow, removed 7 redundant places. [2023-08-27 11:48:37,363 INFO L231 Difference]: Finished difference. Result has 207 places, 281 transitions, 3857 flow [2023-08-27 11:48:37,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=3430, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3857, PETRI_PLACES=207, PETRI_TRANSITIONS=281} [2023-08-27 11:48:37,363 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 121 predicate places. [2023-08-27 11:48:37,364 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 281 transitions, 3857 flow [2023-08-27 11:48:37,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 202.72222222222223) internal successors, (3649), 18 states have internal predecessors, (3649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:37,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:48:37,364 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:48:37,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-27 11:48:37,569 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,SelfDestructingSolverStorable37 [2023-08-27 11:48:37,569 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:48:37,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:48:37,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2065236442, now seen corresponding path program 4 times [2023-08-27 11:48:37,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:48:37,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007135825] [2023-08-27 11:48:37,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:48:37,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:48:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:48:37,844 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-27 11:48:37,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:48:37,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007135825] [2023-08-27 11:48:37,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007135825] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:48:37,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566975936] [2023-08-27 11:48:37,844 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 11:48:37,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:48:37,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:48:37,849 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-27 11:48:37,860 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-27 11:48:38,048 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 11:48:38,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:48:38,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-27 11:48:38,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:48:38,057 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-27 11:48:38,103 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:48:38,104 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-27 11:48:38,120 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-27 11:48:38,139 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-27 11:48:38,162 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-27 11:48:38,195 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:48:38,195 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-27 11:48:38,244 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-27 11:48:38,280 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-27 11:48:38,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:48:38,342 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-27 11:48:38,346 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-27 11:48:42,370 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1724 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1724) |c_~#a~0.base|))) is different from false [2023-08-27 11:48:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-27 11:48:42,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566975936] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:48:42,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:48:42,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-27 11:48:42,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606306944] [2023-08-27 11:48:42,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:48:42,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-27 11:48:42,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:48:42,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-27 11:48:42,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=188, Unknown=1, NotChecked=28, Total=272 [2023-08-27 11:48:42,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 597 [2023-08-27 11:48:42,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 281 transitions, 3857 flow. Second operand has 17 states, 17 states have (on average 202.8235294117647) internal successors, (3448), 17 states have internal predecessors, (3448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:42,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:48:42,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 597 [2023-08-27 11:48:42,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:48:50,487 WARN L234 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 21 DAG size of output: 19 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:48:51,640 INFO L124 PetriNetUnfolderBase]: 2987/6260 cut-off events. [2023-08-27 11:48:51,640 INFO L125 PetriNetUnfolderBase]: For 79369/79393 co-relation queries the response was YES. [2023-08-27 11:48:51,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37197 conditions, 6260 events. 2987/6260 cut-off events. For 79369/79393 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 51003 event pairs, 555 based on Foata normal form. 39/5856 useless extension candidates. Maximal degree in co-relation 37107. Up to 4073 conditions per place. [2023-08-27 11:48:51,696 INFO L140 encePairwiseOnDemand]: 582/597 looper letters, 304 selfloop transitions, 58 changer transitions 14/382 dead transitions. [2023-08-27 11:48:51,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 382 transitions, 5634 flow [2023-08-27 11:48:51,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 11:48:51,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 11:48:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2547 transitions. [2023-08-27 11:48:51,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3555276381909548 [2023-08-27 11:48:51,699 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2547 transitions. [2023-08-27 11:48:51,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2547 transitions. [2023-08-27 11:48:51,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:48:51,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2547 transitions. [2023-08-27 11:48:51,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 212.25) internal successors, (2547), 12 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:51,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 597.0) internal successors, (7761), 13 states have internal predecessors, (7761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:51,707 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 597.0) internal successors, (7761), 13 states have internal predecessors, (7761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:51,707 INFO L175 Difference]: Start difference. First operand has 207 places, 281 transitions, 3857 flow. Second operand 12 states and 2547 transitions. [2023-08-27 11:48:51,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 382 transitions, 5634 flow [2023-08-27 11:48:51,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 382 transitions, 5511 flow, removed 42 selfloop flow, removed 5 redundant places. [2023-08-27 11:48:51,946 INFO L231 Difference]: Finished difference. Result has 217 places, 295 transitions, 4180 flow [2023-08-27 11:48:51,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=3705, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4180, PETRI_PLACES=217, PETRI_TRANSITIONS=295} [2023-08-27 11:48:51,946 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 131 predicate places. [2023-08-27 11:48:51,947 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 295 transitions, 4180 flow [2023-08-27 11:48:51,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 202.8235294117647) internal successors, (3448), 17 states have internal predecessors, (3448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:51,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:48:51,947 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-27 11:48:51,957 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-27 11:48:52,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-08-27 11:48:52,154 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:48:52,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:48:52,154 INFO L85 PathProgramCache]: Analyzing trace with hash -2068898434, now seen corresponding path program 1 times [2023-08-27 11:48:52,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:48:52,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408554294] [2023-08-27 11:48:52,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:48:52,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:48:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:48:52,390 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-27 11:48:52,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:48:52,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408554294] [2023-08-27 11:48:52,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408554294] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:48:52,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63420112] [2023-08-27 11:48:52,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:48:52,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:48:52,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:48:52,393 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 11:48:52,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-27 11:48:52,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:48:52,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-27 11:48:52,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:48:52,568 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-27 11:48:52,646 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:48:52,647 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-27 11:48:52,669 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-27 11:48:52,694 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-27 11:48:52,720 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-27 11:48:52,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:48:52,758 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-27 11:48:52,801 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-27 11:48:52,836 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:48:52,836 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-27 11:48:52,883 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-27 11:48:52,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:48:52,972 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1814 Int) (v_ArrVal_1812 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_91| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1812) |c_~#a~0.base|) (+ |v_t_funThread1of2ForFork0_~p~0#1.offset_91| 4)) 0)) (< 0 (+ (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_1814)) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_91|) 2147483650)))) is different from false [2023-08-27 11:48:52,993 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:48:52,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-27 11:48:53,001 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:48:53,002 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-27 11:48:53,006 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-27 11:48:55,725 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-27 11:48:55,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63420112] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:48:55,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:48:55,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 20 [2023-08-27 11:48:55,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388746937] [2023-08-27 11:48:55,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:48:55,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-27 11:48:55,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:48:55,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-27 11:48:55,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=328, Unknown=2, NotChecked=38, Total=462 [2023-08-27 11:48:55,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 597 [2023-08-27 11:48:55,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 295 transitions, 4180 flow. Second operand has 22 states, 22 states have (on average 201.45454545454547) internal successors, (4432), 22 states have internal predecessors, (4432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:55,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:48:55,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 597 [2023-08-27 11:48:55,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:48:59,469 INFO L124 PetriNetUnfolderBase]: 3093/6551 cut-off events. [2023-08-27 11:48:59,469 INFO L125 PetriNetUnfolderBase]: For 82226/82238 co-relation queries the response was YES. [2023-08-27 11:48:59,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39236 conditions, 6551 events. 3093/6551 cut-off events. For 82226/82238 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 54814 event pairs, 436 based on Foata normal form. 24/6127 useless extension candidates. Maximal degree in co-relation 39141. Up to 2292 conditions per place. [2023-08-27 11:48:59,514 INFO L140 encePairwiseOnDemand]: 578/597 looper letters, 324 selfloop transitions, 168 changer transitions 28/526 dead transitions. [2023-08-27 11:48:59,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 526 transitions, 7487 flow [2023-08-27 11:48:59,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-27 11:48:59,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-27 11:48:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 5839 transitions. [2023-08-27 11:48:59,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34930605407992343 [2023-08-27 11:48:59,518 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 5839 transitions. [2023-08-27 11:48:59,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 5839 transitions. [2023-08-27 11:48:59,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:48:59,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 5839 transitions. [2023-08-27 11:48:59,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 208.53571428571428) internal successors, (5839), 28 states have internal predecessors, (5839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:59,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 597.0) internal successors, (17313), 29 states have internal predecessors, (17313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:59,529 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 597.0) internal successors, (17313), 29 states have internal predecessors, (17313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:59,529 INFO L175 Difference]: Start difference. First operand has 217 places, 295 transitions, 4180 flow. Second operand 28 states and 5839 transitions. [2023-08-27 11:48:59,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 526 transitions, 7487 flow [2023-08-27 11:48:59,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 526 transitions, 7375 flow, removed 25 selfloop flow, removed 5 redundant places. [2023-08-27 11:48:59,761 INFO L231 Difference]: Finished difference. Result has 250 places, 354 transitions, 5505 flow [2023-08-27 11:48:59,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=4055, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=5505, PETRI_PLACES=250, PETRI_TRANSITIONS=354} [2023-08-27 11:48:59,761 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 164 predicate places. [2023-08-27 11:48:59,762 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 354 transitions, 5505 flow [2023-08-27 11:48:59,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 201.45454545454547) internal successors, (4432), 22 states have internal predecessors, (4432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:48:59,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:48:59,762 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:48:59,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-27 11:48:59,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:48:59,968 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:48:59,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:48:59,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1507879160, now seen corresponding path program 2 times [2023-08-27 11:48:59,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:48:59,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734894961] [2023-08-27 11:48:59,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:48:59,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:48:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:49:00,181 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-27 11:49:00,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:49:00,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734894961] [2023-08-27 11:49:00,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734894961] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:49:00,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835021908] [2023-08-27 11:49:00,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 11:49:00,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:49:00,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:49:00,182 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 11:49:00,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-27 11:49:00,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 11:49:00,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:49:00,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-27 11:49:00,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:49:00,347 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-27 11:49:00,395 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:49:00,395 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-27 11:49:00,409 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-27 11:49:00,426 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-27 11:49:00,443 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-27 11:49:00,473 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:49:00,473 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-27 11:49:00,513 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-27 11:49:00,541 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-27 11:49:00,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:49:00,589 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-27 11:49:00,591 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-27 11:49:04,626 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1895 (Array Int Int))) (= ((as const (Array Int Int)) 0) (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1895) |c_~#a~0.base|))) is different from false [2023-08-27 11:49:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 1 not checked. [2023-08-27 11:49:04,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835021908] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:49:04,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:49:04,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-27 11:49:04,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466747822] [2023-08-27 11:49:04,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:49:04,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-27 11:49:04,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:49:04,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-27 11:49:04,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=188, Unknown=3, NotChecked=28, Total=272 [2023-08-27 11:49:04,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 597 [2023-08-27 11:49:04,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 354 transitions, 5505 flow. Second operand has 17 states, 17 states have (on average 202.8235294117647) internal successors, (3448), 17 states have internal predecessors, (3448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:04,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:49:04,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 597 [2023-08-27 11:49:04,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:49:06,370 INFO L124 PetriNetUnfolderBase]: 3223/6870 cut-off events. [2023-08-27 11:49:06,370 INFO L125 PetriNetUnfolderBase]: For 111078/111120 co-relation queries the response was YES. [2023-08-27 11:49:06,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43644 conditions, 6870 events. 3223/6870 cut-off events. For 111078/111120 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 58183 event pairs, 617 based on Foata normal form. 60/6447 useless extension candidates. Maximal degree in co-relation 43538. Up to 4207 conditions per place. [2023-08-27 11:49:06,435 INFO L140 encePairwiseOnDemand]: 580/597 looper letters, 391 selfloop transitions, 92 changer transitions 14/503 dead transitions. [2023-08-27 11:49:06,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 503 transitions, 8100 flow [2023-08-27 11:49:06,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-27 11:49:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-27 11:49:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3394 transitions. [2023-08-27 11:49:06,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3553182579564489 [2023-08-27 11:49:06,438 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3394 transitions. [2023-08-27 11:49:06,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3394 transitions. [2023-08-27 11:49:06,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:49:06,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3394 transitions. [2023-08-27 11:49:06,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 212.125) internal successors, (3394), 16 states have internal predecessors, (3394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:06,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 597.0) internal successors, (10149), 17 states have internal predecessors, (10149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:06,445 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 597.0) internal successors, (10149), 17 states have internal predecessors, (10149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:06,445 INFO L175 Difference]: Start difference. First operand has 250 places, 354 transitions, 5505 flow. Second operand 16 states and 3394 transitions. [2023-08-27 11:49:06,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 503 transitions, 8100 flow [2023-08-27 11:49:06,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 503 transitions, 7661 flow, removed 203 selfloop flow, removed 5 redundant places. [2023-08-27 11:49:06,825 INFO L231 Difference]: Finished difference. Result has 264 places, 380 transitions, 5998 flow [2023-08-27 11:49:06,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=5177, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5998, PETRI_PLACES=264, PETRI_TRANSITIONS=380} [2023-08-27 11:49:06,826 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 178 predicate places. [2023-08-27 11:49:06,826 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 380 transitions, 5998 flow [2023-08-27 11:49:06,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 202.8235294117647) internal successors, (3448), 17 states have internal predecessors, (3448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:06,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:49:06,827 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:49:06,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-08-27 11:49:07,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:49:07,027 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:49:07,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:49:07,028 INFO L85 PathProgramCache]: Analyzing trace with hash -247162014, now seen corresponding path program 2 times [2023-08-27 11:49:07,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:49:07,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462172134] [2023-08-27 11:49:07,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:49:07,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:49:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:49:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-27 11:49:07,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:49:07,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462172134] [2023-08-27 11:49:07,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462172134] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:49:07,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000734360] [2023-08-27 11:49:07,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 11:49:07,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:49:07,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:49:07,229 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 11:49:07,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-27 11:49:07,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 11:49:07,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:49:07,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-27 11:49:07,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:49:07,464 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:49:07,464 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-27 11:49:07,528 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-27 11:49:07,559 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-27 11:49:07,574 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-27 11:49:07,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:49:07,590 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1980 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1980) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 2147483649)) is different from false [2023-08-27 11:49:07,599 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:49:07,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-08-27 11:49:07,602 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2023-08-27 11:49:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 2 not checked. [2023-08-27 11:49:07,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000734360] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:49:07,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:49:07,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2023-08-27 11:49:07,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941739900] [2023-08-27 11:49:07,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:49:07,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 11:49:07,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:49:07,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 11:49:07,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=217, Unknown=1, NotChecked=30, Total=306 [2023-08-27 11:49:07,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 597 [2023-08-27 11:49:07,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 380 transitions, 5998 flow. Second operand has 18 states, 18 states have (on average 220.33333333333334) internal successors, (3966), 18 states have internal predecessors, (3966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:07,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:49:07,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 597 [2023-08-27 11:49:07,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:49:09,001 INFO L124 PetriNetUnfolderBase]: 2898/6451 cut-off events. [2023-08-27 11:49:09,001 INFO L125 PetriNetUnfolderBase]: For 105085/105123 co-relation queries the response was YES. [2023-08-27 11:49:09,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40357 conditions, 6451 events. 2898/6451 cut-off events. For 105085/105123 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 56016 event pairs, 496 based on Foata normal form. 34/6024 useless extension candidates. Maximal degree in co-relation 40245. Up to 2888 conditions per place. [2023-08-27 11:49:09,068 INFO L140 encePairwiseOnDemand]: 586/597 looper letters, 352 selfloop transitions, 98 changer transitions 5/464 dead transitions. [2023-08-27 11:49:09,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 464 transitions, 7941 flow [2023-08-27 11:49:09,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 11:49:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 11:49:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2515 transitions. [2023-08-27 11:49:09,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38297548347799604 [2023-08-27 11:49:09,071 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2515 transitions. [2023-08-27 11:49:09,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2515 transitions. [2023-08-27 11:49:09,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:49:09,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2515 transitions. [2023-08-27 11:49:09,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 228.63636363636363) internal successors, (2515), 11 states have internal predecessors, (2515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:09,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 597.0) internal successors, (7164), 12 states have internal predecessors, (7164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:09,076 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 597.0) internal successors, (7164), 12 states have internal predecessors, (7164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:09,076 INFO L175 Difference]: Start difference. First operand has 264 places, 380 transitions, 5998 flow. Second operand 11 states and 2515 transitions. [2023-08-27 11:49:09,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 464 transitions, 7941 flow [2023-08-27 11:49:09,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 464 transitions, 7729 flow, removed 57 selfloop flow, removed 8 redundant places. [2023-08-27 11:49:09,434 INFO L231 Difference]: Finished difference. Result has 269 places, 380 transitions, 6140 flow [2023-08-27 11:49:09,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=5732, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=6140, PETRI_PLACES=269, PETRI_TRANSITIONS=380} [2023-08-27 11:49:09,435 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 183 predicate places. [2023-08-27 11:49:09,435 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 380 transitions, 6140 flow [2023-08-27 11:49:09,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 220.33333333333334) internal successors, (3966), 18 states have internal predecessors, (3966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:09,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:49:09,436 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:49:09,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-08-27 11:49:09,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2023-08-27 11:49:09,641 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:49:09,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:49:09,641 INFO L85 PathProgramCache]: Analyzing trace with hash -246936066, now seen corresponding path program 2 times [2023-08-27 11:49:09,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:49:09,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502704803] [2023-08-27 11:49:09,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:49:09,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:49:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:49:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-27 11:49:09,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:49:09,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502704803] [2023-08-27 11:49:09,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502704803] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:49:09,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887473591] [2023-08-27 11:49:09,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 11:49:09,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:49:09,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:49:09,849 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 11:49:09,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-27 11:49:10,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 11:49:10,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:49:10,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-27 11:49:10,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:49:10,055 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-27 11:49:10,105 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:49:10,105 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-27 11:49:10,111 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-27 11:49:10,130 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-27 11:49:10,201 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 27 treesize of output 20 [2023-08-27 11:49:10,239 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-27 11:49:10,265 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-27 11:49:10,265 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:49:10,280 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2064 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2064) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648))) is different from false [2023-08-27 11:49:10,291 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2062 Int) (v_ArrVal_2064 (Array Int Int))) (or (< v_ArrVal_2062 (+ |c_t_funThread2of2ForFork0_#t~mem35#1| 1)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2062)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2064) |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)))) is different from false [2023-08-27 11:49:10,300 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2062 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2064 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (or (< v_ArrVal_2062 (+ (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2062)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2064) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648))))) is different from false [2023-08-27 11:49:10,323 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2062 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2064 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2062)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2064) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_2062 (+ (select .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|) 1))))) is different from false [2023-08-27 11:49:10,347 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2062 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2064 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2061))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (or (< 0 (+ (select (select (store (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2062)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2064) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 2147483648)) (< v_ArrVal_2062 (+ (select .cse1 |t_funThread2of2ForFork0_~p~0#1.offset|) 1)))))) is different from false [2023-08-27 11:49:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-27 11:49:10,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887473591] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:49:10,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:49:10,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 17 [2023-08-27 11:49:10,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944493989] [2023-08-27 11:49:10,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:49:10,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 11:49:10,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:49:10,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 11:49:10,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=144, Unknown=5, NotChecked=140, Total=342 [2023-08-27 11:49:10,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 597 [2023-08-27 11:49:10,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 380 transitions, 6140 flow. Second operand has 19 states, 19 states have (on average 219.94736842105263) internal successors, (4179), 19 states have internal predecessors, (4179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:10,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:49:10,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 597 [2023-08-27 11:49:10,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:49:12,002 INFO L124 PetriNetUnfolderBase]: 2888/6412 cut-off events. [2023-08-27 11:49:12,003 INFO L125 PetriNetUnfolderBase]: For 103079/103122 co-relation queries the response was YES. [2023-08-27 11:49:12,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40523 conditions, 6412 events. 2888/6412 cut-off events. For 103079/103122 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 55453 event pairs, 608 based on Foata normal form. 32/5983 useless extension candidates. Maximal degree in co-relation 40407. Up to 3365 conditions per place. [2023-08-27 11:49:12,068 INFO L140 encePairwiseOnDemand]: 585/597 looper letters, 266 selfloop transitions, 73 changer transitions 78/426 dead transitions. [2023-08-27 11:49:12,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 426 transitions, 7435 flow [2023-08-27 11:49:12,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 11:49:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 11:49:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2292 transitions. [2023-08-27 11:49:12,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38391959798994973 [2023-08-27 11:49:12,070 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2292 transitions. [2023-08-27 11:49:12,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2292 transitions. [2023-08-27 11:49:12,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:49:12,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2292 transitions. [2023-08-27 11:49:12,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 229.2) internal successors, (2292), 10 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:12,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 597.0) internal successors, (6567), 11 states have internal predecessors, (6567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:12,075 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 597.0) internal successors, (6567), 11 states have internal predecessors, (6567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:12,075 INFO L175 Difference]: Start difference. First operand has 269 places, 380 transitions, 6140 flow. Second operand 10 states and 2292 transitions. [2023-08-27 11:49:12,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 426 transitions, 7435 flow [2023-08-27 11:49:12,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 426 transitions, 7231 flow, removed 18 selfloop flow, removed 10 redundant places. [2023-08-27 11:49:12,426 INFO L231 Difference]: Finished difference. Result has 265 places, 308 transitions, 4892 flow [2023-08-27 11:49:12,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=5827, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4892, PETRI_PLACES=265, PETRI_TRANSITIONS=308} [2023-08-27 11:49:12,427 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 179 predicate places. [2023-08-27 11:49:12,427 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 308 transitions, 4892 flow [2023-08-27 11:49:12,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 219.94736842105263) internal successors, (4179), 19 states have internal predecessors, (4179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:12,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:49:12,428 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:49:12,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-08-27 11:49:12,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2023-08-27 11:49:12,631 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:49:12,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:49:12,631 INFO L85 PathProgramCache]: Analyzing trace with hash 860175855, now seen corresponding path program 5 times [2023-08-27 11:49:12,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:49:12,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021490700] [2023-08-27 11:49:12,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:49:12,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:49:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:49:15,826 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 11:49:15,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:49:15,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021490700] [2023-08-27 11:49:15,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021490700] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:49:15,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166936735] [2023-08-27 11:49:15,826 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 11:49:15,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:49:15,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:49:15,829 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 11:49:15,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-27 11:49:16,154 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-27 11:49:16,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:49:16,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-27 11:49:16,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:49:16,164 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-27 11:49:16,246 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:49:16,246 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-27 11:49:16,273 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-27 11:49:16,296 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-27 11:49:16,312 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-27 11:49:16,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:49:16,373 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-27 11:49:16,456 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:49:16,456 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-27 11:49:16,498 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-27 11:49:16,539 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-27 11:49:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-27 11:49:16,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:49:16,806 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:49:16,807 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-27 11:49:16,816 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:49:16,817 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-27 11:49:16,821 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-27 11:49:16,848 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((v_ArrVal_2153 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_99| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2155 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_97| v_ArrVal_2153)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2155) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_2153 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_99| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2155 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_97| |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread1of2ForFork0_~p~0#1.offset_97| v_ArrVal_2153)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2155) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) 0))))) is different from false [2023-08-27 11:49:16,893 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_2153 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2149 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2155 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2149))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_97| v_ArrVal_2153))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2155) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_2153 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2149 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_97| Int) (v_ArrVal_2155 (Array Int Int))) (or (= |v_t_funThread1of2ForFork0_~p~0#1.offset_97| |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2149))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_97| v_ArrVal_2153))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2155) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) 0)))) is different from false [2023-08-27 11:49:25,048 WARN L234 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:49:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-27 11:49:25,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166936735] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:49:25,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:49:25,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 8] total 31 [2023-08-27 11:49:25,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417864649] [2023-08-27 11:49:25,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:49:25,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-27 11:49:25,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:49:25,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-27 11:49:25,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=800, Unknown=24, NotChecked=118, Total=1056 [2023-08-27 11:49:25,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 597 [2023-08-27 11:49:25,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 308 transitions, 4892 flow. Second operand has 33 states, 33 states have (on average 188.93939393939394) internal successors, (6235), 33 states have internal predecessors, (6235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:25,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:49:25,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 597 [2023-08-27 11:49:25,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:49:28,020 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_2153 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2152 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2153)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2155) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2152) |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_99|)) 0)))) (forall ((v_ArrVal_2153 Int) (|v_t_funThread2of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2155 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| v_ArrVal_2153)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2155) |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_99|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread2of2ForFork0_~p~0#1.offset_99|)) 0)))))) is different from false [2023-08-27 11:49:29,058 INFO L124 PetriNetUnfolderBase]: 2871/6115 cut-off events. [2023-08-27 11:49:29,058 INFO L125 PetriNetUnfolderBase]: For 99491/99537 co-relation queries the response was YES. [2023-08-27 11:49:29,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38351 conditions, 6115 events. 2871/6115 cut-off events. For 99491/99537 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 50266 event pairs, 613 based on Foata normal form. 60/5706 useless extension candidates. Maximal degree in co-relation 38238. Up to 3636 conditions per place. [2023-08-27 11:49:29,129 INFO L140 encePairwiseOnDemand]: 575/597 looper letters, 361 selfloop transitions, 105 changer transitions 27/499 dead transitions. [2023-08-27 11:49:29,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 499 transitions, 8042 flow [2023-08-27 11:49:29,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-27 11:49:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-27 11:49:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 5820 transitions. [2023-08-27 11:49:29,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3249581239530988 [2023-08-27 11:49:29,134 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 5820 transitions. [2023-08-27 11:49:29,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 5820 transitions. [2023-08-27 11:49:29,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:49:29,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 5820 transitions. [2023-08-27 11:49:29,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 194.0) internal successors, (5820), 30 states have internal predecessors, (5820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:29,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 597.0) internal successors, (18507), 31 states have internal predecessors, (18507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:29,149 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 597.0) internal successors, (18507), 31 states have internal predecessors, (18507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:29,149 INFO L175 Difference]: Start difference. First operand has 265 places, 308 transitions, 4892 flow. Second operand 30 states and 5820 transitions. [2023-08-27 11:49:29,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 499 transitions, 8042 flow [2023-08-27 11:49:29,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 499 transitions, 7670 flow, removed 40 selfloop flow, removed 19 redundant places. [2023-08-27 11:49:29,497 INFO L231 Difference]: Finished difference. Result has 267 places, 363 transitions, 5642 flow [2023-08-27 11:49:29,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=4537, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=5642, PETRI_PLACES=267, PETRI_TRANSITIONS=363} [2023-08-27 11:49:29,497 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 181 predicate places. [2023-08-27 11:49:29,497 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 363 transitions, 5642 flow [2023-08-27 11:49:29,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 188.93939393939394) internal successors, (6235), 33 states have internal predecessors, (6235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:29,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:49:29,498 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:49:29,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-08-27 11:49:29,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:49:29,699 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:49:29,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:49:29,699 INFO L85 PathProgramCache]: Analyzing trace with hash 758790651, now seen corresponding path program 3 times [2023-08-27 11:49:29,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:49:29,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753372528] [2023-08-27 11:49:29,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:49:29,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:49:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:49:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-27 11:49:29,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:49:29,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753372528] [2023-08-27 11:49:29,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753372528] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:49:29,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289050105] [2023-08-27 11:49:29,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 11:49:29,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:49:29,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:49:29,984 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 11:49:29,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-08-27 11:49:30,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-27 11:49:30,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:49:30,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-27 11:49:30,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:49:30,213 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-27 11:49:30,277 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:49:30,277 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-27 11:49:30,285 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-27 11:49:30,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-27 11:49:30,318 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-27 11:49:30,397 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:49:30,397 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-27 11:49:30,445 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-27 11:49:30,481 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-27 11:49:30,499 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-27 11:49:30,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:49:30,593 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-27 11:49:30,596 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-27 11:49:30,601 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_101| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2244 Int) (v_ArrVal_2246 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_101| v_ArrVal_2244)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2246) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_99|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_99| |v_t_funThread2of2ForFork0_~p~0#1.offset_101|))) is different from false [2023-08-27 11:49:30,608 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_101| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_99| Int) (v_ArrVal_2244 Int) (v_ArrVal_2246 (Array Int Int)) (v_ArrVal_2241 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2241))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_101| v_ArrVal_2244))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2246) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_99|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_99| |v_t_funThread2of2ForFork0_~p~0#1.offset_101|))) is different from false [2023-08-27 11:49:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 5 not checked. [2023-08-27 11:49:30,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289050105] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:49:30,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:49:30,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8] total 17 [2023-08-27 11:49:30,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962990694] [2023-08-27 11:49:30,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:49:30,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 11:49:30,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:49:30,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 11:49:30,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=197, Unknown=12, NotChecked=62, Total=342 [2023-08-27 11:49:30,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 597 [2023-08-27 11:49:30,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 363 transitions, 5642 flow. Second operand has 19 states, 19 states have (on average 202.73684210526315) internal successors, (3852), 19 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:30,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:49:30,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 597 [2023-08-27 11:49:30,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:49:32,395 INFO L124 PetriNetUnfolderBase]: 2811/6015 cut-off events. [2023-08-27 11:49:32,395 INFO L125 PetriNetUnfolderBase]: For 99560/99638 co-relation queries the response was YES. [2023-08-27 11:49:32,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41470 conditions, 6015 events. 2811/6015 cut-off events. For 99560/99638 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 50129 event pairs, 674 based on Foata normal form. 12/5556 useless extension candidates. Maximal degree in co-relation 41341. Up to 4405 conditions per place. [2023-08-27 11:49:32,470 INFO L140 encePairwiseOnDemand]: 586/597 looper letters, 373 selfloop transitions, 38 changer transitions 8/425 dead transitions. [2023-08-27 11:49:32,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 425 transitions, 7127 flow [2023-08-27 11:49:32,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 11:49:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 11:49:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1913 transitions. [2023-08-27 11:49:32,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3560394565419691 [2023-08-27 11:49:32,472 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1913 transitions. [2023-08-27 11:49:32,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1913 transitions. [2023-08-27 11:49:32,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:49:32,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1913 transitions. [2023-08-27 11:49:32,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 212.55555555555554) internal successors, (1913), 9 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-27 11:49:32,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 597.0) internal successors, (5970), 10 states have internal predecessors, (5970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:32,477 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 597.0) internal successors, (5970), 10 states have internal predecessors, (5970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:32,477 INFO L175 Difference]: Start difference. First operand has 267 places, 363 transitions, 5642 flow. Second operand 9 states and 1913 transitions. [2023-08-27 11:49:32,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 425 transitions, 7127 flow [2023-08-27 11:49:32,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 425 transitions, 6916 flow, removed 62 selfloop flow, removed 19 redundant places. [2023-08-27 11:49:32,831 INFO L231 Difference]: Finished difference. Result has 259 places, 370 transitions, 5655 flow [2023-08-27 11:49:32,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=5437, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5655, PETRI_PLACES=259, PETRI_TRANSITIONS=370} [2023-08-27 11:49:32,831 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 173 predicate places. [2023-08-27 11:49:32,832 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 370 transitions, 5655 flow [2023-08-27 11:49:32,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 202.73684210526315) internal successors, (3852), 19 states have internal predecessors, (3852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:32,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:49:32,832 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:49:32,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-08-27 11:49:33,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:49:33,033 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:49:33,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:49:33,033 INFO L85 PathProgramCache]: Analyzing trace with hash 614655599, now seen corresponding path program 6 times [2023-08-27 11:49:33,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:49:33,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196346817] [2023-08-27 11:49:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:49:33,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:49:33,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:49:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-27 11:49:33,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:49:33,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196346817] [2023-08-27 11:49:33,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196346817] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:49:33,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462258851] [2023-08-27 11:49:33,302 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-27 11:49:33,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:49:33,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:49:33,305 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 11:49:33,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-08-27 11:49:33,704 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-27 11:49:33,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:49:33,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-27 11:49:33,708 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:49:33,714 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-27 11:49:33,857 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-27 11:49:33,857 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-08-27 11:49:33,886 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-27 11:49:33,924 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-27 11:49:33,983 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-27 11:49:34,032 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:49:34,032 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-27 11:49:34,118 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-27 11:49:34,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-27 11:49:34,198 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-27 11:49:34,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:49:34,305 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2023-08-27 11:49:34,310 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 13 [2023-08-27 11:49:34,314 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-27 11:49:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-27 11:49:36,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462258851] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:49:36,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:49:36,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2023-08-27 11:49:36,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726616218] [2023-08-27 11:49:36,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:49:36,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-27 11:49:36,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:49:36,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-27 11:49:36,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-08-27 11:49:36,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 597 [2023-08-27 11:49:36,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 370 transitions, 5655 flow. Second operand has 17 states, 17 states have (on average 201.7058823529412) internal successors, (3429), 17 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:36,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:49:36,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 597 [2023-08-27 11:49:36,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:49:37,989 INFO L124 PetriNetUnfolderBase]: 2827/6101 cut-off events. [2023-08-27 11:49:37,989 INFO L125 PetriNetUnfolderBase]: For 98117/98211 co-relation queries the response was YES. [2023-08-27 11:49:38,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41703 conditions, 6101 events. 2827/6101 cut-off events. For 98117/98211 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 51057 event pairs, 669 based on Foata normal form. 21/5644 useless extension candidates. Maximal degree in co-relation 41582. Up to 4402 conditions per place. [2023-08-27 11:49:38,066 INFO L140 encePairwiseOnDemand]: 586/597 looper letters, 380 selfloop transitions, 38 changer transitions 12/436 dead transitions. [2023-08-27 11:49:38,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 436 transitions, 7223 flow [2023-08-27 11:49:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 11:49:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 11:49:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1904 transitions. [2023-08-27 11:49:38,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3543644146659222 [2023-08-27 11:49:38,068 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1904 transitions. [2023-08-27 11:49:38,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1904 transitions. [2023-08-27 11:49:38,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:49:38,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1904 transitions. [2023-08-27 11:49:38,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 211.55555555555554) internal successors, (1904), 9 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:38,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 597.0) internal successors, (5970), 10 states have internal predecessors, (5970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:38,073 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 597.0) internal successors, (5970), 10 states have internal predecessors, (5970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:38,073 INFO L175 Difference]: Start difference. First operand has 259 places, 370 transitions, 5655 flow. Second operand 9 states and 1904 transitions. [2023-08-27 11:49:38,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 436 transitions, 7223 flow [2023-08-27 11:49:38,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 436 transitions, 7146 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-08-27 11:49:38,460 INFO L231 Difference]: Finished difference. Result has 264 places, 373 transitions, 5758 flow [2023-08-27 11:49:38,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=5578, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5758, PETRI_PLACES=264, PETRI_TRANSITIONS=373} [2023-08-27 11:49:38,461 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 178 predicate places. [2023-08-27 11:49:38,461 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 373 transitions, 5758 flow [2023-08-27 11:49:38,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 201.7058823529412) internal successors, (3429), 17 states have internal predecessors, (3429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:38,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:49:38,462 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:49:38,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-08-27 11:49:38,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:49:38,662 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:49:38,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:49:38,663 INFO L85 PathProgramCache]: Analyzing trace with hash -280430725, now seen corresponding path program 4 times [2023-08-27 11:49:38,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:49:38,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583170836] [2023-08-27 11:49:38,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:49:38,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:49:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:49:39,162 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-27 11:49:39,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:49:39,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583170836] [2023-08-27 11:49:39,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583170836] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:49:39,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208993422] [2023-08-27 11:49:39,162 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 11:49:39,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:49:39,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:49:39,164 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 11:49:39,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-08-27 11:49:39,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 11:49:39,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:49:39,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-27 11:49:39,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:49:39,407 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-27 11:49:39,556 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:49:39,557 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-27 11:49:39,580 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-27 11:49:39,627 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-27 11:49:39,688 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-27 11:49:39,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:49:39,770 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-27 11:49:39,837 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:49:39,837 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-27 11:49:39,886 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-27 11:49:39,940 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-27 11:49:39,966 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-27 11:49:39,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:49:40,136 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:49:40,136 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-27 11:49:40,148 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:49:40,148 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-27 11:49:40,156 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-27 11:49:40,282 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((v_ArrVal_2427 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_105| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_103| Int) (v_ArrVal_2426 Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_105| v_ArrVal_2426)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2427) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_103|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_2427 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_105| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_103| Int) (v_ArrVal_2426 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_105| v_ArrVal_2426)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2427) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_103|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_103| |v_t_funThread2of2ForFork0_~p~0#1.offset_105|))))) is different from false [2023-08-27 11:49:40,350 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2421 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_105| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_103| Int) (v_ArrVal_2426 Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2421))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_105| v_ArrVal_2426))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2427) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_103|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_103| |v_t_funThread2of2ForFork0_~p~0#1.offset_105|))) (or (forall ((v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2421 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_105| Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_103| Int) (v_ArrVal_2426 Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2421))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_105| v_ArrVal_2426))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2427) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_103|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-27 11:49:48,477 WARN L234 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:49:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-27 11:49:48,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208993422] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:49:48,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:49:48,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2023-08-27 11:49:48,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950618245] [2023-08-27 11:49:48,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:49:48,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 11:49:48,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:49:48,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 11:49:48,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=333, Unknown=15, NotChecked=78, Total=506 [2023-08-27 11:49:48,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 597 [2023-08-27 11:49:48,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 373 transitions, 5758 flow. Second operand has 23 states, 23 states have (on average 199.3913043478261) internal successors, (4586), 23 states have internal predecessors, (4586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:49:48,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:49:48,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 597 [2023-08-27 11:49:48,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:50:03,055 WARN L234 SmtUtils]: Spent 14.30s on a formula simplification. DAG size of input: 39 DAG size of output: 30 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:50:05,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-27 11:50:07,068 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-27 11:50:09,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-27 11:50:11,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-27 11:50:13,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-27 11:50:15,547 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-27 11:50:17,549 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-27 11:50:19,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 11:50:22,051 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-27 11:50:24,054 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-27 11:50:26,056 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-27 11:50:28,144 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-27 11:50:30,158 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 [0, 1] [2023-08-27 11:50:32,161 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-27 11:50:34,164 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-27 11:50:36,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-27 11:50:38,176 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-27 11:50:40,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 11:50:42,184 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-27 11:50:44,188 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-27 11:50:46,191 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-27 11:50:48,194 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-27 11:50:53,407 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-27 11:50:55,989 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-27 11:50:57,994 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-27 11:51:00,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-27 11:51:02,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-27 11:51:04,423 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-27 11:51:06,468 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-27 11:51:08,471 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-27 11:51:10,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 11:51:12,476 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-27 11:51:14,480 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-27 11:51:16,491 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-27 11:51:18,501 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-27 11:51:20,512 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 [0, 1] [2023-08-27 11:51:22,516 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-27 11:51:24,520 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-27 11:51:26,533 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-27 11:51:27,016 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2424 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_103| Int) (v_ArrVal_2426 Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2424) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_103|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2426)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2427) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_103|) 0))) (forall ((v_ArrVal_2427 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_103| Int) (v_ArrVal_2426 Int)) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_103|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2426)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2427) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_103|) 0))))) is different from false [2023-08-27 11:51:27,117 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (exists ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2426 Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2426) (select |c_#memory_int| 4)) (not (= |t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2424 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_103| Int) (v_ArrVal_2426 Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2424) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_103|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2426)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2427) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_103|) 0))) (= 4 |c_t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_2427 (Array Int Int)) (v_ArrVal_2426 Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2426)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2427) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_2427 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_103| Int) (v_ArrVal_2426 Int)) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_103|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2426)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2427) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_103|) 0))))) is different from false [2023-08-27 11:51:28,845 INFO L124 PetriNetUnfolderBase]: 3125/6763 cut-off events. [2023-08-27 11:51:28,845 INFO L125 PetriNetUnfolderBase]: For 105155/105259 co-relation queries the response was YES. [2023-08-27 11:51:28,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45952 conditions, 6763 events. 3125/6763 cut-off events. For 105155/105259 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 57631 event pairs, 701 based on Foata normal form. 13/6229 useless extension candidates. Maximal degree in co-relation 45829. Up to 4614 conditions per place. [2023-08-27 11:51:28,925 INFO L140 encePairwiseOnDemand]: 579/597 looper letters, 433 selfloop transitions, 73 changer transitions 26/538 dead transitions. [2023-08-27 11:51:28,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 538 transitions, 8813 flow [2023-08-27 11:51:28,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-27 11:51:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-27 11:51:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3722 transitions. [2023-08-27 11:51:28,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34636143681369813 [2023-08-27 11:51:28,928 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3722 transitions. [2023-08-27 11:51:28,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3722 transitions. [2023-08-27 11:51:28,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:51:28,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3722 transitions. [2023-08-27 11:51:28,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 206.77777777777777) internal successors, (3722), 18 states have internal predecessors, (3722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:51:28,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 597.0) internal successors, (11343), 19 states have internal predecessors, (11343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:51:28,937 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 597.0) internal successors, (11343), 19 states have internal predecessors, (11343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:51:28,937 INFO L175 Difference]: Start difference. First operand has 264 places, 373 transitions, 5758 flow. Second operand 18 states and 3722 transitions. [2023-08-27 11:51:28,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 538 transitions, 8813 flow [2023-08-27 11:51:29,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 538 transitions, 8712 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-08-27 11:51:29,392 INFO L231 Difference]: Finished difference. Result has 282 places, 416 transitions, 6675 flow [2023-08-27 11:51:29,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=5685, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6675, PETRI_PLACES=282, PETRI_TRANSITIONS=416} [2023-08-27 11:51:29,393 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 196 predicate places. [2023-08-27 11:51:29,393 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 416 transitions, 6675 flow [2023-08-27 11:51:29,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 199.3913043478261) internal successors, (4586), 23 states have internal predecessors, (4586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:51:29,393 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:51:29,394 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:51:29,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-08-27 11:51:29,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2023-08-27 11:51:29,594 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:51:29,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:51:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash -680500733, now seen corresponding path program 5 times [2023-08-27 11:51:29,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:51:29,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764650798] [2023-08-27 11:51:29,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:51:29,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:51:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:51:29,859 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-27 11:51:29,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:51:29,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764650798] [2023-08-27 11:51:29,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764650798] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:51:29,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807249330] [2023-08-27 11:51:29,859 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 11:51:29,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:51:29,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:51:29,861 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 11:51:29,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-08-27 11:51:30,211 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-27 11:51:30,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:51:30,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-27 11:51:30,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:51:30,222 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-27 11:51:30,311 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:51:30,311 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-27 11:51:30,332 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-27 11:51:30,365 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-27 11:51:30,393 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-27 11:51:30,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:51:30,442 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-27 11:51:30,479 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:51:30,479 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-27 11:51:30,518 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-27 11:51:30,570 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-27 11:51:30,590 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-08-27 11:51:30,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:51:30,596 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2518 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2518) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))) is different from false [2023-08-27 11:51:30,732 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:51:30,733 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-27 11:51:30,739 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:51:30,739 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-27 11:51:30,742 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-27 11:51:30,758 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_107| Int) (v_ArrVal_2517 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_105| Int) (v_ArrVal_2518 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107| v_ArrVal_2517)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2518) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_105|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_105| |v_t_funThread2of2ForFork0_~p~0#1.offset_107|))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~p~0#1.offset_107| Int) (v_ArrVal_2517 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_105| Int) (v_ArrVal_2518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 |v_t_funThread2of2ForFork0_~p~0#1.offset_107| v_ArrVal_2517)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2518) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_105|) 0))))) is different from false [2023-08-27 11:51:30,774 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_2512 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_107| Int) (v_ArrVal_2517 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_105| Int) (v_ArrVal_2518 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2512))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_107| v_ArrVal_2517))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2518) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_105|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_2512 (Array Int Int)) (|v_t_funThread2of2ForFork0_~p~0#1.offset_107| Int) (v_ArrVal_2517 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_105| Int) (v_ArrVal_2518 (Array Int Int))) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2512))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |v_t_funThread2of2ForFork0_~p~0#1.offset_107| v_ArrVal_2517))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2518) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_105|) 0) (= |v_t_funThread1of2ForFork0_~p~0#1.offset_105| |v_t_funThread2of2ForFork0_~p~0#1.offset_107|)))) is different from false [2023-08-27 11:51:38,848 WARN L234 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:51:38,964 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 5 not checked. [2023-08-27 11:51:38,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807249330] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:51:38,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:51:38,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 20 [2023-08-27 11:51:38,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359479736] [2023-08-27 11:51:38,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:51:38,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-27 11:51:38,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:51:38,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-27 11:51:38,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=272, Unknown=13, NotChecked=108, Total=462 [2023-08-27 11:51:38,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 597 [2023-08-27 11:51:38,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 416 transitions, 6675 flow. Second operand has 22 states, 22 states have (on average 201.5909090909091) internal successors, (4435), 22 states have internal predecessors, (4435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:51:38,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:51:38,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 597 [2023-08-27 11:51:38,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:51:53,106 WARN L234 SmtUtils]: Spent 14.11s on a formula simplification. DAG size of input: 39 DAG size of output: 30 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:51:55,108 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-27 11:51:57,612 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-27 11:51:59,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 11:52:02,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-27 11:52:04,236 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-27 11:52:06,238 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-27 11:52:08,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 11:52:10,268 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-27 11:52:11,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:52:14,013 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-27 11:52:16,580 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-27 11:52:18,978 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-27 11:52:20,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-27 11:52:22,983 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-27 11:52:25,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 11:52:27,007 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-27 11:52:29,009 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-27 11:52:31,012 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-27 11:52:33,014 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-27 11:52:35,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 11:52:37,022 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-27 11:52:37,417 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (forall ((v_ArrVal_2515 (Array Int Int)) (v_ArrVal_2517 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_105| Int) (v_ArrVal_2518 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2517)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2518) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_105|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2515) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_105|)) 0)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= 4 |c_t_funThread1of2ForFork0_~p~0#1.base|) (not (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (not (= |c_t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)) (exists ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2517 Int)) (and (= (store ((as const (Array Int Int)) 0) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2517) (select |c_#memory_int| 4)) (not (= |t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (forall ((v_ArrVal_2517 Int) (|v_t_funThread1of2ForFork0_~p~0#1.offset_105| Int) (v_ArrVal_2518 (Array Int Int))) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_105|)) 0)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2517)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2518) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_105|) 0))) (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_2518 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2518) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) is different from false [2023-08-27 11:52:39,428 INFO L124 PetriNetUnfolderBase]: 3141/6850 cut-off events. [2023-08-27 11:52:39,428 INFO L125 PetriNetUnfolderBase]: For 116582/116672 co-relation queries the response was YES. [2023-08-27 11:52:39,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49089 conditions, 6850 events. 3141/6850 cut-off events. For 116582/116672 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 59388 event pairs, 706 based on Foata normal form. 9/6310 useless extension candidates. Maximal degree in co-relation 48960. Up to 4472 conditions per place. [2023-08-27 11:52:39,509 INFO L140 encePairwiseOnDemand]: 578/597 looper letters, 421 selfloop transitions, 100 changer transitions 18/545 dead transitions. [2023-08-27 11:52:39,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 545 transitions, 9196 flow [2023-08-27 11:52:39,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-27 11:52:39,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-27 11:52:39,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3958 transitions. [2023-08-27 11:52:39,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489376708101913 [2023-08-27 11:52:39,511 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3958 transitions. [2023-08-27 11:52:39,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3958 transitions. [2023-08-27 11:52:39,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:52:39,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3958 transitions. [2023-08-27 11:52:39,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 208.31578947368422) internal successors, (3958), 19 states have internal predecessors, (3958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:52:39,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 597.0) internal successors, (11940), 20 states have internal predecessors, (11940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:52:39,519 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 597.0) internal successors, (11940), 20 states have internal predecessors, (11940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:52:39,519 INFO L175 Difference]: Start difference. First operand has 282 places, 416 transitions, 6675 flow. Second operand 19 states and 3958 transitions. [2023-08-27 11:52:39,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 545 transitions, 9196 flow [2023-08-27 11:52:39,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 545 transitions, 9080 flow, removed 26 selfloop flow, removed 6 redundant places. [2023-08-27 11:52:39,994 INFO L231 Difference]: Finished difference. Result has 300 places, 440 transitions, 7227 flow [2023-08-27 11:52:39,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=6559, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7227, PETRI_PLACES=300, PETRI_TRANSITIONS=440} [2023-08-27 11:52:39,995 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 214 predicate places. [2023-08-27 11:52:39,995 INFO L495 AbstractCegarLoop]: Abstraction has has 300 places, 440 transitions, 7227 flow [2023-08-27 11:52:39,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 201.5909090909091) internal successors, (4435), 22 states have internal predecessors, (4435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:52:39,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:52:39,996 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, 1] [2023-08-27 11:52:40,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-08-27 11:52:40,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2023-08-27 11:52:40,203 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:52:40,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:52:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1696561163, now seen corresponding path program 1 times [2023-08-27 11:52:40,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:52:40,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895361725] [2023-08-27 11:52:40,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:52:40,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:52:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:52:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:52:40,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:52:40,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895361725] [2023-08-27 11:52:40,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895361725] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:52:40,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662950115] [2023-08-27 11:52:40,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:52:40,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:52:40,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:52:40,546 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 11:52:40,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-08-27 11:52:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:52:40,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 11:52:40,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:52:40,744 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-27 11:52:40,793 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:52:40,793 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-27 11:52:40,812 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-27 11:52:40,877 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-27 11:52:40,931 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-27 11:52:41,025 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-27 11:52:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:52:41,045 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:52:53,076 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:52:55,085 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:52:57,090 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:52:59,097 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_#t~post36#1|)) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:53:05,126 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2611 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2611))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:53:07,138 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_2611 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2611) |c_~#a~0.base|))) (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|))) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:53:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-27 11:53:07,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662950115] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:53:07,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:53:07,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-08-27 11:53:07,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846638821] [2023-08-27 11:53:07,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:53:07,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-27 11:53:07,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:53:07,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-27 11:53:07,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=388, Unknown=14, NotChecked=270, Total=756 [2023-08-27 11:53:07,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 597 [2023-08-27 11:53:07,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 440 transitions, 7227 flow. Second operand has 28 states, 28 states have (on average 208.17857142857142) internal successors, (5829), 28 states have internal predecessors, (5829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:53:07,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:53:07,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 597 [2023-08-27 11:53:07,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:53:15,267 WARN L234 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 26 DAG size of output: 21 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:53:17,270 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-27 11:53:19,272 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-27 11:53:21,296 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-27 11:53:23,297 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-27 11:53:25,300 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-27 11:53:27,302 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-27 11:53:29,303 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-27 11:53:31,307 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-27 11:53:33,309 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-27 11:53:35,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-27 11:53:37,316 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-27 11:53:39,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-27 11:53:41,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-27 11:53:43,325 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-27 11:53:45,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-27 11:53:47,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-27 11:53:49,362 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-27 11:54:05,407 WARN L234 SmtUtils]: Spent 16.03s on a formula simplification. DAG size of input: 30 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:54:07,416 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-27 11:54:09,418 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-27 11:54:11,424 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-27 11:54:13,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-27 11:54:15,461 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-27 11:54:17,475 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-27 11:54:19,478 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-27 11:54:21,480 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-27 11:54:23,886 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-27 11:54:25,942 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-27 11:54:27,943 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-27 11:54:29,949 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-27 11:54:31,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-27 11:54:33,955 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-27 11:54:35,957 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-27 11:54:37,959 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-27 11:54:40,016 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-27 11:54:48,580 WARN L234 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 31 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:54:49,881 INFO L124 PetriNetUnfolderBase]: 3118/6933 cut-off events. [2023-08-27 11:54:49,881 INFO L125 PetriNetUnfolderBase]: For 128944/129052 co-relation queries the response was YES. [2023-08-27 11:54:49,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51302 conditions, 6933 events. 3118/6933 cut-off events. For 128944/129052 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 61342 event pairs, 582 based on Foata normal form. 55/6618 useless extension candidates. Maximal degree in co-relation 51166. Up to 3571 conditions per place. [2023-08-27 11:54:49,965 INFO L140 encePairwiseOnDemand]: 580/597 looper letters, 379 selfloop transitions, 180 changer transitions 8/581 dead transitions. [2023-08-27 11:54:49,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 581 transitions, 10426 flow [2023-08-27 11:54:49,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-27 11:54:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-27 11:54:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4067 transitions. [2023-08-27 11:54:49,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3585471215727762 [2023-08-27 11:54:49,968 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4067 transitions. [2023-08-27 11:54:49,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4067 transitions. [2023-08-27 11:54:49,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:54:49,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4067 transitions. [2023-08-27 11:54:49,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 214.05263157894737) internal successors, (4067), 19 states have internal predecessors, (4067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:54:49,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 597.0) internal successors, (11940), 20 states have internal predecessors, (11940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:54:49,979 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 597.0) internal successors, (11940), 20 states have internal predecessors, (11940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:54:49,979 INFO L175 Difference]: Start difference. First operand has 300 places, 440 transitions, 7227 flow. Second operand 19 states and 4067 transitions. [2023-08-27 11:54:49,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 581 transitions, 10426 flow [2023-08-27 11:54:50,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 581 transitions, 10250 flow, removed 19 selfloop flow, removed 11 redundant places. [2023-08-27 11:54:50,521 INFO L231 Difference]: Finished difference. Result has 315 places, 488 transitions, 8437 flow [2023-08-27 11:54:50,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=7053, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=8437, PETRI_PLACES=315, PETRI_TRANSITIONS=488} [2023-08-27 11:54:50,523 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 229 predicate places. [2023-08-27 11:54:50,523 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 488 transitions, 8437 flow [2023-08-27 11:54:50,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 208.17857142857142) internal successors, (5829), 28 states have internal predecessors, (5829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:54:50,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:54:50,524 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:54:50,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-08-27 11:54:50,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2023-08-27 11:54:50,730 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:54:50,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:54:50,731 INFO L85 PathProgramCache]: Analyzing trace with hash -470773896, now seen corresponding path program 1 times [2023-08-27 11:54:50,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:54:50,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638026992] [2023-08-27 11:54:50,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:54:50,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:54:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:54:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-27 11:54:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:54:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638026992] [2023-08-27 11:54:50,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638026992] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:54:50,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41209084] [2023-08-27 11:54:50,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:54:50,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:54:50,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:54:50,989 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 11:54:50,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-08-27 11:54:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:54:51,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-27 11:54:51,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:54:51,203 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-27 11:54:51,274 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:54:51,275 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-27 11:54:51,294 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-27 11:54:51,317 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-27 11:54:51,341 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-27 11:54:51,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:54:51,389 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-27 11:54:51,416 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:54:51,417 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-08-27 11:54:51,446 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-27 11:54:51,492 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-27 11:54:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-27 11:54:51,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:54:51,524 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2706 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2706) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 2147483647)) is different from false [2023-08-27 11:54:51,626 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:54:51,626 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-08-27 11:54:51,633 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:54:51,633 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-08-27 11:54:51,637 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-08-27 11:54:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 3 times theorem prover too weak. 56 trivial. 2 not checked. [2023-08-27 11:54:55,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41209084] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:54:55,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:54:55,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 22 [2023-08-27 11:54:55,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767161332] [2023-08-27 11:54:55,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:54:55,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-27 11:54:55,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:54:55,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-27 11:54:55,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=409, Unknown=16, NotChecked=42, Total=552 [2023-08-27 11:54:55,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 597 [2023-08-27 11:54:55,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 488 transitions, 8437 flow. Second operand has 24 states, 24 states have (on average 199.33333333333334) internal successors, (4784), 24 states have internal predecessors, (4784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:54:55,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:54:55,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 597 [2023-08-27 11:54:55,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:54:56,217 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_2703 (Array Int Int)) (|v_t_funThread1of2ForFork0_~p~0#1.offset_109| Int) (v_ArrVal_2704 Int) (v_ArrVal_2706 (Array Int Int))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2703) |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_109|)) 0)) (< (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2704)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2706) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_109|) 2147483647))) (forall ((|v_t_funThread1of2ForFork0_~p~0#1.offset_109| Int) (v_ArrVal_2704 Int) (v_ArrVal_2706 (Array Int Int))) (or (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ 4 |v_t_funThread1of2ForFork0_~p~0#1.offset_109|)) 0)) (< (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_2704)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2706) |c_~#a~0.base|) |v_t_funThread1of2ForFork0_~p~0#1.offset_109|) 2147483647))))) is different from false [2023-08-27 11:55:00,077 INFO L124 PetriNetUnfolderBase]: 3595/7940 cut-off events. [2023-08-27 11:55:00,078 INFO L125 PetriNetUnfolderBase]: For 157481/157573 co-relation queries the response was YES. [2023-08-27 11:55:00,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61729 conditions, 7940 events. 3595/7940 cut-off events. For 157481/157573 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 71945 event pairs, 749 based on Foata normal form. 14/7905 useless extension candidates. Maximal degree in co-relation 61585. Up to 4830 conditions per place. [2023-08-27 11:55:00,196 INFO L140 encePairwiseOnDemand]: 577/597 looper letters, 507 selfloop transitions, 177 changer transitions 24/714 dead transitions. [2023-08-27 11:55:00,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 714 transitions, 13007 flow [2023-08-27 11:55:00,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-27 11:55:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-27 11:55:00,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 5362 transitions. [2023-08-27 11:55:00,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34544517459090324 [2023-08-27 11:55:00,200 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 5362 transitions. [2023-08-27 11:55:00,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 5362 transitions. [2023-08-27 11:55:00,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:55:00,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 5362 transitions. [2023-08-27 11:55:00,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 206.23076923076923) internal successors, (5362), 26 states have internal predecessors, (5362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:55:00,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 597.0) internal successors, (16119), 27 states have internal predecessors, (16119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:55:00,215 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 597.0) internal successors, (16119), 27 states have internal predecessors, (16119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:55:00,215 INFO L175 Difference]: Start difference. First operand has 315 places, 488 transitions, 8437 flow. Second operand 26 states and 5362 transitions. [2023-08-27 11:55:00,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 714 transitions, 13007 flow [2023-08-27 11:55:00,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 714 transitions, 12774 flow, removed 63 selfloop flow, removed 8 redundant places. [2023-08-27 11:55:00,913 INFO L231 Difference]: Finished difference. Result has 342 places, 559 transitions, 10154 flow [2023-08-27 11:55:00,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=8188, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=10154, PETRI_PLACES=342, PETRI_TRANSITIONS=559} [2023-08-27 11:55:00,913 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 256 predicate places. [2023-08-27 11:55:00,914 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 559 transitions, 10154 flow [2023-08-27 11:55:00,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 199.33333333333334) internal successors, (4784), 24 states have internal predecessors, (4784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:55:00,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:55:00,914 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, 1] [2023-08-27 11:55:00,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2023-08-27 11:55:01,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2023-08-27 11:55:01,115 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:55:01,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:55:01,115 INFO L85 PathProgramCache]: Analyzing trace with hash -224705879, now seen corresponding path program 2 times [2023-08-27 11:55:01,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:55:01,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612346141] [2023-08-27 11:55:01,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:55:01,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:55:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:55:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:55:01,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:55:01,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612346141] [2023-08-27 11:55:01,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612346141] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:55:01,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712087825] [2023-08-27 11:55:01,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 11:55:01,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:55:01,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:55:01,445 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 11:55:01,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-08-27 11:55:01,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 11:55:01,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:55:01,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 11:55:01,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:55:01,666 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-27 11:55:01,716 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:55:01,716 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-27 11:55:01,733 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-27 11:55:01,789 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-27 11:55:01,833 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-27 11:55:01,908 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-27 11:55:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:55:01,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:55:09,962 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) |c_t_funThread1of2ForFork0_#t~post39#1|))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:55:11,969 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:55:13,974 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:55:15,995 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_#t~post36#1|)) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:55:24,027 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2799 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2799))) (store .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of2ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse1 |t_funThread1of2ForFork0_~p~0#1.offset|))))) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:55:24,041 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2799 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2799) |c_~#a~0.base|))) (store .cse0 |t_funThread1of2ForFork0_~p~0#1.offset| (select .cse0 |t_funThread1of2ForFork0_~p~0#1.offset|))) |t_funThread2of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-08-27 11:55:24,107 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-08-27 11:55:24,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712087825] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:55:24,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:55:24,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-08-27 11:55:24,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349666714] [2023-08-27 11:55:24,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:55:24,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-27 11:55:24,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:55:24,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-27 11:55:24,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=389, Unknown=13, NotChecked=270, Total=756 [2023-08-27 11:55:24,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 597 [2023-08-27 11:55:24,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 559 transitions, 10154 flow. Second operand has 28 states, 28 states have (on average 208.17857142857142) internal successors, (5829), 28 states have internal predecessors, (5829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:55:24,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:55:24,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 597 [2023-08-27 11:55:24,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:55:54,606 WARN L234 SmtUtils]: Spent 30.03s on a formula simplification. DAG size of input: 29 DAG size of output: 22 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:55:56,693 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-27 11:55:58,695 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-27 11:56:00,701 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-27 11:56:02,704 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-27 11:56:04,706 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-27 11:56:06,709 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-27 11:56:08,722 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 [0, 1] [2023-08-27 11:56:10,731 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-27 11:56:12,741 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-27 11:56:14,744 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-27 11:56:16,746 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-27 11:56:18,748 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-27 11:56:20,753 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-27 11:56:22,755 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-27 11:56:24,758 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-27 11:56:26,760 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-27 11:56:28,778 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-27 11:56:30,781 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-27 11:56:32,787 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-27 11:56:34,790 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-27 11:56:36,792 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-27 11:56:38,794 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-27 11:56:40,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 11:56:42,804 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-27 11:56:44,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:56:46,831 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-27 11:56:48,833 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-27 11:56:50,838 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-27 11:56:52,840 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-27 11:56:54,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-27 11:56:56,852 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-27 11:56:58,855 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-27 11:57:00,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-27 11:57:02,861 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-27 11:57:04,868 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-27 11:57:06,870 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-27 11:57:08,876 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-27 11:57:10,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-27 11:57:12,883 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 [0, 1] [2023-08-27 11:57:14,891 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-27 11:57:16,893 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-27 11:57:18,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-27 11:57:20,897 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-27 11:57:22,900 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-27 11:57:24,903 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-27 11:57:26,905 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-27 11:57:28,912 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-27 11:57:30,914 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-27 11:57:32,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:57:34,940 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-27 11:57:36,942 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-27 11:57:38,944 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-27 11:57:40,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:57:43,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 11:57:45,314 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-27 11:57:47,320 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-27 11:57:49,322 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-27 11:57:51,325 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-27 11:57:53,391 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-27 11:57:55,393 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-27 11:57:57,396 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-27 11:57:59,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-27 11:58:01,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-27 11:58:03,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:58:05,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 [0, 1] [2023-08-27 11:58:07,432 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-27 11:58:09,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:58:11,456 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-27 11:58:13,458 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-27 11:58:15,460 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-27 11:58:17,462 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-27 11:58:19,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:58:21,481 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-27 11:58:23,483 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-27 11:58:25,537 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-27 11:58:29,277 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-27 11:58:30,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:58:32,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:58:34,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 11:58:35,302 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 [1] [2023-08-27 11:58:37,304 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-27 11:58:39,999 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 [1] [2023-08-27 11:58:45,429 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-27 11:58:49,077 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-27 11:58:52,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-27 11:58:54,041 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-27 11:58:56,054 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-27 11:58:58,056 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-27 11:59:00,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-27 11:59:02,060 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-27 11:59:04,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-27 11:59:06,066 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-27 11:59:08,074 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-27 11:59:10,076 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-27 11:59:12,078 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-27 11:59:14,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-27 11:59:16,084 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-27 11:59:18,089 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-27 11:59:20,099 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-27 11:59:28,142 WARN L234 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 31 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:59:30,266 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-27 11:59:32,910 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-27 11:59:34,912 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-27 11:59:37,171 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] Received shutdown request... [2023-08-27 11:59:40,042 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 11:59:40,042 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-27 11:59:41,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-08-27 11:59:41,244 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-27 11:59:41,267 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONASSERT (25 of 26 remaining) [2023-08-27 11:59:41,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-08-27 11:59:41,267 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-27 11:59:41,267 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 26 remaining) [2023-08-27 11:59:41,267 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 26 remaining) [2023-08-27 11:59:41,267 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (18 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONASSERT (12 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 26 remaining) [2023-08-27 11:59:41,268 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 26 remaining) [2023-08-27 11:59:41,269 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 26 remaining) [2023-08-27 11:59:41,269 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 26 remaining) [2023-08-27 11:59:41,269 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 26 remaining) [2023-08-27 11:59:41,269 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 26 remaining) [2023-08-27 11:59:41,269 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONASSERT (1 of 26 remaining) [2023-08-27 11:59:41,269 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 26 remaining) [2023-08-27 11:59:41,269 INFO L445 BasicCegarLoop]: Path program histogram: [6, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:59:41,269 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-27 11:59:41,270 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-27 11:59:41,270 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 11:59:41,271 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-27 11:59:41,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 11:59:41 BasicIcfg [2023-08-27 11:59:41,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 11:59:41,274 INFO L158 Benchmark]: Toolchain (without parser) took 831539.07ms. Allocated memory was 354.4MB in the beginning and 14.1GB in the end (delta: 13.7GB). Free memory was 328.8MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. [2023-08-27 11:59:41,274 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 354.4MB. Free memory was 330.9MB in the beginning and 330.7MB in the end (delta: 144.5kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 11:59:41,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 675.95ms. Allocated memory is still 354.4MB. Free memory was 328.8MB in the beginning and 299.1MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-27 11:59:41,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.10ms. Allocated memory is still 354.4MB. Free memory was 299.1MB in the beginning and 296.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 11:59:41,275 INFO L158 Benchmark]: Boogie Preprocessor took 47.45ms. Allocated memory is still 354.4MB. Free memory was 296.2MB in the beginning and 294.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 11:59:41,275 INFO L158 Benchmark]: RCFGBuilder took 482.41ms. Allocated memory is still 354.4MB. Free memory was 294.1MB in the beginning and 319.8MB in the end (delta: -25.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.0GB. [2023-08-27 11:59:41,275 INFO L158 Benchmark]: TraceAbstraction took 830249.27ms. Allocated memory was 354.4MB in the beginning and 14.1GB in the end (delta: 13.7GB). Free memory was 318.6MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. [2023-08-27 11:59:41,275 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 354.4MB. Free memory was 330.9MB in the beginning and 330.7MB in the end (delta: 144.5kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 675.95ms. Allocated memory is still 354.4MB. Free memory was 328.8MB in the beginning and 299.1MB in the end (delta: 29.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 75.10ms. Allocated memory is still 354.4MB. Free memory was 299.1MB in the beginning and 296.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.45ms. Allocated memory is still 354.4MB. Free memory was 296.2MB in the beginning and 294.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 482.41ms. Allocated memory is still 354.4MB. Free memory was 294.1MB in the beginning and 319.8MB in the end (delta: -25.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.0GB. * TraceAbstraction took 830249.27ms. Allocated memory was 354.4MB in the beginning and 14.1GB in the end (delta: 13.7GB). Free memory was 318.6MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 8.3GB. 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: 3.4s, 197 PlacesBefore, 60 PlacesAfterwards, 226 TransitionsBefore, 82 TransitionsAfterwards, 15040 CoEnabledTransitionPairs, 5 FixpointIterations, 45 TrivialSequentialCompositions, 132 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 18 ConcurrentYvCompositions, 7 ChoiceCompositions, 207 TotalNumberOfCompositions, 23492 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13482, independent: 13196, independent conditional: 0, independent unconditional: 13196, dependent: 286, dependent conditional: 0, dependent unconditional: 286, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8091, independent: 8008, independent conditional: 0, independent unconditional: 8008, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 13482, independent: 5188, independent conditional: 0, independent unconditional: 5188, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 8091, unknown conditional: 0, unknown unconditional: 8091] , Statistics on independence cache: Total cache size (in pairs): 452, Positive cache size: 415, Positive conditional cache size: 0, Positive unconditional cache size: 415, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 189 PlacesBefore, 55 PlacesAfterwards, 218 TransitionsBefore, 77 TransitionsAfterwards, 15040 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 131 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 18 ConcurrentYvCompositions, 7 ChoiceCompositions, 197 TotalNumberOfCompositions, 25118 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14663, independent: 14330, independent conditional: 0, independent unconditional: 14330, dependent: 333, dependent conditional: 0, dependent unconditional: 333, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8201, independent: 8121, independent conditional: 0, independent unconditional: 8121, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14663, independent: 6209, independent conditional: 0, independent unconditional: 6209, dependent: 253, dependent conditional: 0, dependent unconditional: 253, unknown: 8201, unknown conditional: 0, unknown unconditional: 8201] , Statistics on independence cache: Total cache size (in pairs): 507, Positive cache size: 473, Positive conditional cache size: 0, Positive unconditional cache size: 473, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 268 PlacesBefore, 86 PlacesAfterwards, 311 TransitionsBefore, 119 TransitionsAfterwards, 45920 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 198 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 32 ConcurrentYvCompositions, 10 ChoiceCompositions, 286 TotalNumberOfCompositions, 80999 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 38969, independent: 38449, independent conditional: 0, independent unconditional: 38449, dependent: 520, dependent conditional: 0, dependent unconditional: 520, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 23843, independent: 23736, independent conditional: 0, independent unconditional: 23736, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 38969, independent: 14713, independent conditional: 0, independent unconditional: 14713, dependent: 413, dependent conditional: 0, dependent unconditional: 413, unknown: 23843, unknown conditional: 0, unknown unconditional: 23843] , Statistics on independence cache: Total cache size (in pairs): 558, Positive cache size: 506, Positive conditional cache size: 0, Positive unconditional cache size: 506, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 944]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 955]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 953]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 944]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 944]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 955]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 944]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 953]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 955]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 949]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 957]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 957]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 955]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 949]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 264 locations, 22 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: 23.7s, OverallIterations: 12, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 807 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 807 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 939 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3060 IncrementalHoareTripleChecker+Invalid, 4057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 0 mSDtfsCounter, 3060 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 182 SyntacticMatches, 6 SemanticMatches, 106 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=9, InterpolantAutomatonStates: 75, 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.3s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 390 ConstructedInterpolants, 47 QuantifiedInterpolants, 4166 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1144 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 836/881 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, 331 locations, 27 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: 802.6s, OverallIterations: 35, TraceHistogramMax: 10, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 626.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 835 mSolverCounterUnknown, 7681 SdHoareTripleChecker+Valid, 431.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7681 mSDsluCounter, 265 SdHoareTripleChecker+Invalid, 428.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 10217 IncrementalHoareTripleChecker+Unchecked, 242 mSDsCounter, 881 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22583 IncrementalHoareTripleChecker+Invalid, 34517 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 881 mSolverCounterUnsat, 23 mSDtfsCounter, 22583 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 835 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1886 GetRequests, 1138 SyntacticMatches, 41 SemanticMatches, 707 ConstructedPredicates, 54 IntricatePredicates, 9 DeprecatedPredicates, 4221 ImplicationChecksByTransitivity, 264.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10154occurred in iteration=34, InterpolantAutomatonStates: 412, 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.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 161.3s InterpolantComputationTime, 1572 NumberOfCodeBlocks, 1556 NumberOfCodeBlocksAsserted, 85 NumberOfCheckSat, 2175 ConstructedInterpolants, 594 QuantifiedInterpolants, 39029 SizeOfPredicates, 167 NumberOfNonLiveVariables, 6294 ConjunctsInSsa, 710 ConjunctsInUnsatCore, 86 InterpolantComputations, 10 PerfectInterpolantSequences, 4239/4517 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, 264 locations, 22 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: 3.8s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.2s 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, 295 IncrementalHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 295 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred 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.1s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 240 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