/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_75-tricky_address2_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 11:46:22,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 11:46:22,833 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:46:22,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 11:46:22,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 11:46:22,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 11:46:22,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 11:46:22,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 11:46:22,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 11:46:22,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 11:46:22,878 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 11:46:22,879 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 11:46:22,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 11:46:22,880 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 11:46:22,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 11:46:22,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 11:46:22,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 11:46:22,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 11:46:22,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 11:46:22,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 11:46:22,882 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 11:46:22,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 11:46:22,883 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 11:46:22,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 11:46:22,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 11:46:22,884 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 11:46:22,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 11:46:22,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 11:46:22,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 11:46:22,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 11:46:22,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 11:46:22,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 11:46:22,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 11:46:22,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 11:46:22,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 11:46:22,887 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:46:23,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 11:46:23,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 11:46:23,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 11:46:23,192 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 11:46:23,193 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 11:46:23,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2023-08-27 11:46:24,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 11:46:24,721 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 11:46:24,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2023-08-27 11:46:24,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8f14c1c/79b2523d7d7d4c96b23a4419f255c1d1/FLAGb1e38d8ea [2023-08-27 11:46:24,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8f14c1c/79b2523d7d7d4c96b23a4419f255c1d1 [2023-08-27 11:46:24,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 11:46:24,762 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 11:46:24,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 11:46:24,763 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 11:46:24,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 11:46:24,766 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:46:24" (1/1) ... [2023-08-27 11:46:24,767 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@594be899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:46:24, skipping insertion in model container [2023-08-27 11:46:24,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 11:46:24" (1/1) ... [2023-08-27 11:46:24,820 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 11:46:25,228 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 11:46:25,244 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 11:46:25,260 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-27 11:46:25,262 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-27 11:46:25,274 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-27 11:46:25,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 11:46:25,340 INFO L206 MainTranslator]: Completed translation [2023-08-27 11:46:25,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:46:25 WrapperNode [2023-08-27 11:46:25,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 11:46:25,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 11:46:25,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 11:46:25,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 11:46:25,347 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:46:25" (1/1) ... [2023-08-27 11:46:25,366 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:46:25" (1/1) ... [2023-08-27 11:46:25,392 INFO L138 Inliner]: procedures = 270, calls = 42, calls flagged for inlining = 7, calls inlined = 8, statements flattened = 213 [2023-08-27 11:46:25,392 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 11:46:25,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 11:46:25,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 11:46:25,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 11:46:25,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:46:25" (1/1) ... [2023-08-27 11:46:25,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:46:25" (1/1) ... [2023-08-27 11:46:25,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:46:25" (1/1) ... [2023-08-27 11:46:25,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:46:25" (1/1) ... [2023-08-27 11:46:25,413 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:46:25" (1/1) ... [2023-08-27 11:46:25,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:46:25" (1/1) ... [2023-08-27 11:46:25,419 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:46:25" (1/1) ... [2023-08-27 11:46:25,420 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:46:25" (1/1) ... [2023-08-27 11:46:25,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 11:46:25,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 11:46:25,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 11:46:25,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 11:46:25,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:46:25" (1/1) ... [2023-08-27 11:46:25,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 11:46:25,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:25,453 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:46:25,459 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:46:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 11:46:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 11:46:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 11:46:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 11:46:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-27 11:46:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 11:46:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-27 11:46:25,485 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-27 11:46:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 11:46:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 11:46:25,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 11:46:25,487 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:46:25,591 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 11:46:25,592 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 11:46:25,827 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 11:46:25,834 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 11:46:25,835 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-08-27 11:46:25,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:46:25 BoogieIcfgContainer [2023-08-27 11:46:25,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 11:46:25,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 11:46:25,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 11:46:25,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 11:46:25,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 11:46:24" (1/3) ... [2023-08-27 11:46:25,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af87892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:46:25, skipping insertion in model container [2023-08-27 11:46:25,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 11:46:25" (2/3) ... [2023-08-27 11:46:25,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af87892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 11:46:25, skipping insertion in model container [2023-08-27 11:46:25,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 11:46:25" (3/3) ... [2023-08-27 11:46:25,843 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_75-tricky_address2_racefree.i [2023-08-27 11:46:25,857 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 11:46:25,857 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-08-27 11:46:25,857 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 11:46:25,935 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-27 11:46:25,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 229 transitions, 466 flow [2023-08-27 11:46:26,065 INFO L124 PetriNetUnfolderBase]: 48/313 cut-off events. [2023-08-27 11:46:26,065 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-27 11:46:26,075 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:26,076 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 229 transitions, 466 flow [2023-08-27 11:46:26,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 226 transitions, 460 flow [2023-08-27 11:46:26,092 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 11:46:26,105 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 226 transitions, 460 flow [2023-08-27 11:46:26,111 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 226 transitions, 460 flow [2023-08-27 11:46:26,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 226 transitions, 460 flow [2023-08-27 11:46:26,178 INFO L124 PetriNetUnfolderBase]: 47/310 cut-off events. [2023-08-27 11:46:26,178 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-27 11:46:26,183 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:46:26,191 INFO L119 LiptonReduction]: Number of co-enabled transitions 15040 [2023-08-27 11:46:29,410 INFO L134 LiptonReduction]: Checked pairs total: 23492 [2023-08-27 11:46:29,410 INFO L136 LiptonReduction]: Total number of compositions: 207 [2023-08-27 11:46:29,421 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 11:46:29,425 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;@4a0f4920, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 11:46:29,426 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-08-27 11:46:29,427 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 11:46:29,427 INFO L124 PetriNetUnfolderBase]: 1/2 cut-off events. [2023-08-27 11:46:29,427 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 11:46:29,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:29,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-27 11:46:29,428 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:46:29,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:29,432 INFO L85 PathProgramCache]: Analyzing trace with hash 28997, now seen corresponding path program 1 times [2023-08-27 11:46:29,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:29,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442732163] [2023-08-27 11:46:29,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:29,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:29,624 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:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442732163] [2023-08-27 11:46:29,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442732163] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:29,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:46:29,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 11:46:29,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939197072] [2023-08-27 11:46:29,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:29,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:46:29,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:29,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:46:29,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:46:29,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 436 [2023-08-27 11:46:29,657 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:46:29,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:29,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 436 [2023-08-27 11:46:29,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:29,860 INFO L124 PetriNetUnfolderBase]: 521/1093 cut-off events. [2023-08-27 11:46:29,860 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-27 11:46:29,861 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:46:29,866 INFO L140 encePairwiseOnDemand]: 408/436 looper letters, 51 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-27 11:46:29,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 232 flow [2023-08-27 11:46:29,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:46:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:46:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 644 transitions. [2023-08-27 11:46:29,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4923547400611621 [2023-08-27 11:46:29,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 644 transitions. [2023-08-27 11:46:29,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 644 transitions. [2023-08-27 11:46:29,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:29,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 644 transitions. [2023-08-27 11:46:29,888 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:46:29,893 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:29,894 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:29,895 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:46:29,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 232 flow [2023-08-27 11:46:29,898 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:46:29,900 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 138 flow [2023-08-27 11:46:29,902 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:46:29,905 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2023-08-27 11:46:29,905 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 138 flow [2023-08-27 11:46:29,905 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:46:29,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:29,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 11:46:29,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 11:46:29,906 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:46:29,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:29,907 INFO L85 PathProgramCache]: Analyzing trace with hash 900686, now seen corresponding path program 1 times [2023-08-27 11:46:29,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:29,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381137543] [2023-08-27 11:46:29,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:29,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:29,962 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:29,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:29,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381137543] [2023-08-27 11:46:29,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381137543] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:29,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:46:29,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:46:29,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189675180] [2023-08-27 11:46:29,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:29,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:46:29,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:29,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:46:29,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:46:29,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 436 [2023-08-27 11:46:29,967 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:46:29,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:29,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 436 [2023-08-27 11:46:29,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:30,138 INFO L124 PetriNetUnfolderBase]: 521/1092 cut-off events. [2023-08-27 11:46:30,139 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-27 11:46:30,140 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:46:30,144 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 50 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-27 11:46:30,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 238 flow [2023-08-27 11:46:30,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:46:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:46:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 616 transitions. [2023-08-27 11:46:30,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4709480122324159 [2023-08-27 11:46:30,146 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 616 transitions. [2023-08-27 11:46:30,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 616 transitions. [2023-08-27 11:46:30,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:30,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 616 transitions. [2023-08-27 11:46:30,148 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:46:30,151 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:30,152 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:30,152 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:46:30,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 238 flow [2023-08-27 11:46:30,153 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:46:30,155 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 134 flow [2023-08-27 11:46:30,155 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:46:30,156 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2023-08-27 11:46:30,156 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 134 flow [2023-08-27 11:46:30,156 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:46:30,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:30,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 11:46:30,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 11:46:30,158 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:46:30,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:30,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1065048238, now seen corresponding path program 1 times [2023-08-27 11:46:30,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:30,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139126473] [2023-08-27 11:46:30,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:30,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:30,257 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:30,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:30,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139126473] [2023-08-27 11:46:30,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139126473] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:30,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842902562] [2023-08-27 11:46:30,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:30,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:30,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:30,265 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:46:30,304 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:46:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:30,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 11:46:30,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:30,421 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:30,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:46:30,452 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:30,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842902562] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:46:30,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:46:30,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-27 11:46:30,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106902749] [2023-08-27 11:46:30,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:46:30,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 11:46:30,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:30,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 11:46:30,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 11:46:30,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 436 [2023-08-27 11:46:30,456 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:46:30,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:30,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 436 [2023-08-27 11:46:30,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:30,646 INFO L124 PetriNetUnfolderBase]: 521/1095 cut-off events. [2023-08-27 11:46:30,647 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 11:46:30,648 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:46:30,652 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 50 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2023-08-27 11:46:30,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 256 flow [2023-08-27 11:46:30,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 11:46:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 11:46:30,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1186 transitions. [2023-08-27 11:46:30,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533639143730887 [2023-08-27 11:46:30,656 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1186 transitions. [2023-08-27 11:46:30,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1186 transitions. [2023-08-27 11:46:30,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:30,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1186 transitions. [2023-08-27 11:46:30,659 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:46:30,663 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:30,664 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:30,664 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:46:30,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 256 flow [2023-08-27 11:46:30,666 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:46:30,668 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 166 flow [2023-08-27 11:46:30,668 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:46:30,670 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2023-08-27 11:46:30,670 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 166 flow [2023-08-27 11:46:30,671 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:46:30,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:30,671 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1] [2023-08-27 11:46:30,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-27 11:46:30,877 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:46:30,877 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:46:30,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:30,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1097272343, now seen corresponding path program 2 times [2023-08-27 11:46:30,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:30,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758860168] [2023-08-27 11:46:30,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:30,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:30,967 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:30,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:30,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758860168] [2023-08-27 11:46:30,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758860168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:30,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:46:30,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:46:30,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513180123] [2023-08-27 11:46:30,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:30,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:46:30,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:30,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:46:30,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:46:30,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 436 [2023-08-27 11:46:30,972 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:46:30,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:30,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 436 [2023-08-27 11:46:30,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:31,104 INFO L124 PetriNetUnfolderBase]: 459/991 cut-off events. [2023-08-27 11:46:31,104 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-27 11:46:31,105 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:46:31,109 INFO L140 encePairwiseOnDemand]: 431/436 looper letters, 71 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2023-08-27 11:46:31,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 79 transitions, 348 flow [2023-08-27 11:46:31,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:46:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:46:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2023-08-27 11:46:31,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48623853211009177 [2023-08-27 11:46:31,111 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 636 transitions. [2023-08-27 11:46:31,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 636 transitions. [2023-08-27 11:46:31,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:31,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 636 transitions. [2023-08-27 11:46:31,113 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:46:31,116 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:31,116 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:31,116 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:46:31,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 79 transitions, 348 flow [2023-08-27 11:46:31,121 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:46:31,122 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 156 flow [2023-08-27 11:46:31,122 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:46:31,123 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2023-08-27 11:46:31,123 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 156 flow [2023-08-27 11:46:31,124 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:46:31,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:31,124 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:31,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 11:46:31,124 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:46:31,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:31,125 INFO L85 PathProgramCache]: Analyzing trace with hash -153310722, now seen corresponding path program 1 times [2023-08-27 11:46:31,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:31,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808657944] [2023-08-27 11:46:31,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:31,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:31,251 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,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:31,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808657944] [2023-08-27 11:46:31,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808657944] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:31,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577169661] [2023-08-27 11:46:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:31,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:31,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:31,258 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:46:31,265 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:46:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:31,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-27 11:46:31,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:31,363 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,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:46:31,413 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,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577169661] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:46:31,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:46:31,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-27 11:46:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662215686] [2023-08-27 11:46:31,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:46:31,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-27 11:46:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:31,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-27 11:46:31,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-27 11:46:31,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 436 [2023-08-27 11:46:31,420 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:46:31,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:31,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 436 [2023-08-27 11:46:31,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:31,611 INFO L124 PetriNetUnfolderBase]: 480/992 cut-off events. [2023-08-27 11:46:31,611 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2023-08-27 11:46:31,613 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:46:31,616 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 48 selfloop transitions, 11 changer transitions 0/65 dead transitions. [2023-08-27 11:46:31,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 65 transitions, 310 flow [2023-08-27 11:46:31,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 11:46:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 11:46:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2321 transitions. [2023-08-27 11:46:31,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4436162079510703 [2023-08-27 11:46:31,622 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2321 transitions. [2023-08-27 11:46:31,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2321 transitions. [2023-08-27 11:46:31,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:31,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2321 transitions. [2023-08-27 11:46:31,628 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:46:31,636 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:46:31,638 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:46:31,638 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:46:31,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 65 transitions, 310 flow [2023-08-27 11:46:31,640 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:46:31,641 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 236 flow [2023-08-27 11:46:31,641 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:46:31,642 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 22 predicate places. [2023-08-27 11:46:31,642 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 236 flow [2023-08-27 11:46:31,643 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:46:31,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:31,643 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:31,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-27 11:46:31,851 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:46:31,852 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:46:31,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:31,852 INFO L85 PathProgramCache]: Analyzing trace with hash -854491810, now seen corresponding path program 2 times [2023-08-27 11:46:31,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:31,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025459508] [2023-08-27 11:46:31,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:31,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:32,184 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:32,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:32,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025459508] [2023-08-27 11:46:32,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025459508] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:32,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:46:32,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 11:46:32,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997871449] [2023-08-27 11:46:32,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:32,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 11:46:32,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:32,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 11:46:32,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-08-27 11:46:32,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 436 [2023-08-27 11:46:32,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 148.28571428571428) internal successors, (1038), 7 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states 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:32,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:32,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 436 [2023-08-27 11:46:32,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:32,424 INFO L124 PetriNetUnfolderBase]: 458/1009 cut-off events. [2023-08-27 11:46:32,424 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-08-27 11:46:32,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2080 conditions, 1009 events. 458/1009 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5450 event pairs, 215 based on Foata normal form. 0/806 useless extension candidates. Maximal degree in co-relation 2003. Up to 653 conditions per place. [2023-08-27 11:46:32,429 INFO L140 encePairwiseOnDemand]: 424/436 looper letters, 94 selfloop transitions, 6 changer transitions 0/105 dead transitions. [2023-08-27 11:46:32,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 105 transitions, 525 flow [2023-08-27 11:46:32,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 11:46:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 11:46:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 831 transitions. [2023-08-27 11:46:32,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3811926605504587 [2023-08-27 11:46:32,432 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 831 transitions. [2023-08-27 11:46:32,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 831 transitions. [2023-08-27 11:46:32,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:32,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 831 transitions. [2023-08-27 11:46:32,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.2) internal successors, (831), 5 states have internal predecessors, (831), 0 states have call successors, (0), 0 states 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:32,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 436.0) internal successors, (2616), 6 states have internal predecessors, (2616), 0 states have call successors, (0), 0 states 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:32,439 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 436.0) internal successors, (2616), 6 states have internal predecessors, (2616), 0 states have call successors, (0), 0 states 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:32,439 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 236 flow. Second operand 5 states and 831 transitions. [2023-08-27 11:46:32,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 105 transitions, 525 flow [2023-08-27 11:46:32,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 105 transitions, 477 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-27 11:46:32,442 INFO L231 Difference]: Finished difference. Result has 84 places, 69 transitions, 238 flow [2023-08-27 11:46:32,443 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=238, PETRI_PLACES=84, PETRI_TRANSITIONS=69} [2023-08-27 11:46:32,443 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 24 predicate places. [2023-08-27 11:46:32,443 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 69 transitions, 238 flow [2023-08-27 11:46:32,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 148.28571428571428) internal successors, (1038), 7 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states 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:32,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:32,444 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:32,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 11:46:32,445 INFO L420 AbstractCegarLoop]: === Iteration 7 === 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:32,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:32,445 INFO L85 PathProgramCache]: Analyzing trace with hash -967363572, now seen corresponding path program 1 times [2023-08-27 11:46:32,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:32,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73981375] [2023-08-27 11:46:32,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:32,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:32,769 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:32,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:32,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73981375] [2023-08-27 11:46:32,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73981375] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:32,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:46:32,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 11:46:32,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447042698] [2023-08-27 11:46:32,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:32,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 11:46:32,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:32,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 11:46:32,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-27 11:46:32,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 436 [2023-08-27 11:46:32,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 69 transitions, 238 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:32,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:32,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 436 [2023-08-27 11:46:32,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:33,062 INFO L124 PetriNetUnfolderBase]: 448/1016 cut-off events. [2023-08-27 11:46:33,063 INFO L125 PetriNetUnfolderBase]: For 216/216 co-relation queries the response was YES. [2023-08-27 11:46:33,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2247 conditions, 1016 events. 448/1016 cut-off events. For 216/216 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5552 event pairs, 176 based on Foata normal form. 0/864 useless extension candidates. Maximal degree in co-relation 2190. Up to 561 conditions per place. [2023-08-27 11:46:33,068 INFO L140 encePairwiseOnDemand]: 428/436 looper letters, 111 selfloop transitions, 9 changer transitions 1/126 dead transitions. [2023-08-27 11:46:33,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 126 transitions, 618 flow [2023-08-27 11:46:33,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 11:46:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 11:46:33,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 981 transitions. [2023-08-27 11:46:33,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2023-08-27 11:46:33,072 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 981 transitions. [2023-08-27 11:46:33,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 981 transitions. [2023-08-27 11:46:33,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:33,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 981 transitions. [2023-08-27 11:46:33,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states 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,078 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:33,079 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:33,079 INFO L175 Difference]: Start difference. First operand has 84 places, 69 transitions, 238 flow. Second operand 6 states and 981 transitions. [2023-08-27 11:46:33,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 126 transitions, 618 flow [2023-08-27 11:46:33,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 126 transitions, 616 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 11:46:33,083 INFO L231 Difference]: Finished difference. Result has 90 places, 74 transitions, 287 flow [2023-08-27 11:46:33,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=90, PETRI_TRANSITIONS=74} [2023-08-27 11:46:33,084 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 30 predicate places. [2023-08-27 11:46:33,084 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 74 transitions, 287 flow [2023-08-27 11:46:33,084 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:33,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:33,085 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:33,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 11:46:33,085 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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:33,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:33,085 INFO L85 PathProgramCache]: Analyzing trace with hash -967363571, now seen corresponding path program 1 times [2023-08-27 11:46:33,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:33,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048483632] [2023-08-27 11:46:33,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:33,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:33,174 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,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:33,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048483632] [2023-08-27 11:46:33,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048483632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:33,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:46:33,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:46:33,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138473487] [2023-08-27 11:46:33,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:33,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:46:33,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:33,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:46:33,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:46:33,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 436 [2023-08-27 11:46:33,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 74 transitions, 287 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:33,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 436 [2023-08-27 11:46:33,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:33,328 INFO L124 PetriNetUnfolderBase]: 399/927 cut-off events. [2023-08-27 11:46:33,328 INFO L125 PetriNetUnfolderBase]: For 397/397 co-relation queries the response was YES. [2023-08-27 11:46:33,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 927 events. 399/927 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5230 event pairs, 199 based on Foata normal form. 0/817 useless extension candidates. Maximal degree in co-relation 2156. Up to 565 conditions per place. [2023-08-27 11:46:33,333 INFO L140 encePairwiseOnDemand]: 428/436 looper letters, 81 selfloop transitions, 9 changer transitions 6/102 dead transitions. [2023-08-27 11:46:33,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 102 transitions, 553 flow [2023-08-27 11:46:33,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:46:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:46:33,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2023-08-27 11:46:33,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44724770642201833 [2023-08-27 11:46:33,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 585 transitions. [2023-08-27 11:46:33,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 585 transitions. [2023-08-27 11:46:33,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:33,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 585 transitions. [2023-08-27 11:46:33,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:46:33,339 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:33,340 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:33,340 INFO L175 Difference]: Start difference. First operand has 90 places, 74 transitions, 287 flow. Second operand 3 states and 585 transitions. [2023-08-27 11:46:33,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 102 transitions, 553 flow [2023-08-27 11:46:33,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 102 transitions, 539 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 11:46:33,344 INFO L231 Difference]: Finished difference. Result has 91 places, 75 transitions, 321 flow [2023-08-27 11:46:33,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=91, PETRI_TRANSITIONS=75} [2023-08-27 11:46:33,344 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 31 predicate places. [2023-08-27 11:46:33,345 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 75 transitions, 321 flow [2023-08-27 11:46:33,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states 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,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:33,345 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:33,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 11:46:33,345 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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:33,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:33,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2095289083, now seen corresponding path program 1 times [2023-08-27 11:46:33,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:33,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367932069] [2023-08-27 11:46:33,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:33,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:33,392 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:33,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:33,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367932069] [2023-08-27 11:46:33,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367932069] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:33,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517035492] [2023-08-27 11:46:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:33,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:33,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:33,394 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:46:33,396 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:46:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:33,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 11:46:33,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:33,498 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:33,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:46:33,512 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:33,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517035492] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:46:33,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:46:33,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-27 11:46:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839368690] [2023-08-27 11:46:33,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:46:33,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 11:46:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:33,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 11:46:33,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 11:46:33,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 436 [2023-08-27 11:46:33,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 75 transitions, 321 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:33,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:33,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 436 [2023-08-27 11:46:33,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:33,559 INFO L124 PetriNetUnfolderBase]: 23/90 cut-off events. [2023-08-27 11:46:33,559 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2023-08-27 11:46:33,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 90 events. 23/90 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 188 event pairs, 5 based on Foata normal form. 16/104 useless extension candidates. Maximal degree in co-relation 279. Up to 50 conditions per place. [2023-08-27 11:46:33,560 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 29 selfloop transitions, 2 changer transitions 18/52 dead transitions. [2023-08-27 11:46:33,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 52 transitions, 330 flow [2023-08-27 11:46:33,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 11:46:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 11:46:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 790 transitions. [2023-08-27 11:46:33,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45298165137614677 [2023-08-27 11:46:33,562 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 790 transitions. [2023-08-27 11:46:33,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 790 transitions. [2023-08-27 11:46:33,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:33,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 790 transitions. [2023-08-27 11:46:33,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.5) internal successors, (790), 4 states have internal predecessors, (790), 0 states have call successors, (0), 0 states 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,567 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:33,568 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:33,568 INFO L175 Difference]: Start difference. First operand has 91 places, 75 transitions, 321 flow. Second operand 4 states and 790 transitions. [2023-08-27 11:46:33,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 52 transitions, 330 flow [2023-08-27 11:46:33,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 52 transitions, 285 flow, removed 3 selfloop flow, removed 9 redundant places. [2023-08-27 11:46:33,570 INFO L231 Difference]: Finished difference. Result has 56 places, 28 transitions, 129 flow [2023-08-27 11:46:33,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=56, PETRI_TRANSITIONS=28} [2023-08-27 11:46:33,571 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-08-27 11:46:33,571 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 28 transitions, 129 flow [2023-08-27 11:46:33,571 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:33,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:33,572 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:33,583 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:33,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:33,783 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:33,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:33,784 INFO L85 PathProgramCache]: Analyzing trace with hash -986690138, now seen corresponding path program 1 times [2023-08-27 11:46:33,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:33,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747375326] [2023-08-27 11:46:33,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:33,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:34,231 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:34,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:34,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747375326] [2023-08-27 11:46:34,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747375326] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:34,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994623993] [2023-08-27 11:46:34,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:34,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:34,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:34,233 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:34,257 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:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:34,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-27 11:46:34,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:34,369 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-27 11:46:34,448 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:46:34,448 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:34,470 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:34,538 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 35 treesize of output 28 [2023-08-27 11:46:34,590 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 20 treesize of output 22 [2023-08-27 11:46:34,633 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:34,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:46:34,658 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_317) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) 2147483648))) is different from false [2023-08-27 11:46:39,034 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:39,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994623993] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:46:39,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:46:39,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 18 [2023-08-27 11:46:39,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406681521] [2023-08-27 11:46:39,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:46:39,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-27 11:46:39,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:39,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-27 11:46:39,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=269, Unknown=5, NotChecked=34, Total=380 [2023-08-27 11:46:39,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 436 [2023-08-27 11:46:39,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 28 transitions, 129 flow. Second operand has 20 states, 20 states have (on average 147.25) internal successors, (2945), 20 states have internal predecessors, (2945), 0 states have call successors, (0), 0 states 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:39,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:39,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 436 [2023-08-27 11:46:39,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:51,603 INFO L124 PetriNetUnfolderBase]: 11/50 cut-off events. [2023-08-27 11:46:51,603 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-08-27 11:46:51,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 50 events. 11/50 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 3 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 148. Up to 13 conditions per place. [2023-08-27 11:46:51,604 INFO L140 encePairwiseOnDemand]: 428/436 looper letters, 22 selfloop transitions, 11 changer transitions 0/35 dead transitions. [2023-08-27 11:46:51,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 35 transitions, 221 flow [2023-08-27 11:46:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 11:46:51,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 11:46:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1474 transitions. [2023-08-27 11:46:51,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33807339449541285 [2023-08-27 11:46:51,608 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1474 transitions. [2023-08-27 11:46:51,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1474 transitions. [2023-08-27 11:46:51,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:51,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1474 transitions. [2023-08-27 11:46:51,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 147.4) internal successors, (1474), 10 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states 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:51,617 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:51,618 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:51,618 INFO L175 Difference]: Start difference. First operand has 56 places, 28 transitions, 129 flow. Second operand 10 states and 1474 transitions. [2023-08-27 11:46:51,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 35 transitions, 221 flow [2023-08-27 11:46:51,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 35 transitions, 215 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 11:46:51,620 INFO L231 Difference]: Finished difference. Result has 55 places, 32 transitions, 169 flow [2023-08-27 11:46:51,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=169, PETRI_PLACES=55, PETRI_TRANSITIONS=32} [2023-08-27 11:46:51,620 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2023-08-27 11:46:51,621 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 32 transitions, 169 flow [2023-08-27 11:46:51,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 147.25) internal successors, (2945), 20 states have internal predecessors, (2945), 0 states have call successors, (0), 0 states 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:51,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:51,622 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:51,632 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:51,828 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:51,828 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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:51,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1802135941, now seen corresponding path program 1 times [2023-08-27 11:46:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:51,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816629320] [2023-08-27 11:46:51,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:51,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:52,142 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:52,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:52,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816629320] [2023-08-27 11:46:52,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816629320] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:52,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832374696] [2023-08-27 11:46:52,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:52,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:52,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:52,144 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:52,164 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:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:52,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-27 11:46:52,257 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:52,304 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:46:52,305 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:52,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 15 treesize of output 11 [2023-08-27 11:46:52,371 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-27 11:46:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:46:52,386 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 11:46:52,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832374696] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:52,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 11:46:52,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2023-08-27 11:46:52,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924302698] [2023-08-27 11:46:52,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:52,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 11:46:52,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:52,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 11:46:52,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-08-27 11:46:52,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 436 [2023-08-27 11:46:52,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 32 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 162.33333333333334) internal successors, (974), 6 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:46:52,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:52,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 436 [2023-08-27 11:46:52,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:52,453 INFO L124 PetriNetUnfolderBase]: 10/48 cut-off events. [2023-08-27 11:46:52,453 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-08-27 11:46:52,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 48 events. 10/48 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 4 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 164. Up to 18 conditions per place. [2023-08-27 11:46:52,454 INFO L140 encePairwiseOnDemand]: 431/436 looper letters, 0 selfloop transitions, 0 changer transitions 32/32 dead transitions. [2023-08-27 11:46:52,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 32 transitions, 228 flow [2023-08-27 11:46:52,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 11:46:52,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 11:46:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 814 transitions. [2023-08-27 11:46:52,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37339449541284403 [2023-08-27 11:46:52,457 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 814 transitions. [2023-08-27 11:46:52,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 814 transitions. [2023-08-27 11:46:52,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:52,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 814 transitions. [2023-08-27 11:46:52,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.8) internal successors, (814), 5 states have internal predecessors, (814), 0 states have call successors, (0), 0 states 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:52,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 436.0) internal successors, (2616), 6 states have internal predecessors, (2616), 0 states have call successors, (0), 0 states 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:52,462 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 436.0) internal successors, (2616), 6 states have internal predecessors, (2616), 0 states have call successors, (0), 0 states 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:52,462 INFO L175 Difference]: Start difference. First operand has 55 places, 32 transitions, 169 flow. Second operand 5 states and 814 transitions. [2023-08-27 11:46:52,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 32 transitions, 228 flow [2023-08-27 11:46:52,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 32 transitions, 207 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-27 11:46:52,463 INFO L231 Difference]: Finished difference. Result has 51 places, 0 transitions, 0 flow [2023-08-27 11:46:52,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=51, PETRI_TRANSITIONS=0} [2023-08-27 11:46:52,464 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2023-08-27 11:46:52,466 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 0 transitions, 0 flow [2023-08-27 11:46:52,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 162.33333333333334) internal successors, (974), 6 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:46:52,468 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 21 remaining) [2023-08-27 11:46:52,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2023-08-27 11:46:52,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2023-08-27 11:46:52,469 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2023-08-27 11:46:52,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2023-08-27 11:46:52,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2023-08-27 11:46:52,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2023-08-27 11:46:52,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (13 of 21 remaining) [2023-08-27 11:46:52,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2023-08-27 11:46:52,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2023-08-27 11:46:52,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2023-08-27 11:46:52,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2023-08-27 11:46:52,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 21 remaining) [2023-08-27 11:46:52,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2023-08-27 11:46:52,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2023-08-27 11:46:52,471 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2023-08-27 11:46:52,471 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONASSERT (4 of 21 remaining) [2023-08-27 11:46:52,471 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONASSERT (3 of 21 remaining) [2023-08-27 11:46:52,471 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2023-08-27 11:46:52,471 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2023-08-27 11:46:52,471 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2023-08-27 11:46:52,479 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:52,677 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:52,677 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:52,679 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:52,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 229 transitions, 466 flow [2023-08-27 11:46:52,702 INFO L124 PetriNetUnfolderBase]: 48/313 cut-off events. [2023-08-27 11:46:52,702 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2023-08-27 11:46:52,704 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:52,704 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 229 transitions, 466 flow [2023-08-27 11:46:52,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 218 transitions, 441 flow [2023-08-27 11:46:52,705 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 11:46:52,705 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 218 transitions, 441 flow [2023-08-27 11:46:52,706 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 189 places, 218 transitions, 441 flow [2023-08-27 11:46:52,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 218 transitions, 441 flow [2023-08-27 11:46:52,725 INFO L124 PetriNetUnfolderBase]: 47/302 cut-off events. [2023-08-27 11:46:52,725 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 11:46:52,726 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:52,732 INFO L119 LiptonReduction]: Number of co-enabled transitions 15040 [2023-08-27 11:46:55,520 INFO L134 LiptonReduction]: Checked pairs total: 25118 [2023-08-27 11:46:55,520 INFO L136 LiptonReduction]: Total number of compositions: 197 [2023-08-27 11:46:55,521 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-27 11:46:55,522 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;@4a0f4920, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 11:46:55,522 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-27 11:46:55,523 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 11:46:55,523 INFO L124 PetriNetUnfolderBase]: 12/42 cut-off events. [2023-08-27 11:46:55,524 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 11:46:55,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:55,524 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-27 11:46:55,524 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 11:46:55,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:55,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2112497798, now seen corresponding path program 1 times [2023-08-27 11:46:55,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:55,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219379647] [2023-08-27 11:46:55,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:55,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:55,544 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:55,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:55,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219379647] [2023-08-27 11:46:55,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219379647] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:46:55,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:46:55,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:46:55,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524485940] [2023-08-27 11:46:55,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:46:55,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:46:55,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:55,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:46:55,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:46:55,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 426 [2023-08-27 11:46:55,547 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:55,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:55,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 426 [2023-08-27 11:46:55,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:55,658 INFO L124 PetriNetUnfolderBase]: 518/1090 cut-off events. [2023-08-27 11:46:55,659 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 11:46:55,659 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:55,661 INFO L140 encePairwiseOnDemand]: 400/426 looper letters, 27 selfloop transitions, 2 changer transitions 22/55 dead transitions. [2023-08-27 11:46:55,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 213 flow [2023-08-27 11:46:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:46:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:46:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2023-08-27 11:46:55,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984350547730829 [2023-08-27 11:46:55,663 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 637 transitions. [2023-08-27 11:46:55,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 637 transitions. [2023-08-27 11:46:55,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:55,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 637 transitions. [2023-08-27 11:46:55,665 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:55,667 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:55,667 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:55,667 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:55,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 213 flow [2023-08-27 11:46:55,667 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:55,668 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 81 flow [2023-08-27 11:46:55,668 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:55,669 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2023-08-27 11:46:55,669 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 81 flow [2023-08-27 11:46:55,669 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:55,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:55,670 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-27 11:46:55,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 11:46:55,670 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 11:46:55,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:55,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1170759422, now seen corresponding path program 1 times [2023-08-27 11:46:55,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:55,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002201609] [2023-08-27 11:46:55,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:55,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:55,696 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:55,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:55,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002201609] [2023-08-27 11:46:55,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002201609] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:55,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272889797] [2023-08-27 11:46:55,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:55,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:55,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:55,701 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:55,728 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:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:55,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 11:46:55,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:55,795 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:55,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:46:55,806 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:55,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272889797] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:46:55,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:46:55,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-27 11:46:55,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968260770] [2023-08-27 11:46:55,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:46:55,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 11:46:55,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:55,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 11:46:55,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 11:46:55,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 426 [2023-08-27 11:46:55,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 33 transitions, 81 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:46:55,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:55,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 426 [2023-08-27 11:46:55,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:55,870 INFO L124 PetriNetUnfolderBase]: 102/243 cut-off events. [2023-08-27 11:46:55,871 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 11:46:55,871 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:55,872 INFO L140 encePairwiseOnDemand]: 423/426 looper letters, 27 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2023-08-27 11:46:55,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 157 flow [2023-08-27 11:46:55,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 11:46:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 11:46:55,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1163 transitions. [2023-08-27 11:46:55,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4550078247261346 [2023-08-27 11:46:55,875 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1163 transitions. [2023-08-27 11:46:55,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1163 transitions. [2023-08-27 11:46:55,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:55,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1163 transitions. [2023-08-27 11:46:55,878 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:55,881 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:55,881 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:55,882 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:55,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 157 flow [2023-08-27 11:46:55,882 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:55,883 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 113 flow [2023-08-27 11:46:55,883 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:55,884 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, -12 predicate places. [2023-08-27 11:46:55,884 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 113 flow [2023-08-27 11:46:55,885 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:46:55,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:55,885 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-27 11:46:55,893 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:56,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:56,090 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 11:46:56,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:56,091 INFO L85 PathProgramCache]: Analyzing trace with hash -507353210, now seen corresponding path program 2 times [2023-08-27 11:46:56,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:56,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822920318] [2023-08-27 11:46:56,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:46:56,147 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:56,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:46:56,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822920318] [2023-08-27 11:46:56,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822920318] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:46:56,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068126588] [2023-08-27 11:46:56,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 11:46:56,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:46:56,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:46:56,151 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:56,153 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:56,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 11:46:56,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:46:56,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-27 11:46:56,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:46:56,249 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:56,249 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:46:56,299 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:56,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068126588] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:46:56,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:46:56,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-27 11:46:56,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713665543] [2023-08-27 11:46:56,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:46:56,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-27 11:46:56,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:46:56,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-27 11:46:56,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-27 11:46:56,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 426 [2023-08-27 11:46:56,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 113 flow. Second operand has 13 states, 13 states have (on average 189.30769230769232) internal successors, (2461), 13 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states 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:56,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:46:56,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 426 [2023-08-27 11:46:56,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:46:56,388 INFO L124 PetriNetUnfolderBase]: 102/249 cut-off events. [2023-08-27 11:46:56,389 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-27 11:46:56,389 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:56,389 INFO L140 encePairwiseOnDemand]: 423/426 looper letters, 27 selfloop transitions, 11 changer transitions 0/42 dead transitions. [2023-08-27 11:46:56,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 42 transitions, 225 flow [2023-08-27 11:46:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 11:46:56,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 11:46:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2300 transitions. [2023-08-27 11:46:56,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44992175273865415 [2023-08-27 11:46:56,395 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2300 transitions. [2023-08-27 11:46:56,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2300 transitions. [2023-08-27 11:46:56,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:46:56,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2300 transitions. [2023-08-27 11:46:56,401 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:56,406 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:56,407 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:56,407 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:56,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 42 transitions, 225 flow [2023-08-27 11:46:56,408 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:56,409 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 183 flow [2023-08-27 11:46:56,409 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:56,410 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 4 predicate places. [2023-08-27 11:46:56,410 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 183 flow [2023-08-27 11:46:56,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 189.30769230769232) internal successors, (2461), 13 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states 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:56,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:46:56,410 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-27 11:46:56,418 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:56,618 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:56,618 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 11:46:56,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:46:56,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1597327866, now seen corresponding path program 3 times [2023-08-27 11:46:56,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:46:56,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760719566] [2023-08-27 11:46:56,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:46:56,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:46:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 11:46:56,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 11:46:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 11:46:56,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 11:46:56,685 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 11:46:56,685 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-27 11:46:56,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 11:46:56,685 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-27 11:46:56,686 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-27 11:46:56,686 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-27 11:46:56,686 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-27 11:46:56,709 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-27 11:46:56,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 268 places, 311 transitions, 640 flow [2023-08-27 11:46:56,756 INFO L124 PetriNetUnfolderBase]: 80/516 cut-off events. [2023-08-27 11:46:56,756 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-27 11:46:56,761 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:56,761 INFO L82 GeneralOperation]: Start removeDead. Operand has 268 places, 311 transitions, 640 flow [2023-08-27 11:46:56,766 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 268 places, 311 transitions, 640 flow [2023-08-27 11:46:56,766 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 11:46:56,766 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 268 places, 311 transitions, 640 flow [2023-08-27 11:46:56,767 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 268 places, 311 transitions, 640 flow [2023-08-27 11:46:56,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 268 places, 311 transitions, 640 flow [2023-08-27 11:46:56,809 INFO L124 PetriNetUnfolderBase]: 80/516 cut-off events. [2023-08-27 11:46:56,810 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-08-27 11:46:56,815 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:56,834 INFO L119 LiptonReduction]: Number of co-enabled transitions 45920 [2023-08-27 11:47:00,493 INFO L134 LiptonReduction]: Checked pairs total: 80999 [2023-08-27 11:47:00,493 INFO L136 LiptonReduction]: Total number of compositions: 286 [2023-08-27 11:47:00,494 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 11:47:00,495 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;@4a0f4920, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 11:47:00,495 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-27 11:47:00,495 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 11:47:00,496 INFO L124 PetriNetUnfolderBase]: 1/2 cut-off events. [2023-08-27 11:47:00,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 11:47:00,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:00,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-27 11:47:00,496 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:47:00,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash 56947, now seen corresponding path program 1 times [2023-08-27 11:47:00,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:00,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35226951] [2023-08-27 11:47:00,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:00,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:00,523 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:47:00,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:00,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35226951] [2023-08-27 11:47:00,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35226951] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:47:00,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:47:00,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 11:47:00,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216665651] [2023-08-27 11:47:00,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:47:00,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:47:00,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:00,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:47:00,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:47:00,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:47:00,526 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:47:00,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:00,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:47:00,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:02,739 INFO L124 PetriNetUnfolderBase]: 21032/33098 cut-off events. [2023-08-27 11:47:02,739 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-08-27 11:47:02,777 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:47:02,908 INFO L140 encePairwiseOnDemand]: 560/597 looper letters, 73 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2023-08-27 11:47:02,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 87 transitions, 342 flow [2023-08-27 11:47:02,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:47:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:47:02,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 873 transitions. [2023-08-27 11:47:02,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48743718592964824 [2023-08-27 11:47:02,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 873 transitions. [2023-08-27 11:47:02,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 873 transitions. [2023-08-27 11:47:02,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:02,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 873 transitions. [2023-08-27 11:47:02,914 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:47:02,917 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:02,917 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:02,917 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:47:02,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 87 transitions, 342 flow [2023-08-27 11:47:02,918 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:47:02,919 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 204 flow [2023-08-27 11:47:02,920 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:47:02,920 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 2 predicate places. [2023-08-27 11:47:02,921 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 204 flow [2023-08-27 11:47:02,921 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:47:02,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:02,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 11:47:02,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 11:47:02,921 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:47:02,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1768767, now seen corresponding path program 1 times [2023-08-27 11:47:02,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:02,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216553173] [2023-08-27 11:47:02,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:02,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:02,938 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:47:02,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:02,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216553173] [2023-08-27 11:47:02,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216553173] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:47:02,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:47:02,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:47:02,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550111429] [2023-08-27 11:47:02,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:47:02,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:47:02,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:02,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:47:02,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:47:02,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:47:02,943 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:47:02,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:02,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:47:02,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:04,709 INFO L124 PetriNetUnfolderBase]: 21032/33097 cut-off events. [2023-08-27 11:47:04,709 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-08-27 11:47:04,819 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:47:04,942 INFO L140 encePairwiseOnDemand]: 594/597 looper letters, 72 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2023-08-27 11:47:04,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 86 transitions, 348 flow [2023-08-27 11:47:04,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:47:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:47:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 836 transitions. [2023-08-27 11:47:04,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4667783361250698 [2023-08-27 11:47:04,945 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 836 transitions. [2023-08-27 11:47:04,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 836 transitions. [2023-08-27 11:47:04,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:04,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 836 transitions. [2023-08-27 11:47:04,947 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:47:04,950 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:04,950 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:04,950 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:47:04,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 86 transitions, 348 flow [2023-08-27 11:47:04,951 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:47:04,952 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 200 flow [2023-08-27 11:47:04,952 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:47:04,953 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 2 predicate places. [2023-08-27 11:47:04,953 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 200 flow [2023-08-27 11:47:04,953 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:47:04,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:04,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:04,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 11:47:04,954 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:47:04,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:04,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1527012207, now seen corresponding path program 1 times [2023-08-27 11:47:04,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:04,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473575855] [2023-08-27 11:47:04,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:04,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:04,985 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:47:04,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:04,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473575855] [2023-08-27 11:47:04,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473575855] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:47:04,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706864404] [2023-08-27 11:47:04,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:04,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:04,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:47:04,987 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:47:05,011 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:47:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:05,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 11:47:05,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:47:05,091 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:47:05,091 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:47:05,102 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:47:05,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706864404] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:47:05,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:47:05,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-27 11:47:05,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082288275] [2023-08-27 11:47:05,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:47:05,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 11:47:05,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:05,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 11:47:05,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 11:47:05,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:47:05,106 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:47:05,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:05,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:47:05,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:06,927 INFO L124 PetriNetUnfolderBase]: 21032/33100 cut-off events. [2023-08-27 11:47:06,927 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-08-27 11:47:06,974 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:47:07,075 INFO L140 encePairwiseOnDemand]: 594/597 looper letters, 72 selfloop transitions, 5 changer transitions 0/89 dead transitions. [2023-08-27 11:47:07,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 89 transitions, 366 flow [2023-08-27 11:47:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 11:47:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 11:47:07,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1604 transitions. [2023-08-27 11:47:07,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44779452819653826 [2023-08-27 11:47:07,079 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1604 transitions. [2023-08-27 11:47:07,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1604 transitions. [2023-08-27 11:47:07,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:07,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1604 transitions. [2023-08-27 11:47:07,083 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:47:07,087 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:47:07,088 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:47:07,088 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:47:07,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 89 transitions, 366 flow [2023-08-27 11:47:07,089 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:47:07,090 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 232 flow [2023-08-27 11:47:07,090 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:47:07,090 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 8 predicate places. [2023-08-27 11:47:07,090 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 232 flow [2023-08-27 11:47:07,091 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:47:07,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:07,091 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:07,100 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:47:07,300 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,SelfDestructingSolverStorable17 [2023-08-27 11:47:07,301 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:47:07,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:07,301 INFO L85 PathProgramCache]: Analyzing trace with hash -922462813, now seen corresponding path program 2 times [2023-08-27 11:47:07,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:07,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638089274] [2023-08-27 11:47:07,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:07,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:07,338 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:47:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:07,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638089274] [2023-08-27 11:47:07,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638089274] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:47:07,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:47:07,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:47:07,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091840553] [2023-08-27 11:47:07,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:47:07,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:47:07,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:07,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:47:07,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:47:07,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:47:07,340 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:47:07,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:07,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:47:07,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:09,266 INFO L124 PetriNetUnfolderBase]: 20651/32561 cut-off events. [2023-08-27 11:47:09,273 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-08-27 11:47:09,307 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:47:09,372 INFO L140 encePairwiseOnDemand]: 592/597 looper letters, 96 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2023-08-27 11:47:09,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 110 transitions, 470 flow [2023-08-27 11:47:09,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:47:09,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:47:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2023-08-27 11:47:09,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796203238414294 [2023-08-27 11:47:09,374 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 859 transitions. [2023-08-27 11:47:09,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 859 transitions. [2023-08-27 11:47:09,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:09,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 859 transitions. [2023-08-27 11:47:09,377 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:47:09,379 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:09,379 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:09,379 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:47:09,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 110 transitions, 470 flow [2023-08-27 11:47:09,380 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:47:09,381 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 234 flow [2023-08-27 11:47:09,382 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:47:09,382 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 10 predicate places. [2023-08-27 11:47:09,382 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 234 flow [2023-08-27 11:47:09,382 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:47:09,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:09,382 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:09,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 11:47:09,383 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:47:09,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:09,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1706142676, now seen corresponding path program 1 times [2023-08-27 11:47:09,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:09,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328689158] [2023-08-27 11:47:09,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:09,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:09,447 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:47:09,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:09,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328689158] [2023-08-27 11:47:09,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328689158] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:47:09,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389502446] [2023-08-27 11:47:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:09,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:09,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:47:09,450 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:47:09,461 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:47:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:09,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-27 11:47:09,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:47:09,560 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:47:09,561 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:47:09,598 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:47:09,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389502446] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:47:09,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:47:09,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-27 11:47:09,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542717320] [2023-08-27 11:47:09,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:47:09,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-27 11:47:09,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-27 11:47:09,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-27 11:47:09,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:47:09,603 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:47:09,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:09,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:47:09,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:11,567 INFO L124 PetriNetUnfolderBase]: 21098/32768 cut-off events. [2023-08-27 11:47:11,567 INFO L125 PetriNetUnfolderBase]: For 994/994 co-relation queries the response was YES. [2023-08-27 11:47:11,621 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:47:11,713 INFO L140 encePairwiseOnDemand]: 594/597 looper letters, 73 selfloop transitions, 11 changer transitions 0/96 dead transitions. [2023-08-27 11:47:11,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 96 transitions, 438 flow [2023-08-27 11:47:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 11:47:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 11:47:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3137 transitions. [2023-08-27 11:47:11,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43788386376326077 [2023-08-27 11:47:11,720 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3137 transitions. [2023-08-27 11:47:11,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3137 transitions. [2023-08-27 11:47:11,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:11,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3137 transitions. [2023-08-27 11:47:11,728 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:47:11,735 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:47:11,736 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:47:11,736 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:47:11,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 96 transitions, 438 flow [2023-08-27 11:47:11,740 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:47:11,741 INFO L231 Difference]: Finished difference. Result has 112 places, 96 transitions, 316 flow [2023-08-27 11:47:11,741 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:47:11,742 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 26 predicate places. [2023-08-27 11:47:11,742 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 96 transitions, 316 flow [2023-08-27 11:47:11,743 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:47:11,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:11,743 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:11,752 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:47:11,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:11,949 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:47:11,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash -113041236, now seen corresponding path program 2 times [2023-08-27 11:47:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013212119] [2023-08-27 11:47:11,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:11,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:12,418 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:12,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:12,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013212119] [2023-08-27 11:47:12,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013212119] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:47:12,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:47:12,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 11:47:12,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568080567] [2023-08-27 11:47:12,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:47:12,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 11:47:12,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:12,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 11:47:12,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-08-27 11:47:12,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 597 [2023-08-27 11:47:12,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 96 transitions, 316 flow. Second operand has 7 states, 7 states have (on average 196.28571428571428) internal successors, (1374), 7 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states 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,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:12,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 597 [2023-08-27 11:47:12,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:15,205 INFO L124 PetriNetUnfolderBase]: 26982/41748 cut-off events. [2023-08-27 11:47:15,206 INFO L125 PetriNetUnfolderBase]: For 1254/1254 co-relation queries the response was YES. [2023-08-27 11:47:15,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84373 conditions, 41748 events. 26982/41748 cut-off events. For 1254/1254 co-relation queries the response was YES. Maximal size of possible extension queue 1266. Compared 305069 event pairs, 17428 based on Foata normal form. 0/29386 useless extension candidates. Maximal degree in co-relation 84295. Up to 35068 conditions per place. [2023-08-27 11:47:15,418 INFO L140 encePairwiseOnDemand]: 580/597 looper letters, 169 selfloop transitions, 15 changer transitions 6/199 dead transitions. [2023-08-27 11:47:15,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 199 transitions, 928 flow [2023-08-27 11:47:15,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 11:47:15,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 11:47:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1361 transitions. [2023-08-27 11:47:15,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37995533221663874 [2023-08-27 11:47:15,422 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1361 transitions. [2023-08-27 11:47:15,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1361 transitions. [2023-08-27 11:47:15,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:15,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1361 transitions. [2023-08-27 11:47:15,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states 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:15,429 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:47:15,430 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:47:15,430 INFO L175 Difference]: Start difference. First operand has 112 places, 96 transitions, 316 flow. Second operand 6 states and 1361 transitions. [2023-08-27 11:47:15,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 199 transitions, 928 flow [2023-08-27 11:47:15,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 199 transitions, 880 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-27 11:47:15,435 INFO L231 Difference]: Finished difference. Result has 117 places, 109 transitions, 400 flow [2023-08-27 11:47:15,435 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=400, PETRI_PLACES=117, PETRI_TRANSITIONS=109} [2023-08-27 11:47:15,435 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 31 predicate places. [2023-08-27 11:47:15,435 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 109 transitions, 400 flow [2023-08-27 11:47:15,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 196.28571428571428) internal successors, (1374), 7 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states 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:15,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:15,436 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:15,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-27 11:47:15,436 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:47:15,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:15,436 INFO L85 PathProgramCache]: Analyzing trace with hash -658469694, now seen corresponding path program 1 times [2023-08-27 11:47:15,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:15,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702108466] [2023-08-27 11:47:15,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:15,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:15,475 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:47:15,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:15,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702108466] [2023-08-27 11:47:15,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702108466] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:47:15,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:47:15,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:47:15,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537041351] [2023-08-27 11:47:15,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:47:15,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:47:15,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:15,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:47:15,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:47:15,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:47:15,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 400 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:47:15,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:15,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:47:15,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:17,837 INFO L124 PetriNetUnfolderBase]: 22093/35029 cut-off events. [2023-08-27 11:47:17,838 INFO L125 PetriNetUnfolderBase]: For 11457/11461 co-relation queries the response was YES. [2023-08-27 11:47:17,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81641 conditions, 35029 events. 22093/35029 cut-off events. For 11457/11461 co-relation queries the response was YES. Maximal size of possible extension queue 1594. Compared 288545 event pairs, 3102 based on Foata normal form. 1/26854 useless extension candidates. Maximal degree in co-relation 81581. Up to 29007 conditions per place. [2023-08-27 11:47:18,027 INFO L140 encePairwiseOnDemand]: 594/597 looper letters, 135 selfloop transitions, 2 changer transitions 0/149 dead transitions. [2023-08-27 11:47:18,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 149 transitions, 794 flow [2023-08-27 11:47:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:47:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:47:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2023-08-27 11:47:18,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868788386376326 [2023-08-27 11:47:18,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 872 transitions. [2023-08-27 11:47:18,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 872 transitions. [2023-08-27 11:47:18,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:18,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 872 transitions. [2023-08-27 11:47:18,031 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:47:18,033 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:18,033 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:18,033 INFO L175 Difference]: Start difference. First operand has 117 places, 109 transitions, 400 flow. Second operand 3 states and 872 transitions. [2023-08-27 11:47:18,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 149 transitions, 794 flow [2023-08-27 11:47:18,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 149 transitions, 794 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 11:47:18,106 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 400 flow [2023-08-27 11:47:18,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2023-08-27 11:47:18,106 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 32 predicate places. [2023-08-27 11:47:18,106 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 400 flow [2023-08-27 11:47:18,106 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:47:18,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:18,106 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:18,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-27 11:47:18,107 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:47:18,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:18,107 INFO L85 PathProgramCache]: Analyzing trace with hash -658469634, now seen corresponding path program 1 times [2023-08-27 11:47:18,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:18,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823008051] [2023-08-27 11:47:18,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:18,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:18,139 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:47:18,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:18,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823008051] [2023-08-27 11:47:18,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823008051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:47:18,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:47:18,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:47:18,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323071475] [2023-08-27 11:47:18,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:47:18,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:47:18,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:18,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:47:18,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:47:18,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:47:18,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 400 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:47:18,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:18,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:47:18,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:20,614 INFO L124 PetriNetUnfolderBase]: 21641/34346 cut-off events. [2023-08-27 11:47:20,614 INFO L125 PetriNetUnfolderBase]: For 11398/11400 co-relation queries the response was YES. [2023-08-27 11:47:20,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79491 conditions, 34346 events. 21641/34346 cut-off events. For 11398/11400 co-relation queries the response was YES. Maximal size of possible extension queue 1461. Compared 269262 event pairs, 6737 based on Foata normal form. 2/26863 useless extension candidates. Maximal degree in co-relation 79430. Up to 30278 conditions per place. [2023-08-27 11:47:20,777 INFO L140 encePairwiseOnDemand]: 593/597 looper letters, 129 selfloop transitions, 7 changer transitions 0/148 dead transitions. [2023-08-27 11:47:20,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 148 transitions, 792 flow [2023-08-27 11:47:20,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:47:20,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:47:20,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2023-08-27 11:47:20,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4868788386376326 [2023-08-27 11:47:20,779 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 872 transitions. [2023-08-27 11:47:20,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 872 transitions. [2023-08-27 11:47:20,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:20,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 872 transitions. [2023-08-27 11:47:20,780 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:47:20,782 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:20,782 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:20,782 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 400 flow. Second operand 3 states and 872 transitions. [2023-08-27 11:47:20,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 148 transitions, 792 flow [2023-08-27 11:47:20,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 148 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 11:47:20,853 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 421 flow [2023-08-27 11:47:20,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=421, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2023-08-27 11:47:20,854 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 32 predicate places. [2023-08-27 11:47:20,854 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 421 flow [2023-08-27 11:47:20,854 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:47:20,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:20,854 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:20,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-27 11:47:20,854 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:47:20,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:20,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1071086101, now seen corresponding path program 1 times [2023-08-27 11:47:20,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:20,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088706526] [2023-08-27 11:47:20,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:20,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-08-27 11:47:21,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:21,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088706526] [2023-08-27 11:47:21,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088706526] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:47:21,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:47:21,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 11:47:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511362049] [2023-08-27 11:47:21,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:47:21,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 11:47:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:21,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 11:47:21,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-08-27 11:47:21,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 597 [2023-08-27 11:47:21,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 421 flow. Second operand has 7 states, 7 states have (on average 202.57142857142858) internal successors, (1418), 7 states have internal predecessors, (1418), 0 states have call successors, (0), 0 states 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:21,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:21,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 597 [2023-08-27 11:47:21,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:23,827 INFO L124 PetriNetUnfolderBase]: 23526/37180 cut-off events. [2023-08-27 11:47:23,827 INFO L125 PetriNetUnfolderBase]: For 17124/17124 co-relation queries the response was YES. [2023-08-27 11:47:23,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85830 conditions, 37180 events. 23526/37180 cut-off events. For 17124/17124 co-relation queries the response was YES. Maximal size of possible extension queue 1220. Compared 274865 event pairs, 10930 based on Foata normal form. 554/30568 useless extension candidates. Maximal degree in co-relation 85769. Up to 30310 conditions per place. [2023-08-27 11:47:24,026 INFO L140 encePairwiseOnDemand]: 582/597 looper letters, 147 selfloop transitions, 16 changer transitions 1/173 dead transitions. [2023-08-27 11:47:24,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 173 transitions, 945 flow [2023-08-27 11:47:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 11:47:24,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 11:47:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 953 transitions. [2023-08-27 11:47:24,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3990787269681742 [2023-08-27 11:47:24,029 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 953 transitions. [2023-08-27 11:47:24,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 953 transitions. [2023-08-27 11:47:24,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:24,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 953 transitions. [2023-08-27 11:47:24,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 238.25) internal successors, (953), 4 states have internal predecessors, (953), 0 states have call successors, (0), 0 states 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:24,034 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:24,034 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:24,034 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 421 flow. Second operand 4 states and 953 transitions. [2023-08-27 11:47:24,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 173 transitions, 945 flow [2023-08-27 11:47:24,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 173 transitions, 935 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 11:47:24,068 INFO L231 Difference]: Finished difference. Result has 122 places, 117 transitions, 549 flow [2023-08-27 11:47:24,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=549, PETRI_PLACES=122, PETRI_TRANSITIONS=117} [2023-08-27 11:47:24,069 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 36 predicate places. [2023-08-27 11:47:24,069 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 117 transitions, 549 flow [2023-08-27 11:47:24,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 202.57142857142858) internal successors, (1418), 7 states have internal predecessors, (1418), 0 states have call successors, (0), 0 states 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:24,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:24,070 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:24,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-27 11:47:24,070 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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:24,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:24,070 INFO L85 PathProgramCache]: Analyzing trace with hash 666478715, now seen corresponding path program 1 times [2023-08-27 11:47:24,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:24,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271988186] [2023-08-27 11:47:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:24,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:24,358 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:24,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:24,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271988186] [2023-08-27 11:47:24,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271988186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:47:24,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:47:24,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 11:47:24,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779004705] [2023-08-27 11:47:24,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:47:24,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 11:47:24,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:24,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 11:47:24,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-27 11:47:24,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 597 [2023-08-27 11:47:24,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 117 transitions, 549 flow. Second operand has 9 states, 9 states have (on average 196.44444444444446) internal successors, (1768), 9 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states 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:24,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:24,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 597 [2023-08-27 11:47:24,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:27,920 INFO L124 PetriNetUnfolderBase]: 25781/40705 cut-off events. [2023-08-27 11:47:27,920 INFO L125 PetriNetUnfolderBase]: For 27577/27577 co-relation queries the response was YES. [2023-08-27 11:47:28,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102798 conditions, 40705 events. 25781/40705 cut-off events. For 27577/27577 co-relation queries the response was YES. Maximal size of possible extension queue 1359. Compared 306769 event pairs, 9433 based on Foata normal form. 0/33802 useless extension candidates. Maximal degree in co-relation 102733. Up to 30550 conditions per place. [2023-08-27 11:47:28,181 INFO L140 encePairwiseOnDemand]: 587/597 looper letters, 219 selfloop transitions, 28 changer transitions 1/257 dead transitions. [2023-08-27 11:47:28,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 257 transitions, 1496 flow [2023-08-27 11:47:28,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 11:47:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 11:47:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1579 transitions. [2023-08-27 11:47:28,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37784158889686525 [2023-08-27 11:47:28,184 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1579 transitions. [2023-08-27 11:47:28,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1579 transitions. [2023-08-27 11:47:28,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:28,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1579 transitions. [2023-08-27 11:47:28,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 225.57142857142858) internal successors, (1579), 7 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states 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:28,190 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:47:28,190 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:47:28,190 INFO L175 Difference]: Start difference. First operand has 122 places, 117 transitions, 549 flow. Second operand 7 states and 1579 transitions. [2023-08-27 11:47:28,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 257 transitions, 1496 flow [2023-08-27 11:47:28,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 257 transitions, 1487 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-27 11:47:28,383 INFO L231 Difference]: Finished difference. Result has 128 places, 129 transitions, 691 flow [2023-08-27 11:47:28,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=691, PETRI_PLACES=128, PETRI_TRANSITIONS=129} [2023-08-27 11:47:28,384 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 42 predicate places. [2023-08-27 11:47:28,384 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 129 transitions, 691 flow [2023-08-27 11:47:28,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 196.44444444444446) internal successors, (1768), 9 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states 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:28,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:28,385 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 11:47:28,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-27 11:47:28,385 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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:28,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:28,385 INFO L85 PathProgramCache]: Analyzing trace with hash 666478716, now seen corresponding path program 1 times [2023-08-27 11:47:28,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:28,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12951168] [2023-08-27 11:47:28,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:28,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:28,472 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:28,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:28,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12951168] [2023-08-27 11:47:28,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12951168] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:47:28,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:47:28,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 11:47:28,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581376466] [2023-08-27 11:47:28,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:47:28,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 11:47:28,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:28,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 11:47:28,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 11:47:28,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 597 [2023-08-27 11:47:28,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 129 transitions, 691 flow. Second operand has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:28,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:28,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 597 [2023-08-27 11:47:28,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:32,404 INFO L124 PetriNetUnfolderBase]: 29275/47069 cut-off events. [2023-08-27 11:47:32,404 INFO L125 PetriNetUnfolderBase]: For 35446/35574 co-relation queries the response was YES. [2023-08-27 11:47:32,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121308 conditions, 47069 events. 29275/47069 cut-off events. For 35446/35574 co-relation queries the response was YES. Maximal size of possible extension queue 2134. Compared 389098 event pairs, 12360 based on Foata normal form. 1/39868 useless extension candidates. Maximal degree in co-relation 121241. Up to 21474 conditions per place. [2023-08-27 11:47:32,692 INFO L140 encePairwiseOnDemand]: 586/597 looper letters, 256 selfloop transitions, 25 changer transitions 4/297 dead transitions. [2023-08-27 11:47:32,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 297 transitions, 1934 flow [2023-08-27 11:47:32,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 11:47:32,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 11:47:32,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1338 transitions. [2023-08-27 11:47:32,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482412060301508 [2023-08-27 11:47:32,694 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1338 transitions. [2023-08-27 11:47:32,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1338 transitions. [2023-08-27 11:47:32,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:32,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1338 transitions. [2023-08-27 11:47:32,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 267.6) internal successors, (1338), 5 states have internal predecessors, (1338), 0 states have call successors, (0), 0 states 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:32,697 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:32,697 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:32,697 INFO L175 Difference]: Start difference. First operand has 128 places, 129 transitions, 691 flow. Second operand 5 states and 1338 transitions. [2023-08-27 11:47:32,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 297 transitions, 1934 flow [2023-08-27 11:47:32,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 297 transitions, 1875 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-27 11:47:32,854 INFO L231 Difference]: Finished difference. Result has 134 places, 139 transitions, 835 flow [2023-08-27 11:47:32,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=835, PETRI_PLACES=134, PETRI_TRANSITIONS=139} [2023-08-27 11:47:32,855 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 48 predicate places. [2023-08-27 11:47:32,855 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 139 transitions, 835 flow [2023-08-27 11:47:32,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:47:32,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:32,855 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:32,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-27 11:47:32,856 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:47:32,856 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:32,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1192715917, now seen corresponding path program 1 times [2023-08-27 11:47:32,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:32,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088884441] [2023-08-27 11:47:32,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:32,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:32,907 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:32,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:32,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088884441] [2023-08-27 11:47:32,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088884441] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:47:32,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575519662] [2023-08-27 11:47:32,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:32,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:32,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:47:32,909 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:47:32,916 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:47:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:33,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-27 11:47:33,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:47:33,062 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:33,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:47:33,078 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:33,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575519662] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:47:33,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:47:33,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-27 11:47:33,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964572691] [2023-08-27 11:47:33,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:47:33,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 11:47:33,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:33,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 11:47:33,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-27 11:47:33,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 597 [2023-08-27 11:47:33,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 139 transitions, 835 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:33,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:33,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 597 [2023-08-27 11:47:33,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:33,635 INFO L124 PetriNetUnfolderBase]: 2639/4863 cut-off events. [2023-08-27 11:47:33,635 INFO L125 PetriNetUnfolderBase]: For 11695/11697 co-relation queries the response was YES. [2023-08-27 11:47:33,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17558 conditions, 4863 events. 2639/4863 cut-off events. For 11695/11697 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 34524 event pairs, 352 based on Foata normal form. 578/5040 useless extension candidates. Maximal degree in co-relation 17486. Up to 3225 conditions per place. [2023-08-27 11:47:33,655 INFO L140 encePairwiseOnDemand]: 594/597 looper letters, 145 selfloop transitions, 4 changer transitions 2/160 dead transitions. [2023-08-27 11:47:33,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 160 transitions, 1269 flow [2023-08-27 11:47:33,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 11:47:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 11:47:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1370 transitions. [2023-08-27 11:47:33,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45896147403685095 [2023-08-27 11:47:33,658 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1370 transitions. [2023-08-27 11:47:33,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1370 transitions. [2023-08-27 11:47:33,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:33,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1370 transitions. [2023-08-27 11:47:33,660 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:33,661 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:33,661 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:33,661 INFO L175 Difference]: Start difference. First operand has 134 places, 139 transitions, 835 flow. Second operand 5 states and 1370 transitions. [2023-08-27 11:47:33,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 160 transitions, 1269 flow [2023-08-27 11:47:33,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 160 transitions, 1223 flow, removed 21 selfloop flow, removed 2 redundant places. [2023-08-27 11:47:33,682 INFO L231 Difference]: Finished difference. Result has 107 places, 91 transitions, 568 flow [2023-08-27 11:47:33,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=568, PETRI_PLACES=107, PETRI_TRANSITIONS=91} [2023-08-27 11:47:33,683 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 21 predicate places. [2023-08-27 11:47:33,683 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 91 transitions, 568 flow [2023-08-27 11:47:33,683 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:33,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:33,683 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:33,695 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:47:33,888 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,SelfDestructingSolverStorable26 [2023-08-27 11:47:33,888 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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:33,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:33,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1778984219, now seen corresponding path program 1 times [2023-08-27 11:47:33,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:33,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300262294] [2023-08-27 11:47:33,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:33,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:34,094 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:34,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:34,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300262294] [2023-08-27 11:47:34,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300262294] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:47:34,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130277925] [2023-08-27 11:47:34,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:34,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:34,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:47:34,096 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:47:34,105 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:47:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:34,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-27 11:47:34,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:47:34,278 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:47:34,278 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:34,333 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-27 11:47:34,358 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-27 11:47:34,385 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:47:34,386 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 11:47:34,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130277925] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:47:34,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 11:47:34,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2023-08-27 11:47:34,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136115841] [2023-08-27 11:47:34,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:47:34,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 11:47:34,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:34,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 11:47:34,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-08-27 11:47:34,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 597 [2023-08-27 11:47:34,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 91 transitions, 568 flow. Second operand has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states 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,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:34,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 597 [2023-08-27 11:47:34,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:34,988 INFO L124 PetriNetUnfolderBase]: 2605/4859 cut-off events. [2023-08-27 11:47:34,988 INFO L125 PetriNetUnfolderBase]: For 16480/16483 co-relation queries the response was YES. [2023-08-27 11:47:35,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17213 conditions, 4859 events. 2605/4859 cut-off events. For 16480/16483 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 34892 event pairs, 1125 based on Foata normal form. 54/4517 useless extension candidates. Maximal degree in co-relation 17142. Up to 2748 conditions per place. [2023-08-27 11:47:35,025 INFO L140 encePairwiseOnDemand]: 585/597 looper letters, 116 selfloop transitions, 17 changer transitions 5/147 dead transitions. [2023-08-27 11:47:35,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 147 transitions, 1103 flow [2023-08-27 11:47:35,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 11:47:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 11:47:35,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1595 transitions. [2023-08-27 11:47:35,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38167025604211535 [2023-08-27 11:47:35,027 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1595 transitions. [2023-08-27 11:47:35,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1595 transitions. [2023-08-27 11:47:35,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:47:35,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1595 transitions. [2023-08-27 11:47:35,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 227.85714285714286) internal successors, (1595), 7 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states 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,030 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:47:35,030 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:47:35,030 INFO L175 Difference]: Start difference. First operand has 107 places, 91 transitions, 568 flow. Second operand 7 states and 1595 transitions. [2023-08-27 11:47:35,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 147 transitions, 1103 flow [2023-08-27 11:47:35,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 147 transitions, 1082 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-27 11:47:35,044 INFO L231 Difference]: Finished difference. Result has 113 places, 96 transitions, 664 flow [2023-08-27 11:47:35,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=664, PETRI_PLACES=113, PETRI_TRANSITIONS=96} [2023-08-27 11:47:35,045 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 27 predicate places. [2023-08-27 11:47:35,045 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 96 transitions, 664 flow [2023-08-27 11:47:35,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states 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,046 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:47:35,046 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,050 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:47:35,246 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,SelfDestructingSolverStorable27 [2023-08-27 11:47:35,246 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:47:35,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1186099874, now seen corresponding path program 1 times [2023-08-27 11:47:35,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:47:35,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175708892] [2023-08-27 11:47:35,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:35,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:47:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:35,593 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,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:47:35,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175708892] [2023-08-27 11:47:35,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175708892] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:47:35,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615952957] [2023-08-27 11:47:35,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:47:35,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:47:35,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:47:35,597 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:47:35,624 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:47:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:47:35,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-27 11:47:35,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:47:35,751 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,816 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:47:35,816 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,837 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,909 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 35 treesize of output 28 [2023-08-27 11:47:35,961 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 20 treesize of output 22 [2023-08-27 11:47:35,987 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,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:47:36,007 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_955 (Array Int Int))) (< 0 (+ 2147483648 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_955) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))))) is different from false [2023-08-27 11:47:38,403 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:38,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615952957] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:47:38,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:47:38,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 18 [2023-08-27 11:47:38,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572508139] [2023-08-27 11:47:38,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:47:38,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-27 11:47:38,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:47:38,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-27 11:47:38,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=4, NotChecked=34, Total=380 [2023-08-27 11:47:38,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 597 [2023-08-27 11:47:38,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 96 transitions, 664 flow. Second operand has 20 states, 20 states have (on average 197.25) internal successors, (3945), 20 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states 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:38,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:47:38,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 597 [2023-08-27 11:47:38,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:47:47,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:47:49,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:47:51,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:47:53,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:47:58,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:48:00,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:48:02,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:48:08,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:48:14,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:48:16,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:48:18,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:48:20,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:48:22,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:48:24,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:48:26,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:48:35,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:48:37,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:48:39,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:48:41,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:48:45,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:48:47,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:49:02,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:49:04,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:49:06,449 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:49:08,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:49:20,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:49:22,736 WARN L539 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:49:24,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:49:26,783 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:49:28,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:49:30,792 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:49:32,798 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:49:34,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:49:36,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:49:42,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:49:51,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:49:57,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:49:59,585 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:01,592 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:03,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:50:05,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,769 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:10,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:50:12,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:14,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,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:50:19,951 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:21,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:50:24,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,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:50:34,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:36,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,560 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:40,622 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:42,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:44,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,721 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:53,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,123 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:57,129 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:59,137 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:01,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:03,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:51:05,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:51:08,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:12,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s 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,551 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,810 INFO L124 PetriNetUnfolderBase]: 4111/7645 cut-off events. [2023-08-27 11:51:20,811 INFO L125 PetriNetUnfolderBase]: For 27029/27029 co-relation queries the response was YES. [2023-08-27 11:51:20,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26825 conditions, 7645 events. 4111/7645 cut-off events. For 27029/27029 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 57726 event pairs, 786 based on Foata normal form. 191/7223 useless extension candidates. Maximal degree in co-relation 26751. Up to 1512 conditions per place. [2023-08-27 11:51:20,856 INFO L140 encePairwiseOnDemand]: 562/597 looper letters, 324 selfloop transitions, 191 changer transitions 64/585 dead transitions. [2023-08-27 11:51:20,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 585 transitions, 4188 flow [2023-08-27 11:51:20,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-08-27 11:51:20,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-08-27 11:51:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 8724 transitions. [2023-08-27 11:51:20,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3479301268245992 [2023-08-27 11:51:20,866 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 8724 transitions. [2023-08-27 11:51:20,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 8724 transitions. [2023-08-27 11:51:20,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:51:20,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 8724 transitions. [2023-08-27 11:51:20,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 207.71428571428572) internal successors, (8724), 42 states have internal predecessors, (8724), 0 states have call successors, (0), 0 states 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:20,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 597.0) internal successors, (25671), 43 states have internal predecessors, (25671), 0 states have call successors, (0), 0 states 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:20,899 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 597.0) internal successors, (25671), 43 states have internal predecessors, (25671), 0 states have call successors, (0), 0 states 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:20,899 INFO L175 Difference]: Start difference. First operand has 113 places, 96 transitions, 664 flow. Second operand 42 states and 8724 transitions. [2023-08-27 11:51:20,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 585 transitions, 4188 flow [2023-08-27 11:51:20,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 585 transitions, 4181 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-27 11:51:20,950 INFO L231 Difference]: Finished difference. Result has 180 places, 269 transitions, 2857 flow [2023-08-27 11:51:20,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=2857, PETRI_PLACES=180, PETRI_TRANSITIONS=269} [2023-08-27 11:51:20,951 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 94 predicate places. [2023-08-27 11:51:20,951 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 269 transitions, 2857 flow [2023-08-27 11:51:20,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 197.25) internal successors, (3945), 20 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states 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:20,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:51:20,952 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:51:20,959 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:51:21,152 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,SelfDestructingSolverStorable28 [2023-08-27 11:51:21,152 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:51:21,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:51:21,153 INFO L85 PathProgramCache]: Analyzing trace with hash -408233589, now seen corresponding path program 1 times [2023-08-27 11:51:21,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:51:21,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276700311] [2023-08-27 11:51:21,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:51:21,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:51:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:51:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:51:21,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:51:21,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276700311] [2023-08-27 11:51:21,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276700311] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:51:21,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:51:21,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 11:51:21,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294018969] [2023-08-27 11:51:21,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:51:21,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 11:51:21,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:51:21,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 11:51:21,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-27 11:51:21,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 597 [2023-08-27 11:51:21,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 269 transitions, 2857 flow. Second operand has 5 states, 5 states have (on average 215.4) internal successors, (1077), 5 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states 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:21,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:51:21,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 597 [2023-08-27 11:51:21,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:51:21,941 INFO L124 PetriNetUnfolderBase]: 1464/3164 cut-off events. [2023-08-27 11:51:21,942 INFO L125 PetriNetUnfolderBase]: For 46876/46876 co-relation queries the response was YES. [2023-08-27 11:51:21,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21062 conditions, 3164 events. 1464/3164 cut-off events. For 46876/46876 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 22830 event pairs, 420 based on Foata normal form. 328/3238 useless extension candidates. Maximal degree in co-relation 20973. Up to 1673 conditions per place. [2023-08-27 11:51:21,978 INFO L140 encePairwiseOnDemand]: 583/597 looper letters, 189 selfloop transitions, 27 changer transitions 11/233 dead transitions. [2023-08-27 11:51:21,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 233 transitions, 3124 flow [2023-08-27 11:51:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 11:51:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 11:51:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 932 transitions. [2023-08-27 11:51:21,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39028475711892796 [2023-08-27 11:51:21,980 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 932 transitions. [2023-08-27 11:51:21,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 932 transitions. [2023-08-27 11:51:21,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:51:21,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 932 transitions. [2023-08-27 11:51:21,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 233.0) internal successors, (932), 4 states have internal predecessors, (932), 0 states have call successors, (0), 0 states 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:21,985 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:51:21,986 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:51:21,986 INFO L175 Difference]: Start difference. First operand has 180 places, 269 transitions, 2857 flow. Second operand 4 states and 932 transitions. [2023-08-27 11:51:21,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 233 transitions, 3124 flow [2023-08-27 11:51:22,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 233 transitions, 2639 flow, removed 198 selfloop flow, removed 20 redundant places. [2023-08-27 11:51:22,103 INFO L231 Difference]: Finished difference. Result has 150 places, 166 transitions, 1599 flow [2023-08-27 11:51:22,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1599, PETRI_PLACES=150, PETRI_TRANSITIONS=166} [2023-08-27 11:51:22,105 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 64 predicate places. [2023-08-27 11:51:22,105 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 166 transitions, 1599 flow [2023-08-27 11:51:22,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 215.4) internal successors, (1077), 5 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states 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:22,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:51:22,105 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:51:22,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-08-27 11:51:22,105 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:51:22,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:51:22,106 INFO L85 PathProgramCache]: Analyzing trace with hash 470231585, now seen corresponding path program 1 times [2023-08-27 11:51:22,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:51:22,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840495581] [2023-08-27 11:51:22,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:51:22,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:51:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:51:22,314 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:51:22,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:51:22,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840495581] [2023-08-27 11:51:22,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840495581] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:51:22,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786492099] [2023-08-27 11:51:22,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:51:22,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:51:22,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:51:22,316 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:51:22,321 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:51:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:51:22,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-27 11:51:22,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:51:22,468 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:22,523 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:51:22,524 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:22,548 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:22,573 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:22,627 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 35 treesize of output 28 [2023-08-27 11:51:22,661 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:51:22,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:51:22,845 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:51:22,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786492099] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:51:22,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:51:22,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2023-08-27 11:51:22,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868180993] [2023-08-27 11:51:22,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:51:22,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-27 11:51:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:51:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-27 11:51:22,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=201, Unknown=1, NotChecked=0, Total=272 [2023-08-27 11:51:22,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 597 [2023-08-27 11:51:22,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 166 transitions, 1599 flow. Second operand has 17 states, 17 states have (on average 220.35294117647058) internal successors, (3746), 17 states have internal predecessors, (3746), 0 states have call successors, (0), 0 states 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:22,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:51:22,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 597 [2023-08-27 11:51:22,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:51:23,624 INFO L124 PetriNetUnfolderBase]: 1296/2947 cut-off events. [2023-08-27 11:51:23,625 INFO L125 PetriNetUnfolderBase]: For 26608/26659 co-relation queries the response was YES. [2023-08-27 11:51:23,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16826 conditions, 2947 events. 1296/2947 cut-off events. For 26608/26659 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 21832 event pairs, 497 based on Foata normal form. 57/2766 useless extension candidates. Maximal degree in co-relation 16737. Up to 1453 conditions per place. [2023-08-27 11:51:23,644 INFO L140 encePairwiseOnDemand]: 586/597 looper letters, 177 selfloop transitions, 42 changer transitions 5/236 dead transitions. [2023-08-27 11:51:23,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 236 transitions, 2704 flow [2023-08-27 11:51:23,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 11:51:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 11:51:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2507 transitions. [2023-08-27 11:51:23,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38175727120450736 [2023-08-27 11:51:23,647 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2507 transitions. [2023-08-27 11:51:23,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2507 transitions. [2023-08-27 11:51:23,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:51:23,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2507 transitions. [2023-08-27 11:51:23,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 227.9090909090909) internal successors, (2507), 11 states have internal predecessors, (2507), 0 states have call successors, (0), 0 states 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:23,654 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:51:23,655 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:51:23,655 INFO L175 Difference]: Start difference. First operand has 150 places, 166 transitions, 1599 flow. Second operand 11 states and 2507 transitions. [2023-08-27 11:51:23,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 236 transitions, 2704 flow [2023-08-27 11:51:23,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 236 transitions, 2698 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-27 11:51:23,711 INFO L231 Difference]: Finished difference. Result has 165 places, 183 transitions, 2019 flow [2023-08-27 11:51:23,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2019, PETRI_PLACES=165, PETRI_TRANSITIONS=183} [2023-08-27 11:51:23,711 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 79 predicate places. [2023-08-27 11:51:23,711 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 183 transitions, 2019 flow [2023-08-27 11:51:23,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 220.35294117647058) internal successors, (3746), 17 states have internal predecessors, (3746), 0 states have call successors, (0), 0 states 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:23,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:51:23,712 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:51:23,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-27 11:51:23,916 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,SelfDestructingSolverStorable30 [2023-08-27 11:51:23,916 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:51:23,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:51:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash 470231627, now seen corresponding path program 1 times [2023-08-27 11:51:23,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:51:23,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792335482] [2023-08-27 11:51:23,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:51:23,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:51:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:51:24,007 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:51:24,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:51:24,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792335482] [2023-08-27 11:51:24,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792335482] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:51:24,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 11:51:24,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 11:51:24,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926346271] [2023-08-27 11:51:24,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:51:24,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 11:51:24,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:51:24,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 11:51:24,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 11:51:24,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 597 [2023-08-27 11:51:24,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 183 transitions, 2019 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states 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:24,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:51:24,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 597 [2023-08-27 11:51:24,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:51:24,516 INFO L124 PetriNetUnfolderBase]: 1260/2903 cut-off events. [2023-08-27 11:51:24,516 INFO L125 PetriNetUnfolderBase]: For 33601/33704 co-relation queries the response was YES. [2023-08-27 11:51:24,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17638 conditions, 2903 events. 1260/2903 cut-off events. For 33601/33704 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 21782 event pairs, 760 based on Foata normal form. 32/2770 useless extension candidates. Maximal degree in co-relation 17542. Up to 2035 conditions per place. [2023-08-27 11:51:24,537 INFO L140 encePairwiseOnDemand]: 589/597 looper letters, 161 selfloop transitions, 29 changer transitions 2/204 dead transitions. [2023-08-27 11:51:24,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 204 transitions, 2588 flow [2023-08-27 11:51:24,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 11:51:24,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 11:51:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2023-08-27 11:51:24,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41987716359575655 [2023-08-27 11:51:24,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 752 transitions. [2023-08-27 11:51:24,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 752 transitions. [2023-08-27 11:51:24,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:51:24,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 752 transitions. [2023-08-27 11:51:24,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 11:51:24,542 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:51:24,542 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:51:24,542 INFO L175 Difference]: Start difference. First operand has 165 places, 183 transitions, 2019 flow. Second operand 3 states and 752 transitions. [2023-08-27 11:51:24,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 204 transitions, 2588 flow [2023-08-27 11:51:24,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 204 transitions, 2540 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-27 11:51:24,629 INFO L231 Difference]: Finished difference. Result has 167 places, 184 transitions, 2124 flow [2023-08-27 11:51:24,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=1911, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2124, PETRI_PLACES=167, PETRI_TRANSITIONS=184} [2023-08-27 11:51:24,629 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 81 predicate places. [2023-08-27 11:51:24,629 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 184 transitions, 2124 flow [2023-08-27 11:51:24,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states 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:24,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:51:24,630 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:51:24,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-08-27 11:51:24,630 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:51:24,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:51:24,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2054637964, now seen corresponding path program 1 times [2023-08-27 11:51:24,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:51:24,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008960863] [2023-08-27 11:51:24,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:51:24,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:51:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:51:28,626 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:51:28,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:51:28,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008960863] [2023-08-27 11:51:28,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008960863] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:51:28,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159524414] [2023-08-27 11:51:28,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:51:28,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:51:28,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:51:28,628 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:51:28,630 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:51:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:51:28,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-27 11:51:28,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:51:28,791 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:28,916 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:51:28,916 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:28,958 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:28,992 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 16 treesize of output 12 [2023-08-27 11:51:29,055 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:29,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:51:29,110 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 19 treesize of output 21 [2023-08-27 11:51:29,185 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:51:29,185 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 25 treesize of output 11 [2023-08-27 11:51:29,240 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 22 treesize of output 17 [2023-08-27 11:51:29,316 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:51:29,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:51:29,670 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_1192 (Array Int Int))) (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1192) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset| 4))))) (<= 10 |c_t_funThread1of2ForFork0_~i~0#1|) (< |c_t_funThread1of2ForFork0_~i~0#1| 0)) (forall ((v_ArrVal_1192 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_71| Int) (v_ArrVal_1191 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_71| 28))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_71|) (< |v_t_funThread2of2ForFork0_~i~0#1_71| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1192) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1191) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0))))) is different from false [2023-08-27 11:51:29,702 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:51:29,702 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 29 treesize of output 30 [2023-08-27 11:51:29,713 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:51:29,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-27 11:51:29,719 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 25 treesize of output 18 [2023-08-27 11:51:29,737 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:51:29,738 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 29 treesize of output 30 [2023-08-27 11:51:29,741 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 48 treesize of output 30 [2023-08-27 11:51:29,748 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_71| Int) (v_ArrVal_1191 (Array Int Int)) (|~#a~0.offset| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1191) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_71| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_71|) (< |v_t_funThread2of2ForFork0_~i~0#1_71| 0)))) is different from false [2023-08-27 11:51:32,997 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:51:32,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159524414] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:51:32,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:51:32,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 29 [2023-08-27 11:51:32,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084711553] [2023-08-27 11:51:32,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:51:32,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-27 11:51:33,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:51:33,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-27 11:51:33,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=694, Unknown=2, NotChecked=110, Total=930 [2023-08-27 11:51:33,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 597 [2023-08-27 11:51:33,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 184 transitions, 2124 flow. Second operand has 31 states, 31 states have (on average 190.8709677419355) internal successors, (5917), 31 states have internal predecessors, (5917), 0 states have call successors, (0), 0 states 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:33,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:51:33,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 597 [2023-08-27 11:51:33,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:51:35,830 INFO L124 PetriNetUnfolderBase]: 1714/3767 cut-off events. [2023-08-27 11:51:35,830 INFO L125 PetriNetUnfolderBase]: For 48747/48771 co-relation queries the response was YES. [2023-08-27 11:51:35,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23328 conditions, 3767 events. 1714/3767 cut-off events. For 48747/48771 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 28567 event pairs, 301 based on Foata normal form. 30/3566 useless extension candidates. Maximal degree in co-relation 23229. Up to 1934 conditions per place. [2023-08-27 11:51:35,860 INFO L140 encePairwiseOnDemand]: 584/597 looper letters, 251 selfloop transitions, 69 changer transitions 6/332 dead transitions. [2023-08-27 11:51:35,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 332 transitions, 4290 flow [2023-08-27 11:51:35,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-27 11:51:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-27 11:51:35,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4720 transitions. [2023-08-27 11:51:35,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3294249022892239 [2023-08-27 11:51:35,864 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 4720 transitions. [2023-08-27 11:51:35,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 4720 transitions. [2023-08-27 11:51:35,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:51:35,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4720 transitions. [2023-08-27 11:51:35,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 196.66666666666666) internal successors, (4720), 24 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states 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:35,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 597.0) internal successors, (14925), 25 states have internal predecessors, (14925), 0 states have call successors, (0), 0 states 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:35,880 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 597.0) internal successors, (14925), 25 states have internal predecessors, (14925), 0 states have call successors, (0), 0 states 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:35,880 INFO L175 Difference]: Start difference. First operand has 167 places, 184 transitions, 2124 flow. Second operand 24 states and 4720 transitions. [2023-08-27 11:51:35,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 332 transitions, 4290 flow [2023-08-27 11:51:36,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 332 transitions, 4178 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-08-27 11:51:36,006 INFO L231 Difference]: Finished difference. Result has 192 places, 227 transitions, 2697 flow [2023-08-27 11:51:36,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=2046, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2697, PETRI_PLACES=192, PETRI_TRANSITIONS=227} [2023-08-27 11:51:36,006 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 106 predicate places. [2023-08-27 11:51:36,007 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 227 transitions, 2697 flow [2023-08-27 11:51:36,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 190.8709677419355) internal successors, (5917), 31 states have internal predecessors, (5917), 0 states have call successors, (0), 0 states 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:36,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:51:36,007 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:51:36,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-27 11:51:36,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:51:36,213 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:51:36,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:51:36,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2091039326, now seen corresponding path program 2 times [2023-08-27 11:51:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:51:36,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294372053] [2023-08-27 11:51:36,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:51:36,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:51:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:51:36,983 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:51:36,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:51:36,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294372053] [2023-08-27 11:51:36,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294372053] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:51:36,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903981194] [2023-08-27 11:51:36,983 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 11:51:36,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:51:36,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:51:36,985 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:51:37,012 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:51:37,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 11:51:37,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:51:37,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-27 11:51:37,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:51:37,145 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:37,255 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:51:37,255 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:37,281 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:37,316 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 16 treesize of output 12 [2023-08-27 11:51:37,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:51:37,375 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 19 treesize of output 21 [2023-08-27 11:51:37,397 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 22 treesize of output 17 [2023-08-27 11:51:37,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:51:37,436 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 19 treesize of output 21 [2023-08-27 11:51:37,468 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 20 treesize of output 22 [2023-08-27 11:51:37,531 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:51:37,531 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 25 treesize of output 11 [2023-08-27 11:51:37,590 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:51:37,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:51:37,854 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:51:37,855 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 29 treesize of output 30 [2023-08-27 11:51:37,864 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:51:37,864 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-27 11:51:37,869 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 25 treesize of output 18 [2023-08-27 11:51:37,924 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_73| Int) (|~#a~0.offset| Int) (v_ArrVal_1278 Int) (|v_t_funThread1of2ForFork0_~i~0#1_74| Int) (v_ArrVal_1281 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_73| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_73|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_74| 28) |~#a~0.offset|) v_ArrVal_1278)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1281) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_73| 28) |~#a~0.offset|)) 0)))) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_73| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_73| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_73|) (forall ((|~#a~0.offset| Int) (v_ArrVal_1278 Int) (|v_t_funThread1of2ForFork0_~i~0#1_74| Int) (v_ArrVal_1281 (Array Int Int))) (or (= |v_t_funThread2of2ForFork0_~i~0#1_73| |v_t_funThread1of2ForFork0_~i~0#1_74|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_74| 28) |~#a~0.offset|) v_ArrVal_1278)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1281) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_73| 28) |~#a~0.offset|)) 0))))))) is different from false [2023-08-27 11:51:40,053 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_73| Int) (v_ArrVal_1274 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_73| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_73|) (forall ((|~#a~0.offset| Int) (v_ArrVal_1278 Int) (|v_t_funThread1of2ForFork0_~i~0#1_74| Int) (v_ArrVal_1281 (Array Int Int))) (or (= |v_t_funThread2of2ForFork0_~i~0#1_73| |v_t_funThread1of2ForFork0_~i~0#1_74|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1274))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_74| 28) |~#a~0.offset|) v_ArrVal_1278))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1281) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_73| 28) |~#a~0.offset|)) 0))))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_73| Int) (|~#a~0.offset| Int) (v_ArrVal_1278 Int) (v_ArrVal_1274 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_74| Int) (v_ArrVal_1281 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_73| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_73|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1274))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_74| 28) |~#a~0.offset|) v_ArrVal_1278))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1281) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_73| 28) |~#a~0.offset|)) 0))))) is different from false [2023-08-27 11:51:47,574 WARN L234 SmtUtils]: Spent 7.45s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:51:47,880 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:51:47,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903981194] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:51:47,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:51:47,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 23 [2023-08-27 11:51:47,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287055222] [2023-08-27 11:51:47,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:51:47,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-27 11:51:47,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:51:47,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-27 11:51:47,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=390, Unknown=7, NotChecked=86, Total=600 [2023-08-27 11:51:47,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 597 [2023-08-27 11:51:47,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 227 transitions, 2697 flow. Second operand has 25 states, 25 states have (on average 191.12) internal successors, (4778), 25 states have internal predecessors, (4778), 0 states have call successors, (0), 0 states 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:47,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:51:47,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 597 [2023-08-27 11:51:47,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:52:10,178 WARN L234 SmtUtils]: Spent 22.24s on a formula simplification. DAG size of input: 60 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:52:12,202 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:52:14,220 WARN L539 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:16,222 WARN L539 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:18,234 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:52:20,247 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:52:22,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:52:24,252 WARN L539 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:26,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:43,056 WARN L234 SmtUtils]: Spent 14.76s on a formula simplification. DAG size of input: 57 DAG size of output: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:52:45,065 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:52:47,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 [0, 1] [2023-08-27 11:52:49,083 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:52:51,121 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:52:53,128 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:52:55,131 WARN L539 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:57,140 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:52:59,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:53:01,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:03,325 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:53:05,369 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:07,387 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:53:09,447 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:53:11,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:53:13,464 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:15,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:16,055 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_73| Int)) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_73| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_73| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_73|) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= (select .cse1 (+ .cse0 |c_~#a~0.offset|)) 0)))) (forall ((v_ArrVal_1280 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_73| Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse2 (* |v_t_funThread2of2ForFork0_~i~0#1_73| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_73| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_73|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1281) |c_~#a~0.base|) (+ .cse2 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1280) |c_~#a~0.base|) (+ .cse2 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_1280 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_73| Int) (v_ArrVal_1278 Int) (v_ArrVal_1281 (Array Int Int))) (let ((.cse3 (* |v_t_funThread2of2ForFork0_~i~0#1_73| 28))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_73| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_73|) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1280) |c_~#a~0.base|) (+ .cse3 |c_~#a~0.offset| 4)) 0)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse1 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|) v_ArrVal_1278)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1281) |c_~#a~0.base|) (+ .cse3 |c_~#a~0.offset|)) 0)))))) is different from false [2023-08-27 11:53:17,632 INFO L124 PetriNetUnfolderBase]: 1957/4291 cut-off events. [2023-08-27 11:53:17,633 INFO L125 PetriNetUnfolderBase]: For 52227/52233 co-relation queries the response was YES. [2023-08-27 11:53:17,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27085 conditions, 4291 events. 1957/4291 cut-off events. For 52227/52233 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 33994 event pairs, 345 based on Foata normal form. 46/4064 useless extension candidates. Maximal degree in co-relation 26972. Up to 1990 conditions per place. [2023-08-27 11:53:17,672 INFO L140 encePairwiseOnDemand]: 580/597 looper letters, 265 selfloop transitions, 77 changer transitions 6/354 dead transitions. [2023-08-27 11:53:17,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 354 transitions, 4883 flow [2023-08-27 11:53:17,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-27 11:53:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-27 11:53:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3572 transitions. [2023-08-27 11:53:17,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33240275451330725 [2023-08-27 11:53:17,676 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3572 transitions. [2023-08-27 11:53:17,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3572 transitions. [2023-08-27 11:53:17,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:53:17,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3572 transitions. [2023-08-27 11:53:17,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 198.44444444444446) internal successors, (3572), 18 states have internal predecessors, (3572), 0 states have call successors, (0), 0 states 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:17,686 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:53:17,687 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:53:17,687 INFO L175 Difference]: Start difference. First operand has 192 places, 227 transitions, 2697 flow. Second operand 18 states and 3572 transitions. [2023-08-27 11:53:17,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 354 transitions, 4883 flow [2023-08-27 11:53:17,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 354 transitions, 4775 flow, removed 35 selfloop flow, removed 19 redundant places. [2023-08-27 11:53:17,815 INFO L231 Difference]: Finished difference. Result has 195 places, 265 transitions, 3312 flow [2023-08-27 11:53:17,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=2577, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3312, PETRI_PLACES=195, PETRI_TRANSITIONS=265} [2023-08-27 11:53:17,815 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 109 predicate places. [2023-08-27 11:53:17,815 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 265 transitions, 3312 flow [2023-08-27 11:53:17,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 191.12) internal successors, (4778), 25 states have internal predecessors, (4778), 0 states have call successors, (0), 0 states 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:17,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:53:17,816 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:53:17,822 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:53:18,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:53:18,021 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:53:18,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:53:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash -23257656, now seen corresponding path program 1 times [2023-08-27 11:53:18,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:53:18,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703879034] [2023-08-27 11:53:18,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:53:18,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:53:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:53:18,563 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:53:18,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:53:18,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703879034] [2023-08-27 11:53:18,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703879034] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:53:18,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798631808] [2023-08-27 11:53:18,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:53:18,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:53:18,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:53:18,564 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:53:18,567 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:53:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:53:18,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-27 11:53:18,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:53:18,734 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:53:18,813 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:53:18,813 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:53:18,839 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:53:18,867 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 16 treesize of output 12 [2023-08-27 11:53:18,910 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:53:18,960 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:53:18,960 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 25 treesize of output 11 [2023-08-27 11:53:19,033 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 22 treesize of output 17 [2023-08-27 11:53:19,102 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:53:19,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:53:19,306 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 21 treesize of output 19 [2023-08-27 11:53:19,313 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 15 treesize of output 8 [2023-08-27 11:53:21,329 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_76| Int) (|v_t_funThread2of2ForFork0_~i~0#1_75| Int) (v_ArrVal_1365 Int) (v_ArrVal_1364 (Array Int Int)) (|~#a~0.offset| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_75|) (= |v_t_funThread2of2ForFork0_~i~0#1_75| |v_t_funThread1of2ForFork0_~i~0#1_76|) (< |v_t_funThread2of2ForFork0_~i~0#1_75| 0) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1364) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_75| 28) |~#a~0.offset|) v_ArrVal_1365) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_76| 28) |~#a~0.offset|)) 0))) is different from false [2023-08-27 11:53:21,570 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:21,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798631808] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:53:21,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:53:21,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2023-08-27 11:53:21,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261467349] [2023-08-27 11:53:21,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:53:21,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-27 11:53:21,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:53:21,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-27 11:53:21,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=302, Unknown=2, NotChecked=36, Total=420 [2023-08-27 11:53:21,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 597 [2023-08-27 11:53:21,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 265 transitions, 3312 flow. Second operand has 21 states, 21 states have (on average 197.57142857142858) internal successors, (4149), 21 states have internal predecessors, (4149), 0 states have call successors, (0), 0 states 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:21,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:53:21,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 597 [2023-08-27 11:53:21,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:53:22,949 INFO L124 PetriNetUnfolderBase]: 2230/4915 cut-off events. [2023-08-27 11:53:22,949 INFO L125 PetriNetUnfolderBase]: For 67311/67329 co-relation queries the response was YES. [2023-08-27 11:53:22,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33199 conditions, 4915 events. 2230/4915 cut-off events. For 67311/67329 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 40130 event pairs, 455 based on Foata normal form. 35/4638 useless extension candidates. Maximal degree in co-relation 33107. Up to 2994 conditions per place. [2023-08-27 11:53:22,989 INFO L140 encePairwiseOnDemand]: 582/597 looper letters, 314 selfloop transitions, 48 changer transitions 10/378 dead transitions. [2023-08-27 11:53:22,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 378 transitions, 5346 flow [2023-08-27 11:53:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-27 11:53:22,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-27 11:53:22,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2689 transitions. [2023-08-27 11:53:22,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3464759695915475 [2023-08-27 11:53:22,992 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2689 transitions. [2023-08-27 11:53:22,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2689 transitions. [2023-08-27 11:53:22,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:53:22,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2689 transitions. [2023-08-27 11:53:22,996 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 206.84615384615384) internal successors, (2689), 13 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states 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:22,999 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:53:22,999 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:53:22,999 INFO L175 Difference]: Start difference. First operand has 195 places, 265 transitions, 3312 flow. Second operand 13 states and 2689 transitions. [2023-08-27 11:53:23,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 378 transitions, 5346 flow [2023-08-27 11:53:23,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 378 transitions, 5111 flow, removed 57 selfloop flow, removed 5 redundant places. [2023-08-27 11:53:23,146 INFO L231 Difference]: Finished difference. Result has 209 places, 289 transitions, 3660 flow [2023-08-27 11:53:23,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=3104, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3660, PETRI_PLACES=209, PETRI_TRANSITIONS=289} [2023-08-27 11:53:23,146 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 123 predicate places. [2023-08-27 11:53:23,146 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 289 transitions, 3660 flow [2023-08-27 11:53:23,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 197.57142857142858) internal successors, (4149), 21 states have internal predecessors, (4149), 0 states have call successors, (0), 0 states 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:23,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:53:23,147 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:53:23,154 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:53:23,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-08-27 11:53:23,355 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:53:23,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:53:23,355 INFO L85 PathProgramCache]: Analyzing trace with hash -2065236442, now seen corresponding path program 3 times [2023-08-27 11:53:23,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:53:23,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614551120] [2023-08-27 11:53:23,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:53:23,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:53:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:53:23,880 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:53:23,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:53:23,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614551120] [2023-08-27 11:53:23,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614551120] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:53:23,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990891855] [2023-08-27 11:53:23,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 11:53:23,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:53:23,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:53:23,885 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:53:23,888 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:53:24,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 11:53:24,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:53:24,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-27 11:53:24,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:53:24,086 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:53:24,190 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:53:24,191 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:53:24,218 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:53:24,254 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:53:24,297 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 16 treesize of output 12 [2023-08-27 11:53:24,356 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:53:24,356 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 25 treesize of output 11 [2023-08-27 11:53:24,438 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 22 treesize of output 17 [2023-08-27 11:53:24,501 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:53:24,501 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:53:24,612 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 21 treesize of output 19 [2023-08-27 11:53:24,618 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 15 treesize of output 8 [2023-08-27 11:53:34,724 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_78| Int) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 Int) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_77| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_77| 0) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1447) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_78| 28) |~#a~0.offset|) v_ArrVal_1451) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_77| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_77|) (= |v_t_funThread2of2ForFork0_~i~0#1_77| |v_t_funThread1of2ForFork0_~i~0#1_78|))) is different from false [2023-08-27 11:53:35,011 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:53:35,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990891855] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:53:35,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:53:35,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2023-08-27 11:53:35,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161864604] [2023-08-27 11:53:35,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:53:35,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-27 11:53:35,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:53:35,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-27 11:53:35,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=4, NotChecked=36, Total=420 [2023-08-27 11:53:35,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 597 [2023-08-27 11:53:35,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 289 transitions, 3660 flow. Second operand has 21 states, 21 states have (on average 197.57142857142858) internal successors, (4149), 21 states have internal predecessors, (4149), 0 states have call successors, (0), 0 states 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:35,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:53:35,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 597 [2023-08-27 11:53:35,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:53:36,569 INFO L124 PetriNetUnfolderBase]: 2233/4927 cut-off events. [2023-08-27 11:53:36,569 INFO L125 PetriNetUnfolderBase]: For 68755/68779 co-relation queries the response was YES. [2023-08-27 11:53:36,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33297 conditions, 4927 events. 2233/4927 cut-off events. For 68755/68779 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 40321 event pairs, 474 based on Foata normal form. 21/4634 useless extension candidates. Maximal degree in co-relation 33198. Up to 3211 conditions per place. [2023-08-27 11:53:36,614 INFO L140 encePairwiseOnDemand]: 584/597 looper letters, 319 selfloop transitions, 47 changer transitions 7/379 dead transitions. [2023-08-27 11:53:36,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 379 transitions, 5359 flow [2023-08-27 11:53:36,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 11:53:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 11:53:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2284 transitions. [2023-08-27 11:53:36,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3477996040810111 [2023-08-27 11:53:36,617 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2284 transitions. [2023-08-27 11:53:36,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2284 transitions. [2023-08-27 11:53:36,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:53:36,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2284 transitions. [2023-08-27 11:53:36,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 207.63636363636363) internal successors, (2284), 11 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states 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:36,624 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:53:36,625 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:53:36,625 INFO L175 Difference]: Start difference. First operand has 209 places, 289 transitions, 3660 flow. Second operand 11 states and 2284 transitions. [2023-08-27 11:53:36,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 379 transitions, 5359 flow [2023-08-27 11:53:36,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 379 transitions, 5285 flow, removed 21 selfloop flow, removed 2 redundant places. [2023-08-27 11:53:36,814 INFO L231 Difference]: Finished difference. Result has 222 places, 302 transitions, 3932 flow [2023-08-27 11:53:36,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=3578, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3932, PETRI_PLACES=222, PETRI_TRANSITIONS=302} [2023-08-27 11:53:36,815 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 136 predicate places. [2023-08-27 11:53:36,815 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 302 transitions, 3932 flow [2023-08-27 11:53:36,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 197.57142857142858) internal successors, (4149), 21 states have internal predecessors, (4149), 0 states have call successors, (0), 0 states 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:36,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:53:36,815 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:53:36,821 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:53:37,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:53:37,016 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:53:37,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:53:37,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1833716752, now seen corresponding path program 2 times [2023-08-27 11:53:37,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:53:37,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832613480] [2023-08-27 11:53:37,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:53:37,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:53:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:53:37,782 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:53:37,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:53:37,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832613480] [2023-08-27 11:53:37,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832613480] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:53:37,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555886887] [2023-08-27 11:53:37,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 11:53:37,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:53:37,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:53:37,785 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:53:37,816 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:53:37,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 11:53:37,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:53:37,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 44 conjunts are in the unsatisfiable core [2023-08-27 11:53:37,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:53:37,998 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:53:38,179 INFO L322 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-08-27 11:53:38,180 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:53:38,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:53:38,230 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:53:38,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:53:38,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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:53:38,319 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 16 treesize of output 12 [2023-08-27 11:53:38,396 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:53:38,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 25 treesize of output 11 [2023-08-27 11:53:38,461 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 22 treesize of output 17 [2023-08-27 11:53:38,527 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:53:38,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:53:38,607 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 21 treesize of output 19 [2023-08-27 11:53:38,612 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 15 treesize of output 8 [2023-08-27 11:53:40,640 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1532 (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_1532) |c_~#a~0.base|))) is different from false [2023-08-27 11:53:40,766 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:53:40,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555886887] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:53:40,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:53:40,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2023-08-27 11:53:40,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322302012] [2023-08-27 11:53:40,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:53:40,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 11:53:40,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:53:40,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 11:53:40,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=232, Unknown=1, NotChecked=32, Total=342 [2023-08-27 11:53:40,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 597 [2023-08-27 11:53:40,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 302 transitions, 3932 flow. Second operand has 19 states, 19 states have (on average 190.6315789473684) internal successors, (3622), 19 states have internal predecessors, (3622), 0 states have call successors, (0), 0 states 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:40,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:53:40,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 597 [2023-08-27 11:53:40,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:53:42,993 INFO L124 PetriNetUnfolderBase]: 2520/5523 cut-off events. [2023-08-27 11:53:42,993 INFO L125 PetriNetUnfolderBase]: For 81162/81192 co-relation queries the response was YES. [2023-08-27 11:53:43,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37912 conditions, 5523 events. 2520/5523 cut-off events. For 81162/81192 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 46176 event pairs, 543 based on Foata normal form. 66/5236 useless extension candidates. Maximal degree in co-relation 37808. Up to 3376 conditions per place. [2023-08-27 11:53:43,048 INFO L140 encePairwiseOnDemand]: 580/597 looper letters, 351 selfloop transitions, 80 changer transitions 7/444 dead transitions. [2023-08-27 11:53:43,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 444 transitions, 6365 flow [2023-08-27 11:53:43,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-27 11:53:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-27 11:53:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3393 transitions. [2023-08-27 11:53:43,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3343186520839492 [2023-08-27 11:53:43,052 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3393 transitions. [2023-08-27 11:53:43,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3393 transitions. [2023-08-27 11:53:43,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:53:43,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3393 transitions. [2023-08-27 11:53:43,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 199.58823529411765) internal successors, (3393), 17 states have internal predecessors, (3393), 0 states have call successors, (0), 0 states 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:43,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 597.0) internal successors, (10746), 18 states have internal predecessors, (10746), 0 states have call successors, (0), 0 states 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:43,062 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 597.0) internal successors, (10746), 18 states have internal predecessors, (10746), 0 states have call successors, (0), 0 states 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:43,062 INFO L175 Difference]: Start difference. First operand has 222 places, 302 transitions, 3932 flow. Second operand 17 states and 3393 transitions. [2023-08-27 11:53:43,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 444 transitions, 6365 flow [2023-08-27 11:53:43,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 444 transitions, 6299 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-27 11:53:43,283 INFO L231 Difference]: Finished difference. Result has 242 places, 339 transitions, 4762 flow [2023-08-27 11:53:43,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=3866, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4762, PETRI_PLACES=242, PETRI_TRANSITIONS=339} [2023-08-27 11:53:43,284 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 156 predicate places. [2023-08-27 11:53:43,284 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 339 transitions, 4762 flow [2023-08-27 11:53:43,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 190.6315789473684) internal successors, (3622), 19 states have internal predecessors, (3622), 0 states have call successors, (0), 0 states 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:43,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:53:43,284 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:53:43,291 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:53:43,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:53:43,485 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:53:43,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:53:43,485 INFO L85 PathProgramCache]: Analyzing trace with hash 930816272, now seen corresponding path program 3 times [2023-08-27 11:53:43,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:53:43,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517561276] [2023-08-27 11:53:43,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:53:43,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:53:43,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:53:44,084 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:53:44,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:53:44,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517561276] [2023-08-27 11:53:44,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517561276] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:53:44,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983085878] [2023-08-27 11:53:44,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 11:53:44,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:53:44,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:53:44,085 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:53:44,089 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:53:44,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 11:53:44,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:53:44,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-27 11:53:44,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:53:44,240 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:53:44,337 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:53:44,338 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:53:44,361 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:53:44,394 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:53:44,435 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 16 treesize of output 12 [2023-08-27 11:53:44,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:53:44,514 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 19 treesize of output 21 [2023-08-27 11:53:44,562 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 22 treesize of output 17 [2023-08-27 11:53:44,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:53:44,605 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 19 treesize of output 21 [2023-08-27 11:53:44,652 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:53:44,652 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 25 treesize of output 11 [2023-08-27 11:53:44,720 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:53:44,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:53:44,799 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1623 (Array Int Int)) (v_ArrVal_1621 Int) (|v_t_funThread1of2ForFork0_~i~0#1_82| Int)) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_82| 28))) (or (= (select (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_1621) (+ .cse0 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1623) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0))))) is different from false [2023-08-27 11:53:44,838 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:53:44,838 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 29 treesize of output 30 [2023-08-27 11:53:44,853 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:53:44,854 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-27 11:53:44,862 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 25 treesize of output 18 [2023-08-27 11:53:59,388 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_81| Int) (v_ArrVal_1617 (Array Int Int))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_81|) (forall ((|~#a~0.offset| Int) (v_ArrVal_1621 Int) (|v_t_funThread1of2ForFork0_~i~0#1_82| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1617) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_81| 28) |~#a~0.offset|) v_ArrVal_1621) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_82| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_81| |v_t_funThread1of2ForFork0_~i~0#1_82|))) (< |v_t_funThread2of2ForFork0_~i~0#1_81| 0)))) is different from false [2023-08-27 11:54:04,117 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:54:04,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983085878] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:54:04,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:54:04,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-08-27 11:54:04,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661786121] [2023-08-27 11:54:04,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:54:04,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 11:54:04,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:54:04,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 11:54:04,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=309, Unknown=3, NotChecked=78, Total=506 [2023-08-27 11:54:04,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 597 [2023-08-27 11:54:04,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 339 transitions, 4762 flow. Second operand has 23 states, 23 states have (on average 197.30434782608697) internal successors, (4538), 23 states have internal predecessors, (4538), 0 states have call successors, (0), 0 states 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:04,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:54:04,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 597 [2023-08-27 11:54:04,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:54:06,015 INFO L124 PetriNetUnfolderBase]: 2523/5570 cut-off events. [2023-08-27 11:54:06,015 INFO L125 PetriNetUnfolderBase]: For 92490/92496 co-relation queries the response was YES. [2023-08-27 11:54:06,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39510 conditions, 5570 events. 2523/5570 cut-off events. For 92490/92496 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 46892 event pairs, 632 based on Foata normal form. 6/5217 useless extension candidates. Maximal degree in co-relation 39398. Up to 3399 conditions per place. [2023-08-27 11:54:06,060 INFO L140 encePairwiseOnDemand]: 585/597 looper letters, 307 selfloop transitions, 87 changer transitions 5/405 dead transitions. [2023-08-27 11:54:06,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 405 transitions, 6397 flow [2023-08-27 11:54:06,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 11:54:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 11:54:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2078 transitions. [2023-08-27 11:54:06,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34807370184254605 [2023-08-27 11:54:06,063 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2078 transitions. [2023-08-27 11:54:06,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2078 transitions. [2023-08-27 11:54:06,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:54:06,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2078 transitions. [2023-08-27 11:54:06,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 207.8) internal successors, (2078), 10 states have internal predecessors, (2078), 0 states have call successors, (0), 0 states 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:06,069 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:54:06,069 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:54:06,070 INFO L175 Difference]: Start difference. First operand has 242 places, 339 transitions, 4762 flow. Second operand 10 states and 2078 transitions. [2023-08-27 11:54:06,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 405 transitions, 6397 flow [2023-08-27 11:54:06,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 405 transitions, 6211 flow, removed 67 selfloop flow, removed 7 redundant places. [2023-08-27 11:54:06,336 INFO L231 Difference]: Finished difference. Result has 243 places, 352 transitions, 5098 flow [2023-08-27 11:54:06,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=4538, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5098, PETRI_PLACES=243, PETRI_TRANSITIONS=352} [2023-08-27 11:54:06,337 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 157 predicate places. [2023-08-27 11:54:06,337 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 352 transitions, 5098 flow [2023-08-27 11:54:06,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 197.30434782608697) internal successors, (4538), 23 states have internal predecessors, (4538), 0 states have call successors, (0), 0 states 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:06,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:54:06,337 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:54:06,342 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:54:06,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:54:06,538 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:54:06,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:54:06,538 INFO L85 PathProgramCache]: Analyzing trace with hash -247162014, now seen corresponding path program 2 times [2023-08-27 11:54:06,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:54:06,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665143953] [2023-08-27 11:54:06,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:54:06,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:54:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:54:06,817 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:54:06,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:54:06,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665143953] [2023-08-27 11:54:06,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665143953] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:54:06,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89357824] [2023-08-27 11:54:06,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 11:54:06,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:54:06,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:54:06,821 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:54:06,828 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:54:07,006 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 11:54:07,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:54:07,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-27 11:54:07,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:54:07,066 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:54:07,066 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:07,127 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-27 11:54:07,167 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-27 11:54:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-08-27 11:54:07,189 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-27 11:54:07,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89357824] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 11:54:07,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-27 11:54:07,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 11 [2023-08-27 11:54:07,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700300440] [2023-08-27 11:54:07,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 11:54:07,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 11:54:07,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:54:07,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 11:54:07,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-08-27 11:54:07,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 597 [2023-08-27 11:54:07,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 352 transitions, 5098 flow. Second operand has 6 states, 6 states have (on average 222.33333333333334) internal successors, (1334), 6 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states 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:07,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:54:07,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 597 [2023-08-27 11:54:07,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:54:08,126 INFO L124 PetriNetUnfolderBase]: 2364/5353 cut-off events. [2023-08-27 11:54:08,126 INFO L125 PetriNetUnfolderBase]: For 85384/85622 co-relation queries the response was YES. [2023-08-27 11:54:08,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37961 conditions, 5353 events. 2364/5353 cut-off events. For 85384/85622 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 45966 event pairs, 1092 based on Foata normal form. 30/5033 useless extension candidates. Maximal degree in co-relation 37847. Up to 3362 conditions per place. [2023-08-27 11:54:08,175 INFO L140 encePairwiseOnDemand]: 588/597 looper letters, 248 selfloop transitions, 46 changer transitions 64/372 dead transitions. [2023-08-27 11:54:08,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 372 transitions, 6045 flow [2023-08-27 11:54:08,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 11:54:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 11:54:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1165 transitions. [2023-08-27 11:54:08,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39028475711892796 [2023-08-27 11:54:08,176 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1165 transitions. [2023-08-27 11:54:08,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1165 transitions. [2023-08-27 11:54:08,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:54:08,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1165 transitions. [2023-08-27 11:54:08,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 233.0) internal successors, (1165), 5 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states 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:08,179 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:54:08,180 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:54:08,180 INFO L175 Difference]: Start difference. First operand has 243 places, 352 transitions, 5098 flow. Second operand 5 states and 1165 transitions. [2023-08-27 11:54:08,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 372 transitions, 6045 flow [2023-08-27 11:54:08,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 372 transitions, 5953 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-08-27 11:54:08,425 INFO L231 Difference]: Finished difference. Result has 242 places, 293 transitions, 4059 flow [2023-08-27 11:54:08,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=4957, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4059, PETRI_PLACES=242, PETRI_TRANSITIONS=293} [2023-08-27 11:54:08,426 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 156 predicate places. [2023-08-27 11:54:08,426 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 293 transitions, 4059 flow [2023-08-27 11:54:08,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 222.33333333333334) internal successors, (1334), 6 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states 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:08,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:54:08,426 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:54:08,432 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:54:08,627 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,SelfDestructingSolverStorable38 [2023-08-27 11:54:08,627 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:54:08,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:54:08,627 INFO L85 PathProgramCache]: Analyzing trace with hash 416095705, now seen corresponding path program 4 times [2023-08-27 11:54:08,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:54:08,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855611381] [2023-08-27 11:54:08,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:54:08,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:54:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:54:09,154 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:54:09,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:54:09,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855611381] [2023-08-27 11:54:09,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855611381] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:54:09,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732764574] [2023-08-27 11:54:09,154 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 11:54:09,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:54:09,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:54:09,157 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:54:09,185 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:54:09,347 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 11:54:09,347 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:54:09,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-27 11:54:09,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:54:09,359 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:09,456 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:54:09,456 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:09,480 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:09,495 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 16 treesize of output 12 [2023-08-27 11:54:09,553 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:09,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:54:09,569 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 19 treesize of output 21 [2023-08-27 11:54:09,627 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:54:09,627 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 25 treesize of output 11 [2023-08-27 11:54:09,668 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 22 treesize of output 17 [2023-08-27 11:54:09,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 20 treesize of output 22 [2023-08-27 11:54:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:54:09,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:54:09,763 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1795 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1795) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-08-27 11:54:16,220 WARN L234 SmtUtils]: Spent 6.06s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:54:16,309 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:54:16,309 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 29 treesize of output 30 [2023-08-27 11:54:16,312 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 48 treesize of output 30 [2023-08-27 11:54:16,321 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:54:16,321 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-27 11:54:16,323 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 11:54:16,329 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-27 11:54:16,330 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 12 [2023-08-27 11:54:16,337 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:54:16,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2023-08-27 11:54:16,340 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-27 11:54:16,348 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-27 11:54:16,348 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 12 [2023-08-27 11:54:18,377 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#a~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|v_t_funThread2of2ForFork0_~i~0#1_83| Int) (|~#a~0.offset| Int) (v_ArrVal_1791 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_83| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_83|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1791) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_83| 28) |~#a~0.offset|)) 0)))) is different from false [2023-08-27 11:54:29,952 WARN L234 SmtUtils]: Spent 11.50s on a formula simplification. DAG size of input: 34 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:54:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 4 not checked. [2023-08-27 11:54:30,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732764574] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:54:30,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:54:30,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 20 [2023-08-27 11:54:30,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044786823] [2023-08-27 11:54:30,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:54:30,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-27 11:54:30,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:54:30,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-27 11:54:30,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=298, Unknown=3, NotChecked=74, Total=462 [2023-08-27 11:54:30,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 597 [2023-08-27 11:54:30,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 293 transitions, 4059 flow. Second operand has 22 states, 22 states have (on average 197.5909090909091) internal successors, (4347), 22 states have internal predecessors, (4347), 0 states have call successors, (0), 0 states 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:30,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:54:30,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 597 [2023-08-27 11:54:30,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:54:37,835 WARN L234 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 46 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:54:38,816 INFO L124 PetriNetUnfolderBase]: 2289/4958 cut-off events. [2023-08-27 11:54:38,816 INFO L125 PetriNetUnfolderBase]: For 77241/77285 co-relation queries the response was YES. [2023-08-27 11:54:38,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34296 conditions, 4958 events. 2289/4958 cut-off events. For 77241/77285 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 40062 event pairs, 533 based on Foata normal form. 26/4627 useless extension candidates. Maximal degree in co-relation 34181. Up to 3190 conditions per place. [2023-08-27 11:54:38,869 INFO L140 encePairwiseOnDemand]: 580/597 looper letters, 333 selfloop transitions, 69 changer transitions 23/431 dead transitions. [2023-08-27 11:54:38,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 431 transitions, 6648 flow [2023-08-27 11:54:38,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-27 11:54:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-27 11:54:38,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3486 transitions. [2023-08-27 11:54:38,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3434821164646763 [2023-08-27 11:54:38,872 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3486 transitions. [2023-08-27 11:54:38,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3486 transitions. [2023-08-27 11:54:38,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:54:38,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3486 transitions. [2023-08-27 11:54:38,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 205.05882352941177) internal successors, (3486), 17 states have internal predecessors, (3486), 0 states have call successors, (0), 0 states 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:38,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 597.0) internal successors, (10746), 18 states have internal predecessors, (10746), 0 states have call successors, (0), 0 states 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:38,879 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 597.0) internal successors, (10746), 18 states have internal predecessors, (10746), 0 states have call successors, (0), 0 states 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:38,879 INFO L175 Difference]: Start difference. First operand has 242 places, 293 transitions, 4059 flow. Second operand 17 states and 3486 transitions. [2023-08-27 11:54:38,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 431 transitions, 6648 flow [2023-08-27 11:54:39,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 431 transitions, 6367 flow, removed 45 selfloop flow, removed 18 redundant places. [2023-08-27 11:54:39,103 INFO L231 Difference]: Finished difference. Result has 236 places, 328 transitions, 4555 flow [2023-08-27 11:54:39,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=3791, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4555, PETRI_PLACES=236, PETRI_TRANSITIONS=328} [2023-08-27 11:54:39,103 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 150 predicate places. [2023-08-27 11:54:39,104 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 328 transitions, 4555 flow [2023-08-27 11:54:39,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 197.5909090909091) internal successors, (4347), 22 states have internal predecessors, (4347), 0 states have call successors, (0), 0 states 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:39,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:54:39,104 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:54:39,110 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:54:39,309 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,SelfDestructingSolverStorable39 [2023-08-27 11:54:39,310 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:54:39,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:54:39,310 INFO L85 PathProgramCache]: Analyzing trace with hash -440317381, now seen corresponding path program 4 times [2023-08-27 11:54:39,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:54:39,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354414487] [2023-08-27 11:54:39,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:54:39,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:54:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:54:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-27 11:54:40,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:54:40,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354414487] [2023-08-27 11:54:40,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354414487] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:54:40,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056496197] [2023-08-27 11:54:40,211 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 11:54:40,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:54:40,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:54:40,213 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:54:40,231 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:54:40,383 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 11:54:40,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:54:40,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-27 11:54:40,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:54:40,391 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:40,461 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:54:40,461 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:40,487 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:40,504 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 16 treesize of output 12 [2023-08-27 11:54:40,555 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:40,613 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:54:40,613 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 25 treesize of output 11 [2023-08-27 11:54:40,726 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 22 treesize of output 17 [2023-08-27 11:54: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 20 treesize of output 22 [2023-08-27 11:54:40,850 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:54:40,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:54:41,094 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 21 treesize of output 19 [2023-08-27 11:54:41,100 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 15 treesize of output 8 [2023-08-27 11:54:43,110 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1885 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_85| Int) (|~#a~0.offset| Int) (v_ArrVal_1883 Int) (|v_t_funThread1of2ForFork0_~i~0#1_86| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_85|) (< |v_t_funThread2of2ForFork0_~i~0#1_85| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_85| 28) |~#a~0.offset|) v_ArrVal_1883)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1885) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_86| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_85| |v_t_funThread1of2ForFork0_~i~0#1_86|))) is different from false [2023-08-27 11:54:45,152 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1885 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_85| Int) (|~#a~0.offset| Int) (v_ArrVal_1883 Int) (|v_t_funThread1of2ForFork0_~i~0#1_86| Int)) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_85|) (< |v_t_funThread2of2ForFork0_~i~0#1_85| 0) (= |v_t_funThread2of2ForFork0_~i~0#1_85| |v_t_funThread1of2ForFork0_~i~0#1_86|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1879))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_85| 28) |~#a~0.offset|) v_ArrVal_1883))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1885) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_86| 28) |~#a~0.offset|)) 0))) is different from false [2023-08-27 11:54:45,374 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 4 not checked. [2023-08-27 11:54:45,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056496197] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:54:45,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:54:45,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 21 [2023-08-27 11:54:45,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964375703] [2023-08-27 11:54:45,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:54:45,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 11:54:45,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:54:45,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 11:54:45,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=319, Unknown=5, NotChecked=78, Total=506 [2023-08-27 11:54:45,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 597 [2023-08-27 11:54:45,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 328 transitions, 4555 flow. Second operand has 23 states, 23 states have (on average 191.47826086956522) internal successors, (4404), 23 states have internal predecessors, (4404), 0 states have call successors, (0), 0 states 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:45,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:54:45,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 597 [2023-08-27 11:54:45,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:55:14,411 WARN L234 SmtUtils]: Spent 28.99s on a formula simplification. DAG size of input: 55 DAG size of output: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:55:16,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:18,438 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:55:20,456 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:55:22,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:55:25,132 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:55:27,141 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:55:29,149 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:55:31,156 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:55:59,780 WARN L234 SmtUtils]: Spent 26.60s on a formula simplification. DAG size of input: 52 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:56:01,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:03,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:05,802 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:07,808 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:09,816 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:11,822 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:13,837 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:15,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:17,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,108 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:24,117 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:26,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:56:28,129 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:30,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:34,146 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:36,157 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:37,907 INFO L124 PetriNetUnfolderBase]: 2376/5144 cut-off events. [2023-08-27 11:56:37,907 INFO L125 PetriNetUnfolderBase]: For 79472/79513 co-relation queries the response was YES. [2023-08-27 11:56:37,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36006 conditions, 5144 events. 2376/5144 cut-off events. For 79472/79513 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 41506 event pairs, 586 based on Foata normal form. 11/4780 useless extension candidates. Maximal degree in co-relation 35893. Up to 3719 conditions per place. [2023-08-27 11:56:37,955 INFO L140 encePairwiseOnDemand]: 584/597 looper letters, 346 selfloop transitions, 51 changer transitions 21/424 dead transitions. [2023-08-27 11:56:37,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 424 transitions, 6521 flow [2023-08-27 11:56:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-27 11:56:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-27 11:56:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2987 transitions. [2023-08-27 11:56:37,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3335566722501396 [2023-08-27 11:56:37,958 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2987 transitions. [2023-08-27 11:56:37,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2987 transitions. [2023-08-27 11:56:37,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:56:37,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2987 transitions. [2023-08-27 11:56:37,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 199.13333333333333) internal successors, (2987), 15 states have internal predecessors, (2987), 0 states have call successors, (0), 0 states 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:56:37,964 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:56:37,965 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:56:37,965 INFO L175 Difference]: Start difference. First operand has 236 places, 328 transitions, 4555 flow. Second operand 15 states and 2987 transitions. [2023-08-27 11:56:37,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 424 transitions, 6521 flow [2023-08-27 11:56:38,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 424 transitions, 6373 flow, removed 52 selfloop flow, removed 8 redundant places. [2023-08-27 11:56:38,218 INFO L231 Difference]: Finished difference. Result has 245 places, 347 transitions, 4945 flow [2023-08-27 11:56:38,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=4427, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=4945, PETRI_PLACES=245, PETRI_TRANSITIONS=347} [2023-08-27 11:56:38,219 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 159 predicate places. [2023-08-27 11:56:38,219 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 347 transitions, 4945 flow [2023-08-27 11:56:38,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 191.47826086956522) internal successors, (4404), 23 states have internal predecessors, (4404), 0 states have call successors, (0), 0 states 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:56:38,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:56:38,219 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:56:38,224 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:56:38,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:56:38,424 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr4ASSERT_VIOLATIONASSERT === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 11:56:38,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:56:38,425 INFO L85 PathProgramCache]: Analyzing trace with hash 614655599, now seen corresponding path program 5 times [2023-08-27 11:56:38,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:56:38,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464976270] [2023-08-27 11:56:38,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:56:38,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:56:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:56:38,805 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:56:38,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:56:38,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464976270] [2023-08-27 11:56:38,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464976270] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:56:38,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770309257] [2023-08-27 11:56:38,806 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 11:56:38,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:56:38,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:56:38,807 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:56:38,808 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:56:39,117 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-27 11:56:39,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:56:39,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-27 11:56:39,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:56:39,124 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:56:39,188 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:56:39,188 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:56:39,207 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:56:39,229 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:56:39,256 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 16 treesize of output 12 [2023-08-27 11:56:39,306 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:56:39,306 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 25 treesize of output 11 [2023-08-27 11:56:39,395 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 22 treesize of output 17 [2023-08-27 11:56:39,449 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 20 treesize of output 22 [2023-08-27 11:56:39,519 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:56:39,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:56:39,531 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1975 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1975) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) 0)) is different from false [2023-08-27 11:56:39,648 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 21 treesize of output 19 [2023-08-27 11:56:39,652 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 15 treesize of output 8 [2023-08-27 11:56:41,667 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_88| Int) (v_ArrVal_1975 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_87| Int) (|~#a~0.offset| Int) (v_ArrVal_1974 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_88| 28) |~#a~0.offset|) v_ArrVal_1974)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1975) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_87| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_87|) (< |v_t_funThread2of2ForFork0_~i~0#1_87| 0) (= |v_t_funThread2of2ForFork0_~i~0#1_87| |v_t_funThread1of2ForFork0_~i~0#1_88|))) is different from false [2023-08-27 11:56:43,718 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_88| Int) (v_ArrVal_1975 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_87| Int) (v_ArrVal_1970 (Array Int Int)) (|~#a~0.offset| Int) (v_ArrVal_1974 Int)) (or (= 0 (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1970))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_88| 28) |~#a~0.offset|) v_ArrVal_1974))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1975) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_87| 28) |~#a~0.offset|))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_87|) (< |v_t_funThread2of2ForFork0_~i~0#1_87| 0) (= |v_t_funThread2of2ForFork0_~i~0#1_87| |v_t_funThread1of2ForFork0_~i~0#1_88|))) is different from false [2023-08-27 11:56:43,931 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:56:43,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770309257] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:56:43,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:56:43,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 19 [2023-08-27 11:56:43,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62708610] [2023-08-27 11:56:43,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:56:43,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-27 11:56:43,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:56:43,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-27 11:56:43,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=239, Unknown=5, NotChecked=102, Total=420 [2023-08-27 11:56:43,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 597 [2023-08-27 11:56:43,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 347 transitions, 4945 flow. Second operand has 21 states, 21 states have (on average 197.61904761904762) internal successors, (4150), 21 states have internal predecessors, (4150), 0 states have call successors, (0), 0 states 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:56:43,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:56:43,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 597 [2023-08-27 11:56:43,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:57:06,671 WARN L234 SmtUtils]: Spent 22.70s on a formula simplification. DAG size of input: 47 DAG size of output: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:57:08,687 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,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s 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,739 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:14,741 WARN L539 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:16,754 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:18,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,768 WARN L539 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:24,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,788 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:28,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:57:30,796 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,019 WARN L234 SmtUtils]: Spent 18.19s on a formula simplification. DAG size of input: 51 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:57:51,029 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:53,042 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:55,049 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:57,052 WARN L539 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:59,061 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:01,070 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:58:03,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:05,082 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:07,096 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:11,138 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:13,145 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:15,151 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:17,152 WARN L539 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:19,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:21,173 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:23,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,179 WARN L539 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:27,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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,196 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:31,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:58:33,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:35,243 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:37,253 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:39,259 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:41,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:58:43,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:58:45,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 [0, 1] [2023-08-27 11:58:47,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:49,309 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:51,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:58:53,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:58:55,342 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:57,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:59,351 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:59:01,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:03,361 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:05,428 WARN L539 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:07,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:59:09,437 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:11,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:13,462 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:15,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:17,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:19,481 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:59:21,489 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:23,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:25,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 [0, 1] [2023-08-27 11:59:27,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:59:29,889 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:31,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 11:59:33,312 INFO L124 PetriNetUnfolderBase]: 2392/5217 cut-off events. [2023-08-27 11:59:33,313 INFO L125 PetriNetUnfolderBase]: For 90537/90583 co-relation queries the response was YES. [2023-08-27 11:59:33,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38118 conditions, 5217 events. 2392/5217 cut-off events. For 90537/90583 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 42490 event pairs, 630 based on Foata normal form. 13/4849 useless extension candidates. Maximal degree in co-relation 38001. Up to 3702 conditions per place. [2023-08-27 11:59:33,360 INFO L140 encePairwiseOnDemand]: 585/597 looper letters, 341 selfloop transitions, 46 changer transitions 21/414 dead transitions. [2023-08-27 11:59:33,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 414 transitions, 6556 flow [2023-08-27 11:59:33,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 11:59:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 11:59:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2262 transitions. [2023-08-27 11:59:33,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3444495203289173 [2023-08-27 11:59:33,364 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2262 transitions. [2023-08-27 11:59:33,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2262 transitions. [2023-08-27 11:59:33,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:59:33,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2262 transitions. [2023-08-27 11:59:33,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 205.63636363636363) internal successors, (2262), 11 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states 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:59:33,369 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:59:33,370 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:59:33,370 INFO L175 Difference]: Start difference. First operand has 245 places, 347 transitions, 4945 flow. Second operand 11 states and 2262 transitions. [2023-08-27 11:59:33,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 414 transitions, 6556 flow [2023-08-27 11:59:33,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 414 transitions, 6466 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-08-27 11:59:33,725 INFO L231 Difference]: Finished difference. Result has 250 places, 347 transitions, 5024 flow [2023-08-27 11:59:33,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=4855, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5024, PETRI_PLACES=250, PETRI_TRANSITIONS=347} [2023-08-27 11:59:33,726 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 164 predicate places. [2023-08-27 11:59:33,726 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 347 transitions, 5024 flow [2023-08-27 11:59:33,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 197.61904761904762) internal successors, (4150), 21 states have internal predecessors, (4150), 0 states have call successors, (0), 0 states 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:59:33,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:59:33,726 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:59:33,731 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:59:33,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:59:33,927 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:59:33,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:59:33,927 INFO L85 PathProgramCache]: Analyzing trace with hash -280430725, now seen corresponding path program 5 times [2023-08-27 11:59:33,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:59:33,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109775005] [2023-08-27 11:59:33,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:59:33,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:59:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:59:34,423 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:59:34,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:59:34,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109775005] [2023-08-27 11:59:34,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109775005] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:59:34,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390605043] [2023-08-27 11:59:34,423 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 11:59:34,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:59:34,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:59:34,425 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:59:34,453 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:59:34,834 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-08-27 11:59:34,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:59:34,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-27 11:59:34,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:59:34,848 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:59:34,935 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:59:34,936 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:59:34,961 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:59:34,989 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:59:35,053 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 16 treesize of output 12 [2023-08-27 11:59:35,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:59:35,147 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 19 treesize of output 21 [2023-08-27 11:59:35,225 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:59:35,226 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 25 treesize of output 11 [2023-08-27 11:59:35,291 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 22 treesize of output 17 [2023-08-27 11:59:35,385 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 20 treesize of output 22 [2023-08-27 11:59:35,430 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:59:35,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:59:35,447 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2066 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2066) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-08-27 11:59:35,576 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:59:35,577 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 29 treesize of output 30 [2023-08-27 11:59:35,588 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:59:35,588 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-27 11:59:35,595 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 25 treesize of output 18 [2023-08-27 11:59:37,668 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_89| Int)) (or (forall ((v_ArrVal_2064 Int) (|v_t_funThread1of2ForFork0_~i~0#1_90| Int) (|~#a~0.offset| Int) (v_ArrVal_2066 (Array Int Int))) (or (= |v_t_funThread2of2ForFork0_~i~0#1_89| |v_t_funThread1of2ForFork0_~i~0#1_90|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_89| 28) |~#a~0.offset|) v_ArrVal_2064)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2066) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_90| 28) |~#a~0.offset|)) 0))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_89|) (< |v_t_funThread2of2ForFork0_~i~0#1_89| 0))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_2064 Int) (|v_t_funThread1of2ForFork0_~i~0#1_90| Int) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_89| Int) (v_ArrVal_2066 (Array Int Int))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_89|) (< |v_t_funThread2of2ForFork0_~i~0#1_89| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_89| 28) |~#a~0.offset|) v_ArrVal_2064)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2066) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_90| 28) |~#a~0.offset|)) 0)))))) is different from false [2023-08-27 11:59:39,751 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2060 (Array Int Int)) (|v_t_funThread2of2ForFork0_~i~0#1_89| Int)) (or (forall ((v_ArrVal_2064 Int) (|v_t_funThread1of2ForFork0_~i~0#1_90| Int) (|~#a~0.offset| Int) (v_ArrVal_2066 (Array Int Int))) (or (= |v_t_funThread2of2ForFork0_~i~0#1_89| |v_t_funThread1of2ForFork0_~i~0#1_90|) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2060))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_89| 28) |~#a~0.offset|) v_ArrVal_2064))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2066) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_90| 28) |~#a~0.offset|)) 0))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_89|) (< |v_t_funThread2of2ForFork0_~i~0#1_89| 0))) (or (forall ((v_ArrVal_2060 (Array Int Int)) (v_ArrVal_2064 Int) (|v_t_funThread1of2ForFork0_~i~0#1_90| Int) (|~#a~0.offset| Int) (|v_t_funThread2of2ForFork0_~i~0#1_89| Int) (v_ArrVal_2066 (Array Int Int))) (or (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_89|) (< |v_t_funThread2of2ForFork0_~i~0#1_89| 0) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2060))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_89| 28) |~#a~0.offset|) v_ArrVal_2064))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2066) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_90| 28) |~#a~0.offset|)) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-27 11:59:47,692 WARN L234 SmtUtils]: Spent 7.76s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 11:59:47,980 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:59:47,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390605043] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 11:59:47,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 11:59:47,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 22 [2023-08-27 11:59:47,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881303734] [2023-08-27 11:59:47,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 11:59:47,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-27 11:59:47,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 11:59:47,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-27 11:59:47,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=310, Unknown=5, NotChecked=120, Total=552 [2023-08-27 11:59:47,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 597 [2023-08-27 11:59:47,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 347 transitions, 5024 flow. Second operand has 24 states, 24 states have (on average 197.33333333333334) internal successors, (4736), 24 states have internal predecessors, (4736), 0 states have call successors, (0), 0 states 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:59:47,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 11:59:47,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 597 [2023-08-27 11:59:47,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 11:59:48,329 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)))) (and (forall ((v_ArrVal_2064 Int) (|v_t_funThread1of2ForFork0_~i~0#1_90| Int) (v_ArrVal_2066 (Array Int Int)) (v_ArrVal_2063 (Array Int Int))) (let ((.cse2 (* |v_t_funThread1of2ForFork0_~i~0#1_90| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 v_ArrVal_2064)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2066) |c_~#a~0.base|) (+ .cse2 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2063) |c_~#a~0.base|) (+ .cse2 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_2064 Int) (|v_t_funThread1of2ForFork0_~i~0#1_90| Int) (v_ArrVal_2066 (Array Int Int))) (let ((.cse3 (* |v_t_funThread1of2ForFork0_~i~0#1_90| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 v_ArrVal_2064)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2066) |c_~#a~0.base|) (+ .cse3 |c_~#a~0.offset|)) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ .cse3 |c_~#a~0.offset| 4)) 0))))))) is different from false [2023-08-27 11:59:51,216 WARN L539 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:55,358 WARN L539 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:56,727 INFO L124 PetriNetUnfolderBase]: 2489/5504 cut-off events. [2023-08-27 11:59:56,728 INFO L125 PetriNetUnfolderBase]: For 95462/95506 co-relation queries the response was YES. [2023-08-27 11:59:56,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39717 conditions, 5504 events. 2489/5504 cut-off events. For 95462/95506 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 45736 event pairs, 638 based on Foata normal form. 18/5129 useless extension candidates. Maximal degree in co-relation 39597. Up to 3717 conditions per place. [2023-08-27 11:59:56,778 INFO L140 encePairwiseOnDemand]: 577/597 looper letters, 369 selfloop transitions, 67 changer transitions 22/464 dead transitions. [2023-08-27 11:59:56,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 464 transitions, 7330 flow [2023-08-27 11:59:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-27 11:59:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-27 11:59:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3275 transitions. [2023-08-27 11:59:56,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3428601340033501 [2023-08-27 11:59:56,781 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3275 transitions. [2023-08-27 11:59:56,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3275 transitions. [2023-08-27 11:59:56,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 11:59:56,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3275 transitions. [2023-08-27 11:59:56,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 204.6875) internal successors, (3275), 16 states have internal predecessors, (3275), 0 states have call successors, (0), 0 states 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:59:56,788 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:59:56,788 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:59:56,788 INFO L175 Difference]: Start difference. First operand has 250 places, 347 transitions, 5024 flow. Second operand 16 states and 3275 transitions. [2023-08-27 11:59:56,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 464 transitions, 7330 flow [2023-08-27 11:59:57,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 464 transitions, 7235 flow, removed 7 selfloop flow, removed 8 redundant places. [2023-08-27 11:59:57,159 INFO L231 Difference]: Finished difference. Result has 266 places, 382 transitions, 5685 flow [2023-08-27 11:59:57,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=4929, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5685, PETRI_PLACES=266, PETRI_TRANSITIONS=382} [2023-08-27 11:59:57,159 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 180 predicate places. [2023-08-27 11:59:57,159 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 382 transitions, 5685 flow [2023-08-27 11:59:57,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 197.33333333333334) internal successors, (4736), 24 states have internal predecessors, (4736), 0 states have call successors, (0), 0 states 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:59:57,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 11:59:57,160 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:59:57,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-27 11:59:57,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:59:57,366 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:59:57,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 11:59:57,366 INFO L85 PathProgramCache]: Analyzing trace with hash -996917189, now seen corresponding path program 6 times [2023-08-27 11:59:57,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 11:59:57,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197921197] [2023-08-27 11:59:57,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 11:59:57,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 11:59:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 11:59:57,968 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:59:57,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 11:59:57,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197921197] [2023-08-27 11:59:57,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197921197] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 11:59:57,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287825109] [2023-08-27 11:59:57,969 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-27 11:59:57,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 11:59:57,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 11:59:57,970 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:59:57,971 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:59:58,335 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-08-27 11:59:58,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 11:59:58,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-27 11:59:58,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 11:59:58,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:59:58,446 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:59:58,446 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:59:58,472 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:59:58,502 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:59:58,541 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-08-27 11:59:58,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:59:58,622 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 19 treesize of output 21 [2023-08-27 11:59:58,657 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 22 treesize of output 17 [2023-08-27 11:59:58,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 11:59:58,706 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 19 treesize of output 21 [2023-08-27 11:59:58,772 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 11:59:58,772 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 25 treesize of output 11 [2023-08-27 11:59:58,850 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 20 treesize of output 22 [2023-08-27 11:59:58,891 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:59:58,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 11:59:58,898 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2158 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2158) |c_~#a~0.base|) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 0)) is different from false [2023-08-27 11:59:58,941 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2157 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_92| Int)) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_92| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2157) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2158) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0)))) is different from false [2023-08-27 11:59:58,951 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2155 Int) (v_ArrVal_2158 (Array Int Int)) (v_ArrVal_2157 (Array Int Int)) (|v_t_funThread1of2ForFork0_~i~0#1_92| Int)) (let ((.cse0 (* |v_t_funThread1of2ForFork0_~i~0#1_92| 28))) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2157) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select |c_#memory_int| |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_2155)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2158) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0)))) is different from false [2023-08-27 11:59:58,989 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:59:58,989 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 29 treesize of output 30 [2023-08-27 11:59:58,999 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 11:59:58,999 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-27 11:59:59,004 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 25 treesize of output 18 [2023-08-27 12:00:01,051 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_91| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_91| 0) (forall ((v_ArrVal_2155 Int) (v_ArrVal_2158 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_92| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_91| 28) |~#a~0.offset|) v_ArrVal_2155)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2158) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_92| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_91| |v_t_funThread1of2ForFork0_~i~0#1_92|))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_91|))) (or (forall ((|v_t_funThread2of2ForFork0_~i~0#1_91| Int) (v_ArrVal_2155 Int) (v_ArrVal_2158 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_92| Int)) (or (< |v_t_funThread2of2ForFork0_~i~0#1_91| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_91| 28) |~#a~0.offset|) v_ArrVal_2155)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2158) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_92| 28) |~#a~0.offset|)) 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_91|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2023-08-27 12:00:03,143 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread2of2ForFork0_~i~0#1_91| Int) (v_ArrVal_2151 (Array Int Int))) (or (< |v_t_funThread2of2ForFork0_~i~0#1_91| 0) (forall ((v_ArrVal_2155 Int) (v_ArrVal_2158 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_92| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2151))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_91| 28) |~#a~0.offset|) v_ArrVal_2155))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2158) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_92| 28) |~#a~0.offset|)) 0) (= |v_t_funThread2of2ForFork0_~i~0#1_91| |v_t_funThread1of2ForFork0_~i~0#1_92|))) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_91|))) (or (forall ((|v_t_funThread2of2ForFork0_~i~0#1_91| Int) (v_ArrVal_2155 Int) (v_ArrVal_2158 (Array Int Int)) (|~#a~0.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_92| Int) (v_ArrVal_2151 (Array Int Int))) (or (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2151))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_91| 28) |~#a~0.offset|) v_ArrVal_2155))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2158) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_92| 28) |~#a~0.offset|)) 0) (< |v_t_funThread2of2ForFork0_~i~0#1_91| 0) (<= 10 |v_t_funThread2of2ForFork0_~i~0#1_91|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-08-27 12:00:11,369 WARN L234 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 12:00:11,705 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 12:00:11,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287825109] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 12:00:11,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 12:00:11,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 22 [2023-08-27 12:00:11,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314856939] [2023-08-27 12:00:11,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 12:00:11,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-27 12:00:11,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 12:00:11,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-27 12:00:11,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=267, Unknown=5, NotChecked=190, Total=552 [2023-08-27 12:00:11,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 597 [2023-08-27 12:00:11,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 382 transitions, 5685 flow. Second operand has 24 states, 24 states have (on average 197.29166666666666) internal successors, (4735), 24 states have internal predecessors, (4735), 0 states have call successors, (0), 0 states 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 12:00:11,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 12:00:11,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 597 [2023-08-27 12:00:11,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 12:00:13,689 INFO L124 PetriNetUnfolderBase]: 2496/5525 cut-off events. [2023-08-27 12:00:13,689 INFO L125 PetriNetUnfolderBase]: For 115798/115804 co-relation queries the response was YES. [2023-08-27 12:00:13,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43517 conditions, 5525 events. 2496/5525 cut-off events. For 115798/115804 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 45918 event pairs, 675 based on Foata normal form. 4/5134 useless extension candidates. Maximal degree in co-relation 43389. Up to 3690 conditions per place. [2023-08-27 12:00:13,753 INFO L140 encePairwiseOnDemand]: 582/597 looper letters, 341 selfloop transitions, 73 changer transitions 10/430 dead transitions. [2023-08-27 12:00:13,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 430 transitions, 7264 flow [2023-08-27 12:00:13,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 12:00:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 12:00:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1865 transitions. [2023-08-27 12:00:13,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34710589986971896 [2023-08-27 12:00:13,755 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1865 transitions. [2023-08-27 12:00:13,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1865 transitions. [2023-08-27 12:00:13,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 12:00:13,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1865 transitions. [2023-08-27 12:00:13,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 207.22222222222223) internal successors, (1865), 9 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states 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 12:00:13,759 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 12:00:13,759 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 12:00:13,759 INFO L175 Difference]: Start difference. First operand has 266 places, 382 transitions, 5685 flow. Second operand 9 states and 1865 transitions. [2023-08-27 12:00:13,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 430 transitions, 7264 flow [2023-08-27 12:00:14,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 430 transitions, 7112 flow, removed 58 selfloop flow, removed 4 redundant places. [2023-08-27 12:00:14,129 INFO L231 Difference]: Finished difference. Result has 272 places, 392 transitions, 5919 flow [2023-08-27 12:00:14,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=597, PETRI_DIFFERENCE_MINUEND_FLOW=5495, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5919, PETRI_PLACES=272, PETRI_TRANSITIONS=392} [2023-08-27 12:00:14,130 INFO L281 CegarLoopForPetriNet]: 86 programPoint places, 186 predicate places. [2023-08-27 12:00:14,130 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 392 transitions, 5919 flow [2023-08-27 12:00:14,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 197.29166666666666) internal successors, (4735), 24 states have internal predecessors, (4735), 0 states have call successors, (0), 0 states 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 12:00:14,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 12:00:14,131 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, 1] [2023-08-27 12:00:14,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-27 12:00:14,333 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,SelfDestructingSolverStorable43 [2023-08-27 12:00:14,333 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2023-08-27 12:00:14,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 12:00:14,333 INFO L85 PathProgramCache]: Analyzing trace with hash -906293693, now seen corresponding path program 1 times [2023-08-27 12:00:14,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 12:00:14,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630163032] [2023-08-27 12:00:14,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:00:14,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 12:00:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:00:15,293 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 12:00:15,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 12:00:15,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630163032] [2023-08-27 12:00:15,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630163032] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 12:00:15,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949605228] [2023-08-27 12:00:15,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 12:00:15,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 12:00:15,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 12:00:15,295 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 12:00:15,302 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 12:00:15,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 12:00:15,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-27 12:00:15,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 12:00:15,489 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 12:00:15,744 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 12:00:15,745 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 12:00:15,792 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 12:00:15,838 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 16 treesize of output 12 [2023-08-27 12:00:16,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 12:00:16,037 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 19 treesize of output 21 [2023-08-27 12:00:16,153 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 35 treesize of output 28 [2023-08-27 12:00:16,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 12:00:16,249 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 19 treesize of output 21 [2023-08-27 12:00:16,331 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 20 treesize of output 22 [2023-08-27 12:00:16,455 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-27 12:00: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 25 treesize of output 11 [2023-08-27 12:00:16,607 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 29 treesize of output 24 [2023-08-27 12:00:16,751 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 12:00:16,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 12:00:17,003 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread2of2ForFork0_~i~0#1_93| Int) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2258 Int) (v_ArrVal_2256 (Array Int Int))) (let ((.cse0 (* |v_t_funThread2of2ForFork0_~i~0#1_93| 28))) (or (<= 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2257) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0) v_ArrVal_2258) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 2147483647)) (not (= 0 (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2256) |c_~#a~0.base|) (+ |c_~#a~0.offset| 4 .cse0))))))) is different from false [2023-08-27 12:00:17,433 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 12:00:17,433 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 29 treesize of output 30 [2023-08-27 12:00:17,531 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-27 12:00:17,531 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2023-08-27 12:00:17,615 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 25 treesize of output 18 Received shutdown request... [2023-08-27 12:00:20,505 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 12:00:20,509 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 12:00:21,516 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 12:00:21,712 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 12:00:21,749 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 12:00:21,750 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-08-27 12:00:21,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-08-27 12:00:21,751 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:311) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-08-27 12:00:21,754 INFO L158 Benchmark]: Toolchain (without parser) took 836991.64ms. Allocated memory was 348.1MB in the beginning and 13.1GB in the end (delta: 12.7GB). Free memory was 322.8MB in the beginning and 10.5GB in the end (delta: -10.2GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-27 12:00:21,754 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 348.1MB. Free memory was 326.0MB in the beginning and 325.9MB in the end (delta: 119.2kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 12:00:21,754 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.42ms. Allocated memory is still 348.1MB. Free memory was 322.2MB in the beginning and 293.0MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-27 12:00:21,754 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.78ms. Allocated memory is still 348.1MB. Free memory was 293.0MB in the beginning and 290.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 12:00:21,754 INFO L158 Benchmark]: Boogie Preprocessor took 30.29ms. Allocated memory is still 348.1MB. Free memory was 290.0MB in the beginning and 287.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 12:00:21,754 INFO L158 Benchmark]: RCFGBuilder took 412.89ms. Allocated memory is still 348.1MB. Free memory was 287.8MB in the beginning and 267.3MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-27 12:00:21,754 INFO L158 Benchmark]: TraceAbstraction took 835914.79ms. Allocated memory was 348.1MB in the beginning and 13.1GB in the end (delta: 12.7GB). Free memory was 266.9MB in the beginning and 10.5GB in the end (delta: -10.2GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-27 12:00:21,755 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 348.1MB. Free memory was 326.0MB in the beginning and 325.9MB in the end (delta: 119.2kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 578.42ms. Allocated memory is still 348.1MB. Free memory was 322.2MB in the beginning and 293.0MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 50.78ms. Allocated memory is still 348.1MB. Free memory was 293.0MB in the beginning and 290.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.29ms. Allocated memory is still 348.1MB. Free memory was 290.0MB in the beginning and 287.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 412.89ms. Allocated memory is still 348.1MB. Free memory was 287.8MB in the beginning and 267.3MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 835914.79ms. Allocated memory was 348.1MB in the beginning and 13.1GB in the end (delta: 12.7GB). Free memory was 266.9MB in the beginning and 10.5GB in the end (delta: -10.2GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 736]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [736] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 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.8s, 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.7s, 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 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown