/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/pthread-complex/safestack_relacy.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:22:27,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:22:27,620 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 10:22:27,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:22:27,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:22:27,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:22:27,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:22:27,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:22:27,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:22:27,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:22:27,662 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:22:27,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:22:27,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:22:27,663 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:22:27,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:22:27,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:22:27,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:22:27,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:22:27,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:22:27,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:22:27,665 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:22:27,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:22:27,666 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:22:27,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:22:27,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:22:27,667 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:22:27,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:22:27,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:22:27,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:22:27,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:22:27,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:22:27,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:22:27,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:22:27,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:22:27,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:22:27,670 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 10:22:28,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:22:28,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:22:28,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:22:28,030 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:22:28,032 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:22:28,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-complex/safestack_relacy.i [2023-08-27 10:22:29,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:22:29,553 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:22:29,553 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/safestack_relacy.i [2023-08-27 10:22:29,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da71e6d32/335be48574224c588251c8706f0879e1/FLAG6e8e80c01 [2023-08-27 10:22:29,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da71e6d32/335be48574224c588251c8706f0879e1 [2023-08-27 10:22:29,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:22:29,600 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:22:29,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:22:29,602 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:22:29,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:22:29,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:22:29" (1/1) ... [2023-08-27 10:22:29,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11af2f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:22:29, skipping insertion in model container [2023-08-27 10:22:29,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:22:29" (1/1) ... [2023-08-27 10:22:29,686 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:22:30,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:22:30,248 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:22:30,259 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [127] [2023-08-27 10:22:30,269 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [573] [2023-08-27 10:22:30,269 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [574] [2023-08-27 10:22:30,294 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:22:30,388 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:22:30,388 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:22:30,394 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:22:30,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:22:30 WrapperNode [2023-08-27 10:22:30,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:22:30,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:22:30,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:22:30,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:22:30,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:22:30" (1/1) ... [2023-08-27 10:22:30,427 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:22:30" (1/1) ... [2023-08-27 10:22:30,459 INFO L138 Inliner]: procedures = 481, calls = 75, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 305 [2023-08-27 10:22:30,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:22:30,460 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:22:30,460 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:22:30,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:22:30,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:22:30" (1/1) ... [2023-08-27 10:22:30,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:22:30" (1/1) ... [2023-08-27 10:22:30,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:22:30" (1/1) ... [2023-08-27 10:22:30,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:22:30" (1/1) ... [2023-08-27 10:22:30,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:22:30" (1/1) ... [2023-08-27 10:22:30,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:22:30" (1/1) ... [2023-08-27 10:22:30,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:22:30" (1/1) ... [2023-08-27 10:22:30,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:22:30" (1/1) ... [2023-08-27 10:22:30,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:22:30,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:22:30,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:22:30,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:22:30,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:22:30" (1/1) ... [2023-08-27 10:22:30,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:22:30,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:22:30,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 10:22:30,595 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 10:22:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:22:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:22:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:22:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 10:22:30,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:22:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2023-08-27 10:22:30,610 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2023-08-27 10:22:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:22:30,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:22:30,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:22:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:22:30,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:22:30,612 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 10:22:30,909 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:22:30,910 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:22:31,308 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:22:31,365 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:22:31,366 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-08-27 10:22:31,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:22:31 BoogieIcfgContainer [2023-08-27 10:22:31,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:22:31,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:22:31,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:22:31,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:22:31,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:22:29" (1/3) ... [2023-08-27 10:22:31,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36eea911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:22:31, skipping insertion in model container [2023-08-27 10:22:31,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:22:30" (2/3) ... [2023-08-27 10:22:31,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36eea911 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:22:31, skipping insertion in model container [2023-08-27 10:22:31,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:22:31" (3/3) ... [2023-08-27 10:22:31,375 INFO L112 eAbstractionObserver]: Analyzing ICFG safestack_relacy.i [2023-08-27 10:22:31,390 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:22:31,390 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2023-08-27 10:22:31,390 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:22:31,487 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-27 10:22:31,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 268 places, 283 transitions, 574 flow [2023-08-27 10:22:31,640 INFO L124 PetriNetUnfolderBase]: 20/297 cut-off events. [2023-08-27 10:22:31,641 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-27 10:22:31,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 297 events. 20/297 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 557 event pairs, 0 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 197. Up to 4 conditions per place. [2023-08-27 10:22:31,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 268 places, 283 transitions, 574 flow [2023-08-27 10:22:31,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 265 places, 279 transitions, 566 flow [2023-08-27 10:22:31,667 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:22:31,681 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 265 places, 279 transitions, 566 flow [2023-08-27 10:22:31,688 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 265 places, 279 transitions, 566 flow [2023-08-27 10:22:31,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 279 transitions, 566 flow [2023-08-27 10:22:31,751 INFO L124 PetriNetUnfolderBase]: 19/293 cut-off events. [2023-08-27 10:22:31,751 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-27 10:22:31,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 293 events. 19/293 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 538 event pairs, 0 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 197. Up to 4 conditions per place. [2023-08-27 10:22:31,760 INFO L119 LiptonReduction]: Number of co-enabled transitions 8352 [2023-08-27 10:22:39,994 INFO L134 LiptonReduction]: Checked pairs total: 9744 [2023-08-27 10:22:39,995 INFO L136 LiptonReduction]: Total number of compositions: 292 [2023-08-27 10:22:40,007 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:22:40,013 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;@47f234df, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:22:40,013 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-08-27 10:22:40,016 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:22:40,016 INFO L124 PetriNetUnfolderBase]: 1/2 cut-off events. [2023-08-27 10:22:40,016 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:22:40,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:22:40,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-27 10:22:40,017 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:22:40,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:22:40,022 INFO L85 PathProgramCache]: Analyzing trace with hash 39929, now seen corresponding path program 1 times [2023-08-27 10:22:40,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:22:40,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968228711] [2023-08-27 10:22:40,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:22:40,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:22:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:22:40,346 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 10:22:40,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:22:40,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968228711] [2023-08-27 10:22:40,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968228711] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:22:40,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:22:40,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:22:40,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022893816] [2023-08-27 10:22:40,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:22:40,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:22:40,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:22:40,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:22:40,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:22:40,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 575 [2023-08-27 10:22:40,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 54 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:40,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:22:40,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 575 [2023-08-27 10:22:40,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:22:40,508 INFO L124 PetriNetUnfolderBase]: 152/305 cut-off events. [2023-08-27 10:22:40,508 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-27 10:22:40,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 305 events. 152/305 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1044 event pairs, 115 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 588. Up to 304 conditions per place. [2023-08-27 10:22:40,511 INFO L140 encePairwiseOnDemand]: 563/575 looper letters, 41 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-27 10:22:40,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 178 flow [2023-08-27 10:22:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:22:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:22:40,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2023-08-27 10:22:40,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45855072463768115 [2023-08-27 10:22:40,527 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 791 transitions. [2023-08-27 10:22:40,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 791 transitions. [2023-08-27 10:22:40,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:22:40,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 791 transitions. [2023-08-27 10:22:40,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:40,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 575.0) internal successors, (2300), 4 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 10:22:40,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 575.0) internal successors, (2300), 4 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 10:22:40,545 INFO L175 Difference]: Start difference. First operand has 47 places, 54 transitions, 116 flow. Second operand 3 states and 791 transitions. [2023-08-27 10:22:40,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 178 flow [2023-08-27 10:22:40,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:22:40,549 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 96 flow [2023-08-27 10:22:40,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2023-08-27 10:22:40,554 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2023-08-27 10:22:40,554 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 96 flow [2023-08-27 10:22:40,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:40,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:22:40,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-27 10:22:40,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:22:40,555 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:22:40,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:22:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash 40448, now seen corresponding path program 1 times [2023-08-27 10:22:40,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:22:40,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230710966] [2023-08-27 10:22:40,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:22:40,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:22:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:22:40,609 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 10:22:40,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:22:40,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230710966] [2023-08-27 10:22:40,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230710966] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:22:40,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:22:40,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:22:40,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337774721] [2023-08-27 10:22:40,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:22:40,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:22:40,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:22:40,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:22:40,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:22:40,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 575 [2023-08-27 10:22:40,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:40,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:22:40,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 575 [2023-08-27 10:22:40,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:22:40,766 INFO L124 PetriNetUnfolderBase]: 303/608 cut-off events. [2023-08-27 10:22:40,766 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 10:22:40,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 608 events. 303/608 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2681 event pairs, 230 based on Foata normal form. 0/325 useless extension candidates. Maximal degree in co-relation 1220. Up to 305 conditions per place. [2023-08-27 10:22:40,769 INFO L140 encePairwiseOnDemand]: 572/575 looper letters, 80 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-27 10:22:40,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 83 transitions, 346 flow [2023-08-27 10:22:40,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:22:40,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:22:40,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 827 transitions. [2023-08-27 10:22:40,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47942028985507246 [2023-08-27 10:22:40,772 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 827 transitions. [2023-08-27 10:22:40,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 827 transitions. [2023-08-27 10:22:40,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:22:40,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 827 transitions. [2023-08-27 10:22:40,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:40,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 575.0) internal successors, (2300), 4 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 10:22:40,779 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 575.0) internal successors, (2300), 4 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 10:22:40,779 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 96 flow. Second operand 3 states and 827 transitions. [2023-08-27 10:22:40,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 83 transitions, 346 flow [2023-08-27 10:22:40,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 83 transitions, 345 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:22:40,782 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 107 flow [2023-08-27 10:22:40,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2023-08-27 10:22:40,783 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2023-08-27 10:22:40,783 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 107 flow [2023-08-27 10:22:40,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:40,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:22:40,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 10:22:40,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:22:40,784 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:22:40,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:22:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1257725, now seen corresponding path program 1 times [2023-08-27 10:22:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:22:40,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295297703] [2023-08-27 10:22:40,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:22:40,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:22:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:22:40,831 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 10:22:40,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:22:40,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295297703] [2023-08-27 10:22:40,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295297703] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:22:40,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:22:40,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:22:40,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126628597] [2023-08-27 10:22:40,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:22:40,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:22:40,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:22:40,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:22:40,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:22:40,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 575 [2023-08-27 10:22:40,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:40,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:22:40,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 575 [2023-08-27 10:22:40,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:22:40,933 INFO L124 PetriNetUnfolderBase]: 303/607 cut-off events. [2023-08-27 10:22:40,933 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 10:22:40,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 607 events. 303/607 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2677 event pairs, 230 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 1221. Up to 605 conditions per place. [2023-08-27 10:22:40,936 INFO L140 encePairwiseOnDemand]: 573/575 looper letters, 41 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-27 10:22:40,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 187 flow [2023-08-27 10:22:40,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:22:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:22:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 786 transitions. [2023-08-27 10:22:40,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45565217391304347 [2023-08-27 10:22:40,939 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 786 transitions. [2023-08-27 10:22:40,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 786 transitions. [2023-08-27 10:22:40,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:22:40,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 786 transitions. [2023-08-27 10:22:40,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:40,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 575.0) internal successors, (2300), 4 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 10:22:40,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 575.0) internal successors, (2300), 4 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 10:22:40,946 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 107 flow. Second operand 3 states and 786 transitions. [2023-08-27 10:22:40,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 187 flow [2023-08-27 10:22:40,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 185 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:22:40,949 INFO L231 Difference]: Finished difference. Result has 43 places, 43 transitions, 103 flow [2023-08-27 10:22:40,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=43} [2023-08-27 10:22:40,950 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -4 predicate places. [2023-08-27 10:22:40,950 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 43 transitions, 103 flow [2023-08-27 10:22:40,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:40,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:22:40,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:22:40,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:22:40,955 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:22:40,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:22:40,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1208483140, now seen corresponding path program 1 times [2023-08-27 10:22:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:22:40,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359140263] [2023-08-27 10:22:40,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:22:40,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:22:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:22:41,034 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 10:22:41,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:22:41,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359140263] [2023-08-27 10:22:41,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359140263] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:22:41,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:22:41,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:22:41,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880426436] [2023-08-27 10:22:41,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:22:41,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:22:41,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:22:41,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:22:41,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:22:41,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 575 [2023-08-27 10:22:41,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 43 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:41,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:22:41,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 575 [2023-08-27 10:22:41,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:22:41,134 INFO L124 PetriNetUnfolderBase]: 152/305 cut-off events. [2023-08-27 10:22:41,134 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-27 10:22:41,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 305 events. 152/305 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1041 event pairs, 115 based on Foata normal form. 1/166 useless extension candidates. Maximal degree in co-relation 613. Up to 304 conditions per place. [2023-08-27 10:22:41,136 INFO L140 encePairwiseOnDemand]: 572/575 looper letters, 40 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-27 10:22:41,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 187 flow [2023-08-27 10:22:41,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:22:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:22:41,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 754 transitions. [2023-08-27 10:22:41,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4371014492753623 [2023-08-27 10:22:41,139 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 754 transitions. [2023-08-27 10:22:41,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 754 transitions. [2023-08-27 10:22:41,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:22:41,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 754 transitions. [2023-08-27 10:22:41,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:41,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 575.0) internal successors, (2300), 4 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 10:22:41,145 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 575.0) internal successors, (2300), 4 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 10:22:41,146 INFO L175 Difference]: Start difference. First operand has 43 places, 43 transitions, 103 flow. Second operand 3 states and 754 transitions. [2023-08-27 10:22:41,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 187 flow [2023-08-27 10:22:41,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 184 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 10:22:41,148 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 108 flow [2023-08-27 10:22:41,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-08-27 10:22:41,149 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2023-08-27 10:22:41,149 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 108 flow [2023-08-27 10:22:41,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:41,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:22:41,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:22:41,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:22:41,150 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:22:41,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:22:41,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1182323417, now seen corresponding path program 1 times [2023-08-27 10:22:41,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:22:41,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448577590] [2023-08-27 10:22:41,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:22:41,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:22:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:22:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 10:22:41,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:22:41,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448577590] [2023-08-27 10:22:41,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448577590] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:22:41,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:22:41,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:22:41,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033421127] [2023-08-27 10:22:41,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:22:41,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:22:41,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:22:41,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:22:41,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:22:41,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 575 [2023-08-27 10:22:41,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:41,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:22:41,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 575 [2023-08-27 10:22:41,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:22:41,373 INFO L124 PetriNetUnfolderBase]: 94/219 cut-off events. [2023-08-27 10:22:41,373 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-27 10:22:41,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455 conditions, 219 events. 94/219 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 810 event pairs, 23 based on Foata normal form. 1/152 useless extension candidates. Maximal degree in co-relation 443. Up to 110 conditions per place. [2023-08-27 10:22:41,375 INFO L140 encePairwiseOnDemand]: 568/575 looper letters, 62 selfloop transitions, 3 changer transitions 3/69 dead transitions. [2023-08-27 10:22:41,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 69 transitions, 296 flow [2023-08-27 10:22:41,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:22:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:22:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 786 transitions. [2023-08-27 10:22:41,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45565217391304347 [2023-08-27 10:22:41,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 786 transitions. [2023-08-27 10:22:41,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 786 transitions. [2023-08-27 10:22:41,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:22:41,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 786 transitions. [2023-08-27 10:22:41,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:41,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 575.0) internal successors, (2300), 4 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 10:22:41,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 575.0) internal successors, (2300), 4 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 10:22:41,385 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 108 flow. Second operand 3 states and 786 transitions. [2023-08-27 10:22:41,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 69 transitions, 296 flow [2023-08-27 10:22:41,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 69 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:22:41,388 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 95 flow [2023-08-27 10:22:41,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-08-27 10:22:41,388 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -6 predicate places. [2023-08-27 10:22:41,389 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 95 flow [2023-08-27 10:22:41,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:41,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:22:41,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:22:41,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:22:41,390 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONASSERT === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:22:41,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:22:41,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1512072471, now seen corresponding path program 1 times [2023-08-27 10:22:41,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:22:41,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367555606] [2023-08-27 10:22:41,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:22:41,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:22:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:22:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 10:22:41,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:22:41,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367555606] [2023-08-27 10:22:41,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367555606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:22:41,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:22:41,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:22:41,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857725854] [2023-08-27 10:22:41,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:22:41,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:22:41,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:22:41,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:22:41,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:22:41,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 575 [2023-08-27 10:22:41,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:41,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:22:41,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 575 [2023-08-27 10:22:41,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:22:41,584 INFO L124 PetriNetUnfolderBase]: 136/278 cut-off events. [2023-08-27 10:22:41,584 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2023-08-27 10:22:41,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 278 events. 136/278 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 831 event pairs, 66 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 628. Up to 184 conditions per place. [2023-08-27 10:22:41,586 INFO L140 encePairwiseOnDemand]: 571/575 looper letters, 50 selfloop transitions, 3 changer transitions 0/54 dead transitions. [2023-08-27 10:22:41,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 239 flow [2023-08-27 10:22:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:22:41,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:22:41,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 812 transitions. [2023-08-27 10:22:41,589 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707246376811594 [2023-08-27 10:22:41,589 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 812 transitions. [2023-08-27 10:22:41,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 812 transitions. [2023-08-27 10:22:41,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:22:41,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 812 transitions. [2023-08-27 10:22:41,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:41,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 575.0) internal successors, (2300), 4 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 10:22:41,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 575.0) internal successors, (2300), 4 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 10:22:41,596 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 95 flow. Second operand 3 states and 812 transitions. [2023-08-27 10:22:41,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 239 flow [2023-08-27 10:22:41,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:22:41,598 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 118 flow [2023-08-27 10:22:41,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2023-08-27 10:22:41,602 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -5 predicate places. [2023-08-27 10:22:41,602 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 118 flow [2023-08-27 10:22:41,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:41,603 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:22:41,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:22:41,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:22:41,604 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:22:41,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:22:41,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1938015318, now seen corresponding path program 1 times [2023-08-27 10:22:41,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:22:41,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465185715] [2023-08-27 10:22:41,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:22:41,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:22:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:22:41,765 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 10:22:41,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:22:41,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465185715] [2023-08-27 10:22:41,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465185715] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 10:22:41,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558701274] [2023-08-27 10:22:41,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:22:41,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 10:22:41,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:22:41,773 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 10:22:41,802 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 10:22:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:22:41,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-27 10:22:41,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 10:22:41,995 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 10:22:41,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 10:22:42,015 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 10:22:42,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558701274] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 10:22:42,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 10:22:42,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-08-27 10:22:42,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059946895] [2023-08-27 10:22:42,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 10:22:42,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:22:42,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:22:42,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:22:42,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:22:42,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 575 [2023-08-27 10:22:42,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 118 flow. Second operand has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:42,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:22:42,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 575 [2023-08-27 10:22:42,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:22:42,115 INFO L124 PetriNetUnfolderBase]: 136/278 cut-off events. [2023-08-27 10:22:42,115 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-08-27 10:22:42,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 278 events. 136/278 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 826 event pairs, 99 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 634. Up to 276 conditions per place. [2023-08-27 10:22:42,117 INFO L140 encePairwiseOnDemand]: 572/575 looper letters, 37 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2023-08-27 10:22:42,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 202 flow [2023-08-27 10:22:42,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:22:42,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:22:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 986 transitions. [2023-08-27 10:22:42,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42869565217391303 [2023-08-27 10:22:42,121 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 986 transitions. [2023-08-27 10:22:42,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 986 transitions. [2023-08-27 10:22:42,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:22:42,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 986 transitions. [2023-08-27 10:22:42,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 246.5) internal successors, (986), 4 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:42,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 575.0) internal successors, (2875), 5 states have internal predecessors, (2875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:42,127 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 575.0) internal successors, (2875), 5 states have internal predecessors, (2875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:42,128 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 118 flow. Second operand 4 states and 986 transitions. [2023-08-27 10:22:42,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 202 flow [2023-08-27 10:22:42,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 41 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:22:42,130 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 128 flow [2023-08-27 10:22:42,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2023-08-27 10:22:42,130 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-08-27 10:22:42,131 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 128 flow [2023-08-27 10:22:42,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:42,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:22:42,132 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:22:42,144 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 10:22:42,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 10:22:42,339 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:22:42,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:22:42,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1506329555, now seen corresponding path program 2 times [2023-08-27 10:22:42,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:22:42,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944235505] [2023-08-27 10:22:42,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:22:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:22:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:22:42,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 10:22:42,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:22:42,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944235505] [2023-08-27 10:22:42,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944235505] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:22:42,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:22:42,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:22:42,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536447793] [2023-08-27 10:22:42,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:22:42,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:22:42,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:22:42,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:22:42,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:22:42,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 575 [2023-08-27 10:22:42,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 128 flow. Second operand has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:42,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:22:42,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 575 [2023-08-27 10:22:42,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:22:43,206 INFO L124 PetriNetUnfolderBase]: 156/338 cut-off events. [2023-08-27 10:22:43,206 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-08-27 10:22:43,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 338 events. 156/338 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1214 event pairs, 39 based on Foata normal form. 8/304 useless extension candidates. Maximal degree in co-relation 758. Up to 190 conditions per place. [2023-08-27 10:22:43,208 INFO L140 encePairwiseOnDemand]: 563/575 looper letters, 53 selfloop transitions, 20 changer transitions 0/74 dead transitions. [2023-08-27 10:22:43,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 360 flow [2023-08-27 10:22:43,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:22:43,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:22:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1701 transitions. [2023-08-27 10:22:43,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36978260869565216 [2023-08-27 10:22:43,213 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1701 transitions. [2023-08-27 10:22:43,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1701 transitions. [2023-08-27 10:22:43,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:22:43,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1701 transitions. [2023-08-27 10:22:43,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 212.625) internal successors, (1701), 8 states have internal predecessors, (1701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:43,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 575.0) internal successors, (5175), 9 states have internal predecessors, (5175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:43,223 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 575.0) internal successors, (5175), 9 states have internal predecessors, (5175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:43,224 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 128 flow. Second operand 8 states and 1701 transitions. [2023-08-27 10:22:43,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 360 flow [2023-08-27 10:22:43,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 352 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-27 10:22:43,228 INFO L231 Difference]: Finished difference. Result has 54 places, 58 transitions, 256 flow [2023-08-27 10:22:43,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=256, PETRI_PLACES=54, PETRI_TRANSITIONS=58} [2023-08-27 10:22:43,230 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-08-27 10:22:43,231 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 58 transitions, 256 flow [2023-08-27 10:22:43,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:43,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:22:43,232 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:22:43,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:22:43,232 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:22:43,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:22:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1506329554, now seen corresponding path program 1 times [2023-08-27 10:22:43,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:22:43,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620071958] [2023-08-27 10:22:43,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:22:43,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:22:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:22:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 10:22:43,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:22:43,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620071958] [2023-08-27 10:22:43,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620071958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:22:43,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:22:43,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:22:43,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531867556] [2023-08-27 10:22:43,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:22:43,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:22:43,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:22:43,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:22:43,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:22:43,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 575 [2023-08-27 10:22:43,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 58 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 206.33333333333334) internal successors, (1238), 6 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:43,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:22:43,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 575 [2023-08-27 10:22:43,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:22:43,920 INFO L124 PetriNetUnfolderBase]: 206/437 cut-off events. [2023-08-27 10:22:43,920 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2023-08-27 10:22:43,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 437 events. 206/437 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1685 event pairs, 27 based on Foata normal form. 8/421 useless extension candidates. Maximal degree in co-relation 1295. Up to 168 conditions per place. [2023-08-27 10:22:43,923 INFO L140 encePairwiseOnDemand]: 564/575 looper letters, 71 selfloop transitions, 33 changer transitions 0/105 dead transitions. [2023-08-27 10:22:43,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 105 transitions, 647 flow [2023-08-27 10:22:43,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:22:43,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:22:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1720 transitions. [2023-08-27 10:22:43,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3739130434782609 [2023-08-27 10:22:43,929 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1720 transitions. [2023-08-27 10:22:43,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1720 transitions. [2023-08-27 10:22:43,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:22:43,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1720 transitions. [2023-08-27 10:22:43,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 215.0) internal successors, (1720), 8 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:43,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 575.0) internal successors, (5175), 9 states have internal predecessors, (5175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:43,939 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 575.0) internal successors, (5175), 9 states have internal predecessors, (5175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:43,939 INFO L175 Difference]: Start difference. First operand has 54 places, 58 transitions, 256 flow. Second operand 8 states and 1720 transitions. [2023-08-27 10:22:43,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 105 transitions, 647 flow [2023-08-27 10:22:43,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 105 transitions, 647 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:22:43,944 INFO L231 Difference]: Finished difference. Result has 64 places, 77 transitions, 459 flow [2023-08-27 10:22:43,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=459, PETRI_PLACES=64, PETRI_TRANSITIONS=77} [2023-08-27 10:22:43,945 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2023-08-27 10:22:43,950 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 77 transitions, 459 flow [2023-08-27 10:22:43,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.33333333333334) internal successors, (1238), 6 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:43,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:22:43,951 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:22:43,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:22:43,951 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:22:43,952 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:22:43,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1993358133, now seen corresponding path program 1 times [2023-08-27 10:22:43,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:22:43,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369854011] [2023-08-27 10:22:43,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:22:43,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:22:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:22:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 10:22:44,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:22:44,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369854011] [2023-08-27 10:22:44,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369854011] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:22:44,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:22:44,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-27 10:22:44,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928032251] [2023-08-27 10:22:44,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:22:44,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-27 10:22:44,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:22:44,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-27 10:22:44,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-08-27 10:22:44,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 575 [2023-08-27 10:22:44,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 77 transitions, 459 flow. Second operand has 10 states, 10 states have (on average 192.6) internal successors, (1926), 10 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:44,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:22:44,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 575 [2023-08-27 10:22:44,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:22:44,900 INFO L124 PetriNetUnfolderBase]: 219/486 cut-off events. [2023-08-27 10:22:44,900 INFO L125 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2023-08-27 10:22:44,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1715 conditions, 486 events. 219/486 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2088 event pairs, 30 based on Foata normal form. 7/474 useless extension candidates. Maximal degree in co-relation 1690. Up to 176 conditions per place. [2023-08-27 10:22:44,904 INFO L140 encePairwiseOnDemand]: 564/575 looper letters, 67 selfloop transitions, 35 changer transitions 0/103 dead transitions. [2023-08-27 10:22:44,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 103 transitions, 778 flow [2023-08-27 10:22:44,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:22:44,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:22:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1784 transitions. [2023-08-27 10:22:44,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3447342995169082 [2023-08-27 10:22:44,910 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1784 transitions. [2023-08-27 10:22:44,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1784 transitions. [2023-08-27 10:22:44,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:22:44,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1784 transitions. [2023-08-27 10:22:44,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.22222222222223) internal successors, (1784), 9 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:44,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 575.0) internal successors, (5750), 10 states have internal predecessors, (5750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:44,936 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 575.0) internal successors, (5750), 10 states have internal predecessors, (5750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:44,936 INFO L175 Difference]: Start difference. First operand has 64 places, 77 transitions, 459 flow. Second operand 9 states and 1784 transitions. [2023-08-27 10:22:44,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 103 transitions, 778 flow [2023-08-27 10:22:44,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 103 transitions, 778 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:22:44,941 INFO L231 Difference]: Finished difference. Result has 75 places, 84 transitions, 620 flow [2023-08-27 10:22:44,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=620, PETRI_PLACES=75, PETRI_TRANSITIONS=84} [2023-08-27 10:22:44,942 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 28 predicate places. [2023-08-27 10:22:44,942 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 84 transitions, 620 flow [2023-08-27 10:22:44,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 192.6) internal successors, (1926), 10 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:22:44,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:22:44,944 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:22:44,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:22:44,944 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:22:44,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:22:44,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1992967533, now seen corresponding path program 2 times [2023-08-27 10:22:44,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:22:44,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208149656] [2023-08-27 10:22:44,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:22:44,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:22:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:22:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 10:22:45,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:22:45,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208149656] [2023-08-27 10:22:45,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208149656] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 10:22:45,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175048187] [2023-08-27 10:22:45,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 10:22:45,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 10:22:45,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:22:45,569 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 10:22:45,597 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 10:22:45,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 10:22:45,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 10:22:45,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 113 conjunts are in the unsatisfiable core [2023-08-27 10:22:45,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 10:22:45,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:22:45,781 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-08-27 10:22:45,823 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-27 10:22:45,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:22:45,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:22:45,875 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-27 10:22:45,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-27 10:22:45,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:22:45,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-27 10:22:46,111 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-08-27 10:22:46,111 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 35 [2023-08-27 10:22:46,171 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-27 10:22:46,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:22:46,208 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 10:22:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:22:46,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 10:22:56,034 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_213 Int) (v_ArrVal_215 (Array Int Int)) (v_ArrVal_212 Int) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_43| Int) (v_ArrVal_210 (Array Int Int)) (v_ArrVal_208 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_~#stack~0.base| (store (select |c_#memory_int| |c_~#stack~0.base|) (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) (- 4) |c_~#stack~0.offset|) v_ArrVal_208)) |c_~#threads~0.base| v_ArrVal_210))) (let ((.cse0 (select .cse2 |c_~#stack~0.base|)) (.cse1 (+ |c_~#stack~0.offset| 24))) (or (< (+ |c_~#stack~0.offset| (* 8 (select .cse0 .cse1)) 4) |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_43|) (< 0 (+ (select (select (store (store .cse2 |c_~#stack~0.base| (store (store .cse0 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_43| v_ArrVal_212) .cse1 v_ArrVal_213)) |c_~#threads~0.base| v_ArrVal_215) |c_~#stack~0.base|) (+ |c_~#stack~0.offset| 28)) 2147483648)))))) is different from false [2023-08-27 10:22:56,061 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_213 Int) (v_ArrVal_215 (Array Int Int)) (v_ArrVal_212 Int) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_43| Int) (|v_ULTIMATE.start_atomic_store_~obj#1.offset_86| Int) (v_ArrVal_210 (Array Int Int)) (v_ArrVal_208 Int) (v_ArrVal_206 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_~#stack~0.base| (store (store (select |c_#memory_int| |c_~#stack~0.base|) |v_ULTIMATE.start_atomic_store_~obj#1.offset_86| v_ArrVal_206) (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) (- 4) |c_~#stack~0.offset|) v_ArrVal_208)) |c_~#threads~0.base| v_ArrVal_210))) (let ((.cse0 (select .cse2 |c_~#stack~0.base|)) (.cse1 (+ |c_~#stack~0.offset| 24))) (or (< (+ |c_~#stack~0.offset| 4 (* |c_ULTIMATE.start_Init_~i~0#1| 8)) |v_ULTIMATE.start_atomic_store_~obj#1.offset_86|) (< (+ |c_~#stack~0.offset| (* (select .cse0 .cse1) 8) 4) |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_43|) (< 0 (+ (select (select (store (store .cse2 |c_~#stack~0.base| (store (store .cse0 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_43| v_ArrVal_212) .cse1 v_ArrVal_213)) |c_~#threads~0.base| v_ArrVal_215) |c_~#stack~0.base|) (+ |c_~#stack~0.offset| 28)) 2147483648)))))) is different from false [2023-08-27 10:23:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-27 10:23:01,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175048187] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 10:23:01,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 10:23:01,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 28 [2023-08-27 10:23:01,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320709978] [2023-08-27 10:23:01,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 10:23:01,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-27 10:23:01,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:23:01,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-27 10:23:01,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=604, Unknown=20, NotChecked=106, Total=870 [2023-08-27 10:23:01,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 575 [2023-08-27 10:23:01,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 84 transitions, 620 flow. Second operand has 30 states, 30 states have (on average 164.66666666666666) internal successors, (4940), 30 states have internal predecessors, (4940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:23:01,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:23:01,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 575 [2023-08-27 10:23:01,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:23:15,716 INFO L124 PetriNetUnfolderBase]: 335/812 cut-off events. [2023-08-27 10:23:15,717 INFO L125 PetriNetUnfolderBase]: For 1174/1174 co-relation queries the response was YES. [2023-08-27 10:23:15,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3335 conditions, 812 events. 335/812 cut-off events. For 1174/1174 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4215 event pairs, 19 based on Foata normal form. 25/814 useless extension candidates. Maximal degree in co-relation 3305. Up to 131 conditions per place. [2023-08-27 10:23:15,724 INFO L140 encePairwiseOnDemand]: 556/575 looper letters, 150 selfloop transitions, 163 changer transitions 0/314 dead transitions. [2023-08-27 10:23:15,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 314 transitions, 2811 flow [2023-08-27 10:23:15,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-08-27 10:23:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-08-27 10:23:15,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 8225 transitions. [2023-08-27 10:23:15,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2919254658385093 [2023-08-27 10:23:15,746 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 8225 transitions. [2023-08-27 10:23:15,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 8225 transitions. [2023-08-27 10:23:15,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:23:15,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 8225 transitions. [2023-08-27 10:23:15,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 167.85714285714286) internal successors, (8225), 49 states have internal predecessors, (8225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:23:15,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 575.0) internal successors, (28750), 50 states have internal predecessors, (28750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:23:15,844 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 575.0) internal successors, (28750), 50 states have internal predecessors, (28750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:23:15,844 INFO L175 Difference]: Start difference. First operand has 75 places, 84 transitions, 620 flow. Second operand 49 states and 8225 transitions. [2023-08-27 10:23:15,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 314 transitions, 2811 flow [2023-08-27 10:23:15,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 314 transitions, 2749 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-27 10:23:15,860 INFO L231 Difference]: Finished difference. Result has 129 places, 227 transitions, 2218 flow [2023-08-27 10:23:15,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=2218, PETRI_PLACES=129, PETRI_TRANSITIONS=227} [2023-08-27 10:23:15,860 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 82 predicate places. [2023-08-27 10:23:15,860 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 227 transitions, 2218 flow [2023-08-27 10:23:15,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 164.66666666666666) internal successors, (4940), 30 states have internal predecessors, (4940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:23:15,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:23:15,862 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:23:15,871 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 10:23:16,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-27 10:23:16,068 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:23:16,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:23:16,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1772059724, now seen corresponding path program 1 times [2023-08-27 10:23:16,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:23:16,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704541503] [2023-08-27 10:23:16,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:23:16,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:23:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:23:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 10:23:16,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:23:16,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704541503] [2023-08-27 10:23:16,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704541503] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:23:16,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:23:16,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:23:16,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987517997] [2023-08-27 10:23:16,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:23:16,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:23:16,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:23:16,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:23:16,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:23:16,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 575 [2023-08-27 10:23:16,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 227 transitions, 2218 flow. Second operand has 9 states, 9 states have (on average 192.77777777777777) internal successors, (1735), 9 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:23:16,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:23:16,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 575 [2023-08-27 10:23:16,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:23:17,317 INFO L124 PetriNetUnfolderBase]: 344/843 cut-off events. [2023-08-27 10:23:17,317 INFO L125 PetriNetUnfolderBase]: For 2398/2398 co-relation queries the response was YES. [2023-08-27 10:23:17,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4292 conditions, 843 events. 344/843 cut-off events. For 2398/2398 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4474 event pairs, 33 based on Foata normal form. 3/823 useless extension candidates. Maximal degree in co-relation 4252. Up to 199 conditions per place. [2023-08-27 10:23:17,326 INFO L140 encePairwiseOnDemand]: 564/575 looper letters, 142 selfloop transitions, 137 changer transitions 0/280 dead transitions. [2023-08-27 10:23:17,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 280 transitions, 3243 flow [2023-08-27 10:23:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 10:23:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 10:23:17,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2000 transitions. [2023-08-27 10:23:17,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2023-08-27 10:23:17,331 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2000 transitions. [2023-08-27 10:23:17,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2000 transitions. [2023-08-27 10:23:17,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:23:17,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2000 transitions. [2023-08-27 10:23:17,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:23:17,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 575.0) internal successors, (6325), 11 states have internal predecessors, (6325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:23:17,341 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 575.0) internal successors, (6325), 11 states have internal predecessors, (6325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:23:17,341 INFO L175 Difference]: Start difference. First operand has 129 places, 227 transitions, 2218 flow. Second operand 10 states and 2000 transitions. [2023-08-27 10:23:17,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 280 transitions, 3243 flow [2023-08-27 10:23:17,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 280 transitions, 3208 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-08-27 10:23:17,362 INFO L231 Difference]: Finished difference. Result has 136 places, 245 transitions, 2831 flow [2023-08-27 10:23:17,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=2183, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2831, PETRI_PLACES=136, PETRI_TRANSITIONS=245} [2023-08-27 10:23:17,363 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 89 predicate places. [2023-08-27 10:23:17,363 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 245 transitions, 2831 flow [2023-08-27 10:23:17,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 192.77777777777777) internal successors, (1735), 9 states have internal predecessors, (1735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:23:17,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:23:17,364 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:23:17,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:23:17,364 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:23:17,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:23:17,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2057802594, now seen corresponding path program 2 times [2023-08-27 10:23:17,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:23:17,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394743633] [2023-08-27 10:23:17,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:23:17,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:23:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:23:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 10:23:17,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:23:17,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394743633] [2023-08-27 10:23:17,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394743633] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 10:23:17,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024413905] [2023-08-27 10:23:17,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 10:23:17,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 10:23:17,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:23:17,977 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 10:23:18,006 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 10:23:18,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 10:23:18,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 10:23:18,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 112 conjunts are in the unsatisfiable core [2023-08-27 10:23:18,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 10:23:18,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:23:18,181 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-08-27 10:23:18,239 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-27 10:23:18,296 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-27 10:23:18,356 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-27 10:23:18,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:23:18,393 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-27 10:23:18,577 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-08-27 10:23:18,578 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 35 [2023-08-27 10:23:18,651 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-08-27 10:23:18,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:23:18,696 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 10:23:18,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:23:18,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 10:23:33,533 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_297 Int) (v_ArrVal_294 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_45| Int) (v_ArrVal_295 Int) (v_ArrVal_293 Int) (v_ArrVal_299 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_~#stack~0.base| (store (select |c_#memory_int| |c_~#stack~0.base|) (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) (- 4) |c_~#stack~0.offset|) v_ArrVal_293)) |c_~#threads~0.base| v_ArrVal_294))) (let ((.cse0 (select .cse2 |c_~#stack~0.base|)) (.cse1 (+ |c_~#stack~0.offset| 24))) (or (< (+ (* (select .cse0 .cse1) 8) |c_~#stack~0.offset| 4) |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_45|) (< (select (select (store (store .cse2 |c_~#stack~0.base| (store (store .cse0 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_45| v_ArrVal_295) .cse1 v_ArrVal_297)) |c_~#threads~0.base| v_ArrVal_299) |c_~#stack~0.base|) (+ |c_~#stack~0.offset| 28)) 2147483649))))) is different from false [2023-08-27 10:23:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-27 10:23:47,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024413905] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 10:23:47,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 10:23:47,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 10] total 25 [2023-08-27 10:23:47,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674871378] [2023-08-27 10:23:47,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 10:23:47,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-27 10:23:47,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:23:47,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-27 10:23:47,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=496, Unknown=40, NotChecked=48, Total=702 [2023-08-27 10:23:47,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 575 [2023-08-27 10:23:47,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 245 transitions, 2831 flow. Second operand has 27 states, 27 states have (on average 184.85185185185185) internal successors, (4991), 27 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:23:47,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:23:47,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 575 [2023-08-27 10:23:47,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:23:51,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:23:56,249 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#stack~0.base|)) (.cse2 (+ |c_~#stack~0.offset| 24)) (.cse0 (+ |c_~#stack~0.offset| 28))) (and (not (= |c_ULTIMATE.start_Init_~pushCount#1| 4)) (not (= |c_threadThread1of1ForFork0_atomic_compare_and_exchange_#in~obj#1.offset| .cse0)) (not (= |c_~#threads~0.base| |c_~#stack~0.base|)) (<= (select (select |c_#memory_int| |c_threadThread1of1ForFork0_atomic_compare_and_exchange_#in~obj#1.base|) .cse0) 2147483647) (forall ((v_ArrVal_297 Int) (v_ArrVal_294 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_45| Int) (v_ArrVal_295 Int) (v_ArrVal_293 Int) (v_ArrVal_290 Int) (v_ArrVal_299 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_~#stack~0.base| (store (store .cse4 (+ |c_~#stack~0.offset| 4 (* |c_ULTIMATE.start_Init_~i~0#1| 8)) v_ArrVal_290) (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) (- 4) |c_~#stack~0.offset|) v_ArrVal_293)) |c_~#threads~0.base| v_ArrVal_294))) (let ((.cse1 (select .cse3 |c_~#stack~0.base|))) (or (< (+ (* (select .cse1 .cse2) 8) |c_~#stack~0.offset| 4) |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_45|) (< (select (select (store (store .cse3 |c_~#stack~0.base| (store (store .cse1 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_45| v_ArrVal_295) .cse2 v_ArrVal_297)) |c_~#threads~0.base| v_ArrVal_299) |c_~#stack~0.base|) .cse0) 2147483649))))) (forall ((v_ArrVal_297 Int) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_45| Int) (v_ArrVal_295 Int) (v_ArrVal_299 (Array Int Int))) (or (< (+ |c_~#stack~0.offset| (* |c_threadThread1of1ForFork0_atomic_load_#res#1| 8) 4) |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_45|) (< (select (select (store (store |c_#memory_int| |c_~#stack~0.base| (store (store .cse4 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_45| v_ArrVal_295) .cse2 v_ArrVal_297)) |c_~#threads~0.base| v_ArrVal_299) |c_~#stack~0.base|) .cse0) 2147483649))) (= |c_threadThread1of1ForFork0_atomic_compare_and_exchange_#in~obj#1.base| |c_~#stack~0.base|) (forall ((v_ArrVal_297 Int) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_45| Int) (v_ArrVal_295 Int) (v_ArrVal_299 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_~#stack~0.base| (store (store .cse4 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_45| v_ArrVal_295) .cse2 v_ArrVal_297)) |c_~#threads~0.base| v_ArrVal_299) |c_~#stack~0.base|) .cse0) 2147483649) (< (+ (* 8 (select .cse4 .cse2)) |c_~#stack~0.offset| 4) |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_45|))) (not (= |c_~#threads~0.base| |c_threadThread1of1ForFork0_atomic_compare_and_exchange_#in~obj#1.base|)) (forall ((v_ArrVal_297 Int) (v_ArrVal_294 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_45| Int) (v_ArrVal_295 Int) (v_ArrVal_299 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#threads~0.base| v_ArrVal_294))) (let ((.cse5 (select .cse6 |c_~#stack~0.base|))) (or (< (+ |c_~#stack~0.offset| 4 (* (select .cse5 .cse2) 8)) |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_45|) (< (select (select (store (store .cse6 |c_~#stack~0.base| (store (store .cse5 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_45| v_ArrVal_295) .cse2 v_ArrVal_297)) |c_~#threads~0.base| v_ArrVal_299) |c_~#stack~0.base|) .cse0) 2147483649))))))) is different from false [2023-08-27 10:24:21,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 [1] [2023-08-27 10:24:33,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:24:35,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:24:59,620 INFO L124 PetriNetUnfolderBase]: 755/1858 cut-off events. [2023-08-27 10:24:59,620 INFO L125 PetriNetUnfolderBase]: For 7364/7364 co-relation queries the response was YES. [2023-08-27 10:24:59,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10161 conditions, 1858 events. 755/1858 cut-off events. For 7364/7364 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 12676 event pairs, 77 based on Foata normal form. 6/1809 useless extension candidates. Maximal degree in co-relation 10120. Up to 538 conditions per place. [2023-08-27 10:24:59,633 INFO L140 encePairwiseOnDemand]: 558/575 looper letters, 382 selfloop transitions, 212 changer transitions 0/595 dead transitions. [2023-08-27 10:24:59,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 595 transitions, 7696 flow [2023-08-27 10:24:59,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-08-27 10:24:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-08-27 10:24:59,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 5895 transitions. [2023-08-27 10:24:59,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33071528751753154 [2023-08-27 10:24:59,641 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 5895 transitions. [2023-08-27 10:24:59,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 5895 transitions. [2023-08-27 10:24:59,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:24:59,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 5895 transitions. [2023-08-27 10:24:59,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 190.16129032258064) internal successors, (5895), 31 states have internal predecessors, (5895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:24:59,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 575.0) internal successors, (18400), 32 states have internal predecessors, (18400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:24:59,667 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 575.0) internal successors, (18400), 32 states have internal predecessors, (18400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:24:59,668 INFO L175 Difference]: Start difference. First operand has 136 places, 245 transitions, 2831 flow. Second operand 31 states and 5895 transitions. [2023-08-27 10:24:59,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 595 transitions, 7696 flow [2023-08-27 10:24:59,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 595 transitions, 7685 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-27 10:24:59,717 INFO L231 Difference]: Finished difference. Result has 173 places, 389 transitions, 5702 flow [2023-08-27 10:24:59,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=2824, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=5702, PETRI_PLACES=173, PETRI_TRANSITIONS=389} [2023-08-27 10:24:59,717 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 126 predicate places. [2023-08-27 10:24:59,717 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 389 transitions, 5702 flow [2023-08-27 10:24:59,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 184.85185185185185) internal successors, (4991), 27 states have internal predecessors, (4991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:24:59,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:24:59,719 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:24:59,727 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 10:24:59,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 10:24:59,928 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting threadErr2ASSERT_VIOLATIONASSERT === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:24:59,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:24:59,928 INFO L85 PathProgramCache]: Analyzing trace with hash 178835085, now seen corresponding path program 1 times [2023-08-27 10:24:59,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:24:59,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176740900] [2023-08-27 10:24:59,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:24:59,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:24:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:25:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 10:25:00,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:25:00,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176740900] [2023-08-27 10:25:00,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176740900] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:25:00,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:25:00,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:25:00,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003468544] [2023-08-27 10:25:00,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:25:00,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:25:00,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:25:00,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:25:00,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:25:00,059 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 575 [2023-08-27 10:25:00,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 389 transitions, 5702 flow. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:00,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:25:00,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 575 [2023-08-27 10:25:00,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:25:00,529 INFO L124 PetriNetUnfolderBase]: 744/1869 cut-off events. [2023-08-27 10:25:00,530 INFO L125 PetriNetUnfolderBase]: For 10400/10400 co-relation queries the response was YES. [2023-08-27 10:25:00,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11190 conditions, 1869 events. 744/1869 cut-off events. For 10400/10400 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 13142 event pairs, 74 based on Foata normal form. 0/1832 useless extension candidates. Maximal degree in co-relation 11140. Up to 1599 conditions per place. [2023-08-27 10:25:00,550 INFO L140 encePairwiseOnDemand]: 570/575 looper letters, 366 selfloop transitions, 32 changer transitions 0/399 dead transitions. [2023-08-27 10:25:00,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 399 transitions, 6579 flow [2023-08-27 10:25:00,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:25:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:25:00,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2023-08-27 10:25:00,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3884057971014493 [2023-08-27 10:25:00,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 670 transitions. [2023-08-27 10:25:00,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 670 transitions. [2023-08-27 10:25:00,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:25:00,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 670 transitions. [2023-08-27 10:25:00,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:00,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 575.0) internal successors, (2300), 4 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 10:25:00,555 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 575.0) internal successors, (2300), 4 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 10:25:00,555 INFO L175 Difference]: Start difference. First operand has 173 places, 389 transitions, 5702 flow. Second operand 3 states and 670 transitions. [2023-08-27 10:25:00,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 399 transitions, 6579 flow [2023-08-27 10:25:00,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 399 transitions, 6413 flow, removed 9 selfloop flow, removed 8 redundant places. [2023-08-27 10:25:00,624 INFO L231 Difference]: Finished difference. Result has 169 places, 394 transitions, 5727 flow [2023-08-27 10:25:00,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=5538, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5727, PETRI_PLACES=169, PETRI_TRANSITIONS=394} [2023-08-27 10:25:00,625 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 122 predicate places. [2023-08-27 10:25:00,625 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 394 transitions, 5727 flow [2023-08-27 10:25:00,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:00,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:25:00,626 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:25:00,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:25:00,626 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr2ASSERT_VIOLATIONASSERT === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:25:00,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:25:00,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1864209857, now seen corresponding path program 1 times [2023-08-27 10:25:00,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:25:00,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206991324] [2023-08-27 10:25:00,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:25:00,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:25:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:25:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 10:25:00,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:25:00,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206991324] [2023-08-27 10:25:00,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206991324] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:25:00,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:25:00,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:25:00,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85725131] [2023-08-27 10:25:00,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:25:00,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:25:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:25:00,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:25:00,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:25:00,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 575 [2023-08-27 10:25:00,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 394 transitions, 5727 flow. Second operand has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:00,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:25:00,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 575 [2023-08-27 10:25:00,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:25:01,367 INFO L124 PetriNetUnfolderBase]: 744/1855 cut-off events. [2023-08-27 10:25:01,367 INFO L125 PetriNetUnfolderBase]: For 10391/10391 co-relation queries the response was YES. [2023-08-27 10:25:01,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11177 conditions, 1855 events. 744/1855 cut-off events. For 10391/10391 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12907 event pairs, 87 based on Foata normal form. 4/1826 useless extension candidates. Maximal degree in co-relation 11126. Up to 1562 conditions per place. [2023-08-27 10:25:01,393 INFO L140 encePairwiseOnDemand]: 571/575 looper letters, 359 selfloop transitions, 35 changer transitions 0/395 dead transitions. [2023-08-27 10:25:01,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 395 transitions, 6526 flow [2023-08-27 10:25:01,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:25:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:25:01,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 823 transitions. [2023-08-27 10:25:01,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35782608695652174 [2023-08-27 10:25:01,395 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 823 transitions. [2023-08-27 10:25:01,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 823 transitions. [2023-08-27 10:25:01,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:25:01,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 823 transitions. [2023-08-27 10:25:01,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 205.75) internal successors, (823), 4 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:01,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 575.0) internal successors, (2875), 5 states have internal predecessors, (2875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:01,399 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 575.0) internal successors, (2875), 5 states have internal predecessors, (2875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:01,399 INFO L175 Difference]: Start difference. First operand has 169 places, 394 transitions, 5727 flow. Second operand 4 states and 823 transitions. [2023-08-27 10:25:01,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 395 transitions, 6526 flow [2023-08-27 10:25:01,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 395 transitions, 6460 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-27 10:25:01,461 INFO L231 Difference]: Finished difference. Result has 169 places, 393 transitions, 5727 flow [2023-08-27 10:25:01,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=5657, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=5727, PETRI_PLACES=169, PETRI_TRANSITIONS=393} [2023-08-27 10:25:01,462 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 122 predicate places. [2023-08-27 10:25:01,462 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 393 transitions, 5727 flow [2023-08-27 10:25:01,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 199.0) internal successors, (1194), 6 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:01,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:25:01,462 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:25:01,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:25:01,463 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:25:01,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:25:01,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1244120808, now seen corresponding path program 1 times [2023-08-27 10:25:01,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:25:01,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460555370] [2023-08-27 10:25:01,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:25:01,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:25:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:25:01,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 10:25:01,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:25:01,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460555370] [2023-08-27 10:25:01,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460555370] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:25:01,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:25:01,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:25:01,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821153143] [2023-08-27 10:25:01,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:25:01,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:25:01,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:25:01,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:25:01,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:25:01,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 575 [2023-08-27 10:25:01,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 393 transitions, 5727 flow. Second operand has 5 states, 5 states have (on average 198.4) internal successors, (992), 5 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:01,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:25:01,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 575 [2023-08-27 10:25:01,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:25:02,218 INFO L124 PetriNetUnfolderBase]: 316/880 cut-off events. [2023-08-27 10:25:02,218 INFO L125 PetriNetUnfolderBase]: For 5145/5145 co-relation queries the response was YES. [2023-08-27 10:25:02,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5250 conditions, 880 events. 316/880 cut-off events. For 5145/5145 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5096 event pairs, 28 based on Foata normal form. 33/898 useless extension candidates. Maximal degree in co-relation 5209. Up to 536 conditions per place. [2023-08-27 10:25:02,225 INFO L140 encePairwiseOnDemand]: 566/575 looper letters, 157 selfloop transitions, 131 changer transitions 0/289 dead transitions. [2023-08-27 10:25:02,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 289 transitions, 4269 flow [2023-08-27 10:25:02,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:25:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:25:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1020 transitions. [2023-08-27 10:25:02,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35478260869565215 [2023-08-27 10:25:02,227 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1020 transitions. [2023-08-27 10:25:02,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1020 transitions. [2023-08-27 10:25:02,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:25:02,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1020 transitions. [2023-08-27 10:25:02,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 204.0) internal successors, (1020), 5 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:02,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 575.0) internal successors, (3450), 6 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:02,232 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 575.0) internal successors, (3450), 6 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:02,232 INFO L175 Difference]: Start difference. First operand has 169 places, 393 transitions, 5727 flow. Second operand 5 states and 1020 transitions. [2023-08-27 10:25:02,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 289 transitions, 4269 flow [2023-08-27 10:25:02,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 289 transitions, 4129 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-08-27 10:25:02,263 INFO L231 Difference]: Finished difference. Result has 158 places, 279 transitions, 3964 flow [2023-08-27 10:25:02,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=3231, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3964, PETRI_PLACES=158, PETRI_TRANSITIONS=279} [2023-08-27 10:25:02,265 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 111 predicate places. [2023-08-27 10:25:02,265 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 279 transitions, 3964 flow [2023-08-27 10:25:02,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 198.4) internal successors, (992), 5 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:02,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:25:02,265 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:25:02,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:25:02,266 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:25:02,266 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:25:02,266 INFO L85 PathProgramCache]: Analyzing trace with hash 741124432, now seen corresponding path program 1 times [2023-08-27 10:25:02,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:25:02,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115375003] [2023-08-27 10:25:02,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:25:02,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:25:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:25:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 10:25:02,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:25:02,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115375003] [2023-08-27 10:25:02,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115375003] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:25:02,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:25:02,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:25:02,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250873791] [2023-08-27 10:25:02,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:25:02,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 10:25:02,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:25:02,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 10:25:02,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-27 10:25:02,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 575 [2023-08-27 10:25:02,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 279 transitions, 3964 flow. Second operand has 8 states, 8 states have (on average 207.75) internal successors, (1662), 8 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:02,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:25:02,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 575 [2023-08-27 10:25:02,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:25:04,565 INFO L124 PetriNetUnfolderBase]: 584/1525 cut-off events. [2023-08-27 10:25:04,566 INFO L125 PetriNetUnfolderBase]: For 10187/10187 co-relation queries the response was YES. [2023-08-27 10:25:04,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9801 conditions, 1525 events. 584/1525 cut-off events. For 10187/10187 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8970 event pairs, 27 based on Foata normal form. 0/1500 useless extension candidates. Maximal degree in co-relation 9761. Up to 388 conditions per place. [2023-08-27 10:25:04,577 INFO L140 encePairwiseOnDemand]: 563/575 looper letters, 421 selfloop transitions, 108 changer transitions 0/530 dead transitions. [2023-08-27 10:25:04,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 530 transitions, 8162 flow [2023-08-27 10:25:04,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-27 10:25:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-27 10:25:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2804 transitions. [2023-08-27 10:25:04,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3751170568561873 [2023-08-27 10:25:04,581 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2804 transitions. [2023-08-27 10:25:04,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2804 transitions. [2023-08-27 10:25:04,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:25:04,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2804 transitions. [2023-08-27 10:25:04,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 215.69230769230768) internal successors, (2804), 13 states have internal predecessors, (2804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:04,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 575.0) internal successors, (8050), 14 states have internal predecessors, (8050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:04,591 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 575.0) internal successors, (8050), 14 states have internal predecessors, (8050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:04,592 INFO L175 Difference]: Start difference. First operand has 158 places, 279 transitions, 3964 flow. Second operand 13 states and 2804 transitions. [2023-08-27 10:25:04,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 530 transitions, 8162 flow [2023-08-27 10:25:04,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 530 transitions, 7973 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:25:04,650 INFO L231 Difference]: Finished difference. Result has 178 places, 345 transitions, 5182 flow [2023-08-27 10:25:04,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=3861, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5182, PETRI_PLACES=178, PETRI_TRANSITIONS=345} [2023-08-27 10:25:04,651 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 131 predicate places. [2023-08-27 10:25:04,651 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 345 transitions, 5182 flow [2023-08-27 10:25:04,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 207.75) internal successors, (1662), 8 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:04,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:25:04,651 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:25:04,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:25:04,652 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:25:04,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:25:04,652 INFO L85 PathProgramCache]: Analyzing trace with hash 741124433, now seen corresponding path program 1 times [2023-08-27 10:25:04,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:25:04,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325955957] [2023-08-27 10:25:04,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:25:04,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:25:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:25:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 10:25:05,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:25:05,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325955957] [2023-08-27 10:25:05,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325955957] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:25:05,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:25:05,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-08-27 10:25:05,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286756428] [2023-08-27 10:25:05,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:25:05,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-27 10:25:05,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:25:05,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-27 10:25:05,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-08-27 10:25:05,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 575 [2023-08-27 10:25:05,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 345 transitions, 5182 flow. Second operand has 13 states, 13 states have (on average 172.69230769230768) internal successors, (2245), 13 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:05,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:25:05,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 575 [2023-08-27 10:25:05,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:25:09,434 INFO L124 PetriNetUnfolderBase]: 664/1706 cut-off events. [2023-08-27 10:25:09,434 INFO L125 PetriNetUnfolderBase]: For 12943/12943 co-relation queries the response was YES. [2023-08-27 10:25:09,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11522 conditions, 1706 events. 664/1706 cut-off events. For 12943/12943 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10112 event pairs, 2 based on Foata normal form. 0/1696 useless extension candidates. Maximal degree in co-relation 11473. Up to 394 conditions per place. [2023-08-27 10:25:09,446 INFO L140 encePairwiseOnDemand]: 555/575 looper letters, 358 selfloop transitions, 243 changer transitions 0/602 dead transitions. [2023-08-27 10:25:09,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 602 transitions, 9627 flow [2023-08-27 10:25:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-27 10:25:09,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-27 10:25:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 6514 transitions. [2023-08-27 10:25:09,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30618096357226793 [2023-08-27 10:25:09,455 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 6514 transitions. [2023-08-27 10:25:09,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 6514 transitions. [2023-08-27 10:25:09,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:25:09,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 6514 transitions. [2023-08-27 10:25:09,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 176.05405405405406) internal successors, (6514), 37 states have internal predecessors, (6514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:09,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 575.0) internal successors, (21850), 38 states have internal predecessors, (21850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:09,480 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 575.0) internal successors, (21850), 38 states have internal predecessors, (21850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:09,480 INFO L175 Difference]: Start difference. First operand has 178 places, 345 transitions, 5182 flow. Second operand 37 states and 6514 transitions. [2023-08-27 10:25:09,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 602 transitions, 9627 flow [2023-08-27 10:25:09,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 602 transitions, 9623 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-27 10:25:09,553 INFO L231 Difference]: Finished difference. Result has 219 places, 456 transitions, 7047 flow [2023-08-27 10:25:09,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=5178, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=7047, PETRI_PLACES=219, PETRI_TRANSITIONS=456} [2023-08-27 10:25:09,554 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 172 predicate places. [2023-08-27 10:25:09,554 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 456 transitions, 7047 flow [2023-08-27 10:25:09,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 172.69230769230768) internal successors, (2245), 13 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:09,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:25:09,555 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:25:09,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 10:25:09,555 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting threadErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:25:09,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:25:09,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1649003241, now seen corresponding path program 1 times [2023-08-27 10:25:09,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:25:09,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892867400] [2023-08-27 10:25:09,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:25:09,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:25:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:25:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 10:25:10,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:25:10,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892867400] [2023-08-27 10:25:10,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892867400] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 10:25:10,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464791091] [2023-08-27 10:25:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:25:10,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 10:25:10,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:25:10,889 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 10:25:10,896 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 10:25:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:25:11,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 135 conjunts are in the unsatisfiable core [2023-08-27 10:25:11,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 10:25:11,105 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-08-27 10:25:11,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:25:11,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:25:11,173 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-27 10:25:11,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:25:11,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:25:11,227 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-27 10:25:11,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:25:11,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:25:11,304 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-27 10:25:11,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:25:11,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 21 treesize of output 21 [2023-08-27 10:25:11,597 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-08-27 10:25:11,598 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 31 [2023-08-27 10:25:11,743 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2023-08-27 10:25:11,810 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 28 treesize of output 16 [2023-08-27 10:25:11,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:25:11,852 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 10:25:11,900 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-27 10:25:12,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:25:12,060 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 18 [2023-08-27 10:25:12,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:25:12,116 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 18 [2023-08-27 10:25:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:25:12,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 10:25:29,381 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24| Int) (v_ArrVal_533 Int) (v_ArrVal_529 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_59| Int) (v_ArrVal_534 Int)) (or (< (+ (* |c_threadThread1of1ForFork0_~elem~0#1| 8) |c_~#stack~0.offset| 4) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24|) (< (select (store (store (select (store |c_#memory_int| |c_~#threads~0.base| v_ArrVal_529) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24| v_ArrVal_533) |v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_59| v_ArrVal_534) (+ |c_~#stack~0.offset| 28)) 2147483647) (< (+ |c_~#stack~0.offset| 24) |v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_59|))) is different from false [2023-08-27 10:25:42,347 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_47| Int) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24| Int) (v_ArrVal_533 Int) (v_ArrVal_529 (Array Int Int)) (v_ArrVal_527 Int) (|v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_59| Int) (v_ArrVal_525 Int) (v_ArrVal_522 (Array Int Int)) (v_ArrVal_523 Int) (v_ArrVal_534 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#threads~0.base| v_ArrVal_522))) (let ((.cse4 (+ |c_~#stack~0.offset| 24)) (.cse5 (select .cse3 |c_~#stack~0.base|))) (let ((.cse0 (store .cse5 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_47| v_ArrVal_523)) (.cse1 (+ |c_~#stack~0.offset| 28)) (.cse2 (+ (* (select .cse5 .cse4) 8) |c_~#stack~0.offset| 4))) (or (< (select .cse0 .cse1) (+ v_ArrVal_527 1)) (< .cse2 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_47|) (< (select (store (store (select (store (store .cse3 |c_~#stack~0.base| (store (store .cse0 .cse4 v_ArrVal_525) .cse1 v_ArrVal_527)) |c_~#threads~0.base| v_ArrVal_529) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24| v_ArrVal_533) |v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_59| v_ArrVal_534) .cse1) 2147483647) (< .cse2 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24|) (< .cse4 |v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_59|)))))) is different from false [2023-08-27 10:25:42,404 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_47| Int) (v_ArrVal_527 Int) (|v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_59| Int) (v_ArrVal_525 Int) (v_ArrVal_522 (Array Int Int)) (v_ArrVal_523 Int) (v_ArrVal_534 Int) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24| Int) (v_ArrVal_533 Int) (v_ArrVal_520 Int) (v_ArrVal_529 (Array Int Int)) (|v_ULTIMATE.start_atomic_store_~obj#1.offset_91| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_~#stack~0.base| (store (select |c_#memory_int| |c_~#stack~0.base|) |v_ULTIMATE.start_atomic_store_~obj#1.offset_91| v_ArrVal_520)) |c_~#threads~0.base| v_ArrVal_522))) (let ((.cse2 (+ |c_~#stack~0.offset| 24)) (.cse5 (select .cse0 |c_~#stack~0.base|))) (let ((.cse1 (store .cse5 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_47| v_ArrVal_523)) (.cse3 (+ |c_~#stack~0.offset| 28)) (.cse4 (+ (* 8 (select .cse5 .cse2)) |c_~#stack~0.offset| 4))) (or (< (select (store (store (select (store (store .cse0 |c_~#stack~0.base| (store (store .cse1 .cse2 v_ArrVal_525) .cse3 v_ArrVal_527)) |c_~#threads~0.base| v_ArrVal_529) |c_~#stack~0.base|) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24| v_ArrVal_533) |v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_59| v_ArrVal_534) .cse3) 2147483647) (< .cse4 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_24|) (< (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) |c_~#stack~0.offset|) (+ |v_ULTIMATE.start_atomic_store_~obj#1.offset_91| 4)) (< (select .cse1 .cse3) (+ v_ArrVal_527 1)) (< .cse4 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_47|) (< .cse2 |v_threadThread1of1ForFork0_atomic_compare_and_exchange_~obj#1.offset_59|)))))) is different from false [2023-08-27 10:25:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-27 10:25:48,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464791091] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 10:25:48,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 10:25:48,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 16] total 43 [2023-08-27 10:25:48,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720969124] [2023-08-27 10:25:48,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 10:25:48,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-08-27 10:25:48,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:25:48,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-08-27 10:25:48,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1513, Unknown=79, NotChecked=246, Total=1980 [2023-08-27 10:25:48,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 575 [2023-08-27 10:25:48,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 456 transitions, 7047 flow. Second operand has 45 states, 45 states have (on average 169.64444444444445) internal successors, (7634), 45 states have internal predecessors, (7634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:25:48,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:25:48,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 575 [2023-08-27 10:25:48,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:26:36,520 INFO L124 PetriNetUnfolderBase]: 908/2272 cut-off events. [2023-08-27 10:26:36,520 INFO L125 PetriNetUnfolderBase]: For 22010/22010 co-relation queries the response was YES. [2023-08-27 10:26:36,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16951 conditions, 2272 events. 908/2272 cut-off events. For 22010/22010 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 14378 event pairs, 25 based on Foata normal form. 0/2253 useless extension candidates. Maximal degree in co-relation 16896. Up to 1078 conditions per place. [2023-08-27 10:26:36,539 INFO L140 encePairwiseOnDemand]: 552/575 looper letters, 509 selfloop transitions, 203 changer transitions 0/713 dead transitions. [2023-08-27 10:26:36,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 713 transitions, 12056 flow [2023-08-27 10:26:36,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-08-27 10:26:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-08-27 10:26:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 6260 transitions. [2023-08-27 10:26:36,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30241545893719807 [2023-08-27 10:26:36,548 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 6260 transitions. [2023-08-27 10:26:36,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 6260 transitions. [2023-08-27 10:26:36,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:26:36,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 6260 transitions. [2023-08-27 10:26:36,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 173.88888888888889) internal successors, (6260), 36 states have internal predecessors, (6260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:26:36,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 575.0) internal successors, (21275), 37 states have internal predecessors, (21275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:26:36,575 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 575.0) internal successors, (21275), 37 states have internal predecessors, (21275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:26:36,575 INFO L175 Difference]: Start difference. First operand has 219 places, 456 transitions, 7047 flow. Second operand 36 states and 6260 transitions. [2023-08-27 10:26:36,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 713 transitions, 12056 flow [2023-08-27 10:26:36,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 713 transitions, 11504 flow, removed 190 selfloop flow, removed 12 redundant places. [2023-08-27 10:26:36,707 INFO L231 Difference]: Finished difference. Result has 261 places, 549 transitions, 9035 flow [2023-08-27 10:26:36,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=6782, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=9035, PETRI_PLACES=261, PETRI_TRANSITIONS=549} [2023-08-27 10:26:36,708 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 214 predicate places. [2023-08-27 10:26:36,708 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 549 transitions, 9035 flow [2023-08-27 10:26:36,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 169.64444444444445) internal successors, (7634), 45 states have internal predecessors, (7634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:26:36,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:26:36,710 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:26:36,719 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 10:26:36,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 10:26:36,920 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:26:36,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:26:36,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1688077068, now seen corresponding path program 1 times [2023-08-27 10:26:36,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:26:36,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402027928] [2023-08-27 10:26:36,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:26:36,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:26:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:26:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 10:26:37,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:26:37,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402027928] [2023-08-27 10:26:37,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402027928] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:26:37,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:26:37,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-27 10:26:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441592521] [2023-08-27 10:26:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:26:37,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-27 10:26:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:26:37,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-27 10:26:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-27 10:26:37,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 575 [2023-08-27 10:26:37,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 549 transitions, 9035 flow. Second operand has 10 states, 10 states have (on average 206.4) internal successors, (2064), 10 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:26:37,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:26:37,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 575 [2023-08-27 10:26:37,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:26:39,467 INFO L124 PetriNetUnfolderBase]: 1005/2817 cut-off events. [2023-08-27 10:26:39,467 INFO L125 PetriNetUnfolderBase]: For 27547/27547 co-relation queries the response was YES. [2023-08-27 10:26:39,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21173 conditions, 2817 events. 1005/2817 cut-off events. For 27547/27547 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 20704 event pairs, 41 based on Foata normal form. 2/2798 useless extension candidates. Maximal degree in co-relation 21106. Up to 886 conditions per place. [2023-08-27 10:26:39,500 INFO L140 encePairwiseOnDemand]: 562/575 looper letters, 774 selfloop transitions, 166 changer transitions 0/941 dead transitions. [2023-08-27 10:26:39,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 941 transitions, 16816 flow [2023-08-27 10:26:39,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-27 10:26:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-27 10:26:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3207 transitions. [2023-08-27 10:26:39,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37182608695652175 [2023-08-27 10:26:39,504 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3207 transitions. [2023-08-27 10:26:39,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3207 transitions. [2023-08-27 10:26:39,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:26:39,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3207 transitions. [2023-08-27 10:26:39,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 213.8) internal successors, (3207), 15 states have internal predecessors, (3207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:26:39,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 575.0) internal successors, (9200), 16 states have internal predecessors, (9200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:26:39,515 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 575.0) internal successors, (9200), 16 states have internal predecessors, (9200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:26:39,515 INFO L175 Difference]: Start difference. First operand has 261 places, 549 transitions, 9035 flow. Second operand 15 states and 3207 transitions. [2023-08-27 10:26:39,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 941 transitions, 16816 flow [2023-08-27 10:26:39,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 941 transitions, 16686 flow, removed 28 selfloop flow, removed 8 redundant places. [2023-08-27 10:26:39,720 INFO L231 Difference]: Finished difference. Result has 273 places, 604 transitions, 10451 flow [2023-08-27 10:26:39,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=8911, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=10451, PETRI_PLACES=273, PETRI_TRANSITIONS=604} [2023-08-27 10:26:39,721 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 226 predicate places. [2023-08-27 10:26:39,721 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 604 transitions, 10451 flow [2023-08-27 10:26:39,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 206.4) internal successors, (2064), 10 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:26:39,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:26:39,721 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:26:39,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-27 10:26:39,721 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:26:39,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:26:39,722 INFO L85 PathProgramCache]: Analyzing trace with hash -415996672, now seen corresponding path program 2 times [2023-08-27 10:26:39,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:26:39,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886064652] [2023-08-27 10:26:39,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:26:39,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:26:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:26:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 10:26:41,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:26:41,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886064652] [2023-08-27 10:26:41,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886064652] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 10:26:41,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779470739] [2023-08-27 10:26:41,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 10:26:41,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 10:26:41,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:26:41,234 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 10:26:41,237 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 10:26:41,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 10:26:41,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 10:26:41,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 161 conjunts are in the unsatisfiable core [2023-08-27 10:26:41,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 10:26:41,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:26:41,465 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-08-27 10:26:41,526 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-27 10:26:41,598 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-27 10:26:41,669 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-27 10:26:41,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:26:41,743 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-27 10:26:41,984 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-08-27 10:26:41,985 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 31 [2023-08-27 10:26:42,175 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2023-08-27 10:26:42,257 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 28 treesize of output 16 [2023-08-27 10:26:42,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-27 10:26:42,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:26:42,529 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-27 10:26:42,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:26:42,745 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 23 treesize of output 22 [2023-08-27 10:26:42,864 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 18 [2023-08-27 10:26:42,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:26:42,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 10:26:43,389 WARN L839 $PredicateComparison]: unable to prove that (or (<= 3 |c_ULTIMATE.start_main_~i~2#1|) (forall ((v_ArrVal_655 (Array Int Int)) (v_ArrVal_656 Int)) (< 0 (+ (select (store (select (store |c_#memory_int| |c_~#threads~0.base| v_ArrVal_655) |c_~#stack~0.base|) (+ (* 8 |c_threadThread1of1ForFork0_Push_#in~index#1|) |c_~#stack~0.offset| 4) v_ArrVal_656) (+ |c_~#stack~0.offset| 28)) 2147483650)))) is different from false [2023-08-27 10:26:43,400 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_655 (Array Int Int)) (v_ArrVal_656 Int)) (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#threads~0.base| v_ArrVal_655) |c_~#stack~0.base|) (+ (* |c_threadThread1of1ForFork0_~elem~0#1| 8) |c_~#stack~0.offset| 4) v_ArrVal_656) (+ |c_~#stack~0.offset| 28))))) (<= 3 |c_ULTIMATE.start_main_~i~2#1|)) is different from false [2023-08-27 10:27:05,803 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_654 Int) (v_ArrVal_655 (Array Int Int)) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_49| Int) (v_ArrVal_652 Int) (v_ArrVal_646 (Array Int Int)) (|v_threadThread1of1ForFork0_Pop_~head1~0#1_83| Int) (v_ArrVal_649 Int) (v_ArrVal_648 Int) (v_ArrVal_645 Int) (v_ArrVal_656 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_~#stack~0.base| (store (select |c_#memory_int| |c_~#stack~0.base|) (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) (- 4) |c_~#stack~0.offset|) v_ArrVal_645)) |c_~#threads~0.base| v_ArrVal_646))) (let ((.cse6 (select .cse0 |c_~#stack~0.base|)) (.cse4 (* 8 |v_threadThread1of1ForFork0_Pop_~head1~0#1_83|))) (let ((.cse5 (+ .cse4 |c_~#stack~0.offset| 4)) (.cse1 (store .cse6 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_49| v_ArrVal_648)) (.cse3 (+ |c_~#stack~0.offset| 28)) (.cse2 (+ |c_~#stack~0.offset| 24))) (or (< 0 (+ 2147483650 (select (store (select (store (store .cse0 |c_~#stack~0.base| (store (store (store .cse1 .cse2 v_ArrVal_649) .cse3 v_ArrVal_652) (+ .cse4 |c_~#stack~0.offset|) v_ArrVal_654)) |c_~#threads~0.base| v_ArrVal_655) |c_~#stack~0.base|) .cse5 v_ArrVal_656) .cse3))) (< .cse5 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_49|) (< (+ v_ArrVal_652 1) (select .cse1 .cse3)) (< (select .cse6 .cse2) |v_threadThread1of1ForFork0_Pop_~head1~0#1_83|)))))) is different from false [2023-08-27 10:27:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-27 10:27:18,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779470739] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 10:27:18,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 10:27:18,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 18] total 44 [2023-08-27 10:27:18,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125439739] [2023-08-27 10:27:18,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 10:27:18,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-08-27 10:27:18,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:27:18,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-08-27 10:27:18,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1593, Unknown=78, NotChecked=252, Total=2070 [2023-08-27 10:27:18,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 575 [2023-08-27 10:27:18,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 604 transitions, 10451 flow. Second operand has 46 states, 46 states have (on average 130.6086956521739) internal successors, (6008), 46 states have internal predecessors, (6008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:27:18,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:27:18,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 575 [2023-08-27 10:27:18,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:27:30,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:27:42,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:27:47,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:27:49,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:27:51,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:27:53,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:28:04,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:28:14,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:28:16,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:28:25,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:28:27,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:28:45,906 WARN L234 SmtUtils]: Spent 18.38s on a formula simplification. DAG size of input: 132 DAG size of output: 109 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 10:28:47,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 10:28:50,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:29:00,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:29:02,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:29:04,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:29:06,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:29:32,878 WARN L234 SmtUtils]: Spent 24.27s on a formula simplification. DAG size of input: 117 DAG size of output: 112 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 10:29:34,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:29:37,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:29:39,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:29:43,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:29:45,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:29:47,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:29:50,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:29:59,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:30:01,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:30:05,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:30:11,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:30:20,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:30:24,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:30:27,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 10:30:32,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:30:40,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:30:42,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:30:44,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:30:47,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:30:53,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:30:55,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:31:00,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:31:02,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:31:07,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:31:09,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:31:11,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:31:16,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:31:20,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:31:22,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 10:31:31,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:31:33,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:31:42,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:31:46,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:31:49,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:31:55,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:31:58,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:32:00,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 10:32:05,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:32:07,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:32:09,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:32:11,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:32:15,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:32:19,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:32:21,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:32:23,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:32:30,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:32:32,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:32:35,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:32:42,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:32:50,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 10:33:05,255 WARN L234 SmtUtils]: Spent 12.31s on a formula simplification. DAG size of input: 123 DAG size of output: 104 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 10:33:08,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:33:10,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:33:12,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:33:14,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:33:18,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:33:20,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:33:22,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:33:26,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:33:28,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:33:37,630 INFO L124 PetriNetUnfolderBase]: 2108/5958 cut-off events. [2023-08-27 10:33:37,630 INFO L125 PetriNetUnfolderBase]: For 66528/66528 co-relation queries the response was YES. [2023-08-27 10:33:37,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46877 conditions, 5958 events. 2108/5958 cut-off events. For 66528/66528 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 49707 event pairs, 58 based on Foata normal form. 37/5949 useless extension candidates. Maximal degree in co-relation 46803. Up to 2338 conditions per place. [2023-08-27 10:33:37,685 INFO L140 encePairwiseOnDemand]: 545/575 looper letters, 1153 selfloop transitions, 594 changer transitions 0/1748 dead transitions. [2023-08-27 10:33:37,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 1748 transitions, 32094 flow [2023-08-27 10:33:37,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2023-08-27 10:33:37,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2023-08-27 10:33:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 13888 transitions. [2023-08-27 10:33:37,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23224080267558528 [2023-08-27 10:33:37,698 INFO L72 ComplementDD]: Start complementDD. Operand 104 states and 13888 transitions. [2023-08-27 10:33:37,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 13888 transitions. [2023-08-27 10:33:37,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:33:37,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 104 states and 13888 transitions. [2023-08-27 10:33:37,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 105 states, 104 states have (on average 133.53846153846155) internal successors, (13888), 104 states have internal predecessors, (13888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:33:37,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 105 states, 105 states have (on average 575.0) internal successors, (60375), 105 states have internal predecessors, (60375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:33:37,885 INFO L81 ComplementDD]: Finished complementDD. Result has 105 states, 105 states have (on average 575.0) internal successors, (60375), 105 states have internal predecessors, (60375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:33:37,885 INFO L175 Difference]: Start difference. First operand has 273 places, 604 transitions, 10451 flow. Second operand 104 states and 13888 transitions. [2023-08-27 10:33:37,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 1748 transitions, 32094 flow [2023-08-27 10:33:38,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 1748 transitions, 32024 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-27 10:33:38,227 INFO L231 Difference]: Finished difference. Result has 433 places, 1094 transitions, 21574 flow [2023-08-27 10:33:38,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=575, PETRI_DIFFERENCE_MINUEND_FLOW=10392, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=187, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=104, PETRI_FLOW=21574, PETRI_PLACES=433, PETRI_TRANSITIONS=1094} [2023-08-27 10:33:38,228 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 386 predicate places. [2023-08-27 10:33:38,228 INFO L495 AbstractCegarLoop]: Abstraction has has 433 places, 1094 transitions, 21574 flow [2023-08-27 10:33:38,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 130.6086956521739) internal successors, (6008), 46 states have internal predecessors, (6008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:33:38,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:33:38,229 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:33:38,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-27 10:33:38,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 10:33:38,430 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:33:38,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:33:38,431 INFO L85 PathProgramCache]: Analyzing trace with hash -698763320, now seen corresponding path program 3 times [2023-08-27 10:33:38,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:33:38,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431592333] [2023-08-27 10:33:38,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:33:38,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:33:38,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:33:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-27 10:33:39,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:33:39,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431592333] [2023-08-27 10:33:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431592333] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 10:33:39,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630698851] [2023-08-27 10:33:39,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 10:33:39,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 10:33:39,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:33:39,976 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 10:33:39,977 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 10:33:40,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 10:33:40,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 10:33:40,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 148 conjunts are in the unsatisfiable core [2023-08-27 10:33:40,154 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 10:33:40,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:33:40,187 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-08-27 10:33:40,264 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-27 10:33:40,328 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-27 10:33:40,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:33:40,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:33:40,415 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-27 10:33:40,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:33:40,499 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-27 10:33:40,725 INFO L322 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-08-27 10:33:40,725 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 31 [2023-08-27 10:33:40,916 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2023-08-27 10:33:40,984 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 19 treesize of output 11 [2023-08-27 10:33:41,054 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-27 10:33:41,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:33:41,275 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 18 [2023-08-27 10:33:41,338 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 18 [2023-08-27 10:33:41,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-27 10:33:41,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 14 treesize of output 16 [2023-08-27 10:33:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:33:41,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 10:33:41,473 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_751 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_~#threads~0.base| v_ArrVal_751) |c_threadThread1of1ForFork0_atomic_fetch_add_#in~obj#1.base|) |c_threadThread1of1ForFork0_atomic_fetch_add_#in~obj#1.offset|) |c_threadThread1of1ForFork0_atomic_fetch_add_#in~v#1|))) is different from false [2023-08-27 10:33:41,484 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_750 Int) (v_ArrVal_751 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_threadThread1of1ForFork0_atomic_compare_and_exchange_#in~obj#1.base| (store (select |c_#memory_int| |c_threadThread1of1ForFork0_atomic_compare_and_exchange_#in~obj#1.base|) |c_threadThread1of1ForFork0_atomic_compare_and_exchange_#in~obj#1.offset| v_ArrVal_750)) |c_~#threads~0.base| v_ArrVal_751) |c_~#stack~0.base|) (+ |c_~#stack~0.offset| 28)) 2147483650))) is different from false [2023-08-27 10:34:41,635 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_750 Int) (|v_ULTIMATE.start_atomic_store_~obj#1.offset_97| Int) (v_ArrVal_738 (Array Int Int)) (v_ArrVal_739 Int) (|v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_51| Int) (v_ArrVal_737 Int) (v_ArrVal_747 Int) (|v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_28| Int) (v_ArrVal_751 (Array Int Int)) (v_ArrVal_744 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_~#stack~0.base| (store (select |c_#memory_int| |c_~#stack~0.base|) |v_ULTIMATE.start_atomic_store_~obj#1.offset_97| v_ArrVal_737)) |c_~#threads~0.base| v_ArrVal_738))) (let ((.cse5 (select .cse3 |c_~#stack~0.base|)) (.cse4 (+ |c_~#stack~0.offset| 24))) (let ((.cse2 (+ (* 8 (select .cse5 .cse4)) |c_~#stack~0.offset| 4)) (.cse0 (store .cse5 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_51| v_ArrVal_739)) (.cse1 (+ |c_~#stack~0.offset| 28))) (or (< (+ v_ArrVal_744 1) (select .cse0 .cse1)) (< .cse2 |v_threadThread1of1ForFork0_atomic_exchange_~obj#1.offset_51|) (< .cse2 |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_28|) (< (+ (* |c_ULTIMATE.start_Init_~pushCount#1| 8) |c_~#stack~0.offset|) (+ |v_ULTIMATE.start_atomic_store_~obj#1.offset_97| 4)) (< 0 (+ 2147483650 (select (select (store (store .cse3 |c_~#stack~0.base| (store (store (store (store .cse0 .cse4 v_ArrVal_742) .cse1 v_ArrVal_744) |v_threadThread1of1ForFork0_atomic_store_~obj#1.offset_28| v_ArrVal_747) .cse4 v_ArrVal_750)) |c_~#threads~0.base| v_ArrVal_751) |c_~#stack~0.base|) .cse1)))))))) is different from false [2023-08-27 10:35:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-27 10:35:05,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630698851] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 10:35:05,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 10:35:05,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 16] total 45 [2023-08-27 10:35:05,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716261971] [2023-08-27 10:35:05,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 10:35:05,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-08-27 10:35:05,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:35:05,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-08-27 10:35:05,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1601, Unknown=65, NotChecked=258, Total=2162 [2023-08-27 10:35:05,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 575 [2023-08-27 10:35:05,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 1094 transitions, 21574 flow. Second operand has 47 states, 47 states have (on average 165.5744680851064) internal successors, (7782), 47 states have internal predecessors, (7782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:35:05,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:35:05,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 575 [2023-08-27 10:35:05,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:35:08,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:35:16,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:35:19,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:35:36,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:35:39,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:35:47,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:35:49,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:35:52,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 10:36:05,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 10:36:07,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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 10:36:09,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-08-27 10:36:37,886 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 10:36:37,886 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 10:36:38,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-08-27 10:36:38,036 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2023-08-27 10:36:38,042 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 10:36:38,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 10:36:38,237 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). [2023-08-27 10:36:38,238 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2023-08-27 10:36:38,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2023-08-27 10:36:38,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2023-08-27 10:36:38,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2023-08-27 10:36:38,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2023-08-27 10:36:38,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2023-08-27 10:36:38,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2023-08-27 10:36:38,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2023-08-27 10:36:38,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr2ASSERT_VIOLATIONASSERT (12 of 22 remaining) [2023-08-27 10:36:38,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2023-08-27 10:36:38,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr2ASSERT_VIOLATIONASSERT (10 of 22 remaining) [2023-08-27 10:36:38,239 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2023-08-27 10:36:38,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2023-08-27 10:36:38,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2023-08-27 10:36:38,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2023-08-27 10:36:38,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2023-08-27 10:36:38,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2023-08-27 10:36:38,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location threadErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2023-08-27 10:36:38,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2023-08-27 10:36:38,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2023-08-27 10:36:38,240 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2023-08-27 10:36:38,240 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:36:38,242 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-27 10:36:38,244 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:36:38,244 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:36:38,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:36:38 BasicIcfg [2023-08-27 10:36:38,246 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:36:38,246 INFO L158 Benchmark]: Toolchain (without parser) took 848647.22ms. Allocated memory was 392.2MB in the beginning and 717.2MB in the end (delta: 325.1MB). Free memory was 364.7MB in the beginning and 266.9MB in the end (delta: 97.8MB). Peak memory consumption was 423.7MB. Max. memory is 16.0GB. [2023-08-27 10:36:38,247 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 392.2MB. Free memory was 369.5MB in the beginning and 369.4MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:36:38,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 793.85ms. Allocated memory is still 392.2MB. Free memory was 364.7MB in the beginning and 308.1MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.0GB. [2023-08-27 10:36:38,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.90ms. Allocated memory is still 392.2MB. Free memory was 307.2MB in the beginning and 303.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 10:36:38,247 INFO L158 Benchmark]: Boogie Preprocessor took 67.31ms. Allocated memory is still 392.2MB. Free memory was 303.0MB in the beginning and 299.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 10:36:38,247 INFO L158 Benchmark]: RCFGBuilder took 839.68ms. Allocated memory was 392.2MB in the beginning and 484.4MB in the end (delta: 92.3MB). Free memory was 299.7MB in the beginning and 444.7MB in the end (delta: -145.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. [2023-08-27 10:36:38,248 INFO L158 Benchmark]: TraceAbstraction took 846875.81ms. Allocated memory was 484.4MB in the beginning and 717.2MB in the end (delta: 232.8MB). Free memory was 443.7MB in the beginning and 266.9MB in the end (delta: 176.8MB). Peak memory consumption was 410.6MB. Max. memory is 16.0GB. [2023-08-27 10:36:38,249 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.14ms. Allocated memory is still 392.2MB. Free memory was 369.5MB in the beginning and 369.4MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 793.85ms. Allocated memory is still 392.2MB. Free memory was 364.7MB in the beginning and 308.1MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 63.90ms. Allocated memory is still 392.2MB. Free memory was 307.2MB in the beginning and 303.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 67.31ms. Allocated memory is still 392.2MB. Free memory was 303.0MB in the beginning and 299.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 839.68ms. Allocated memory was 392.2MB in the beginning and 484.4MB in the end (delta: 92.3MB). Free memory was 299.7MB in the beginning and 444.7MB in the end (delta: -145.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.0GB. * TraceAbstraction took 846875.81ms. Allocated memory was 484.4MB in the beginning and 717.2MB in the end (delta: 232.8MB). Free memory was 443.7MB in the beginning and 266.9MB in the end (delta: 176.8MB). Peak memory consumption was 410.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 127]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [127] - GenericResultAtLocation [Line: 573]: Unsoundness Warning unspecified type, defaulting to int C: short [573] - GenericResultAtLocation [Line: 574]: Unsoundness Warning unspecified type, defaulting to int C: short [574] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3s, 265 PlacesBefore, 47 PlacesAfterwards, 279 TransitionsBefore, 54 TransitionsAfterwards, 8352 CoEnabledTransitionPairs, 7 FixpointIterations, 82 TrivialSequentialCompositions, 169 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 7 ChoiceCompositions, 292 TotalNumberOfCompositions, 9744 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7252, independent: 7069, independent conditional: 0, independent unconditional: 7069, dependent: 183, dependent conditional: 0, dependent unconditional: 183, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4372, independent: 4317, independent conditional: 0, independent unconditional: 4317, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7252, independent: 2752, independent conditional: 0, independent unconditional: 2752, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 4372, unknown conditional: 0, unknown unconditional: 4372] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 1835]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 1843]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 1843]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 1856]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 1835]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 1854]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 1852]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 12]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 1856]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 1915]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 1915]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 1852]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 1912]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 1854]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 1852]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 1912]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - TimeoutResultAtElement [Line: 1852]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (47states, 164/575 universal loopers) in iteration 22,while PetriNetUnfolder was constructing finite prefix that currently has 5805 conditions, 698 events (187/697 cut-off events. For 8154/8154 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5013 event pairs, 13 based on Foata normal form. 3/766 useless extension candidates. Maximal degree in co-relation 5671. Up to 92 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 428 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 846.7s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 618.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 148 mSolverCounterUnknown, 3026 SdHoareTripleChecker+Valid, 231.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3026 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 229.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3163 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1437 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13430 IncrementalHoareTripleChecker+Invalid, 18178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1437 mSolverCounterUnsat, 0 mSDtfsCounter, 13430 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 704 GetRequests, 134 SyntacticMatches, 17 SemanticMatches, 553 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 11011 ImplicationChecksByTransitivity, 581.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21574occurred in iteration=21, InterpolantAutomatonStates: 354, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 216.1s InterpolantComputationTime, 469 NumberOfCodeBlocks, 469 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 558 ConstructedInterpolants, 99 QuantifiedInterpolants, 12285 SizeOfPredicates, 274 NumberOfNonLiveVariables, 2156 ConjunctsInSsa, 674 ConjunctsInUnsatCore, 34 InterpolantComputations, 16 PerfectInterpolantSequences, 58/106 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown