./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-restricted-15/java_Nested.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/termination-restricted-15/java_Nested.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! overflow) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '6f3c7109e3632c85dc9002b2a2bde96ba9bdc501efcd49505c298845bf1ea677'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-restricted-15/java_Nested.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6f3c7109e3632c85dc9002b2a2bde96ba9bdc501efcd49505c298845bf1ea677 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:58:50,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:58:50,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-07 19:58:50,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:58:50,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:58:50,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:58:50,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:58:50,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:58:50,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:58:50,684 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:58:50,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:58:50,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:58:50,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:58:50,685 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:58:50,685 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:58:50,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:58:50,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 19:58:50,686 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:58:50,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:58:50,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 19:58:50,686 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:58:50,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 19:58:50,686 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:58:50,686 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 19:58:50,686 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:58:50,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 19:58:50,687 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:58:50,687 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:58:50,687 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:58:50,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:58:50,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:58:50,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:58:50,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:58:50,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:58:50,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 19:58:50,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:58:50,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:58:50,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:58:50,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:58:50,688 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:58:50,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:58:50,689 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f3c7109e3632c85dc9002b2a2bde96ba9bdc501efcd49505c298845bf1ea677 [2024-11-07 19:58:50,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:58:50,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:58:50,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:58:50,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:58:50,968 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:58:50,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/java_Nested.c [2024-11-07 19:58:52,227 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:58:52,430 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:58:52,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/java_Nested.c [2024-11-07 19:58:52,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e71657403/43e03fc43c5b4f7f8499ef497a993d62/FLAGc3cc3fd62 [2024-11-07 19:58:52,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e71657403/43e03fc43c5b4f7f8499ef497a993d62 [2024-11-07 19:58:52,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:58:52,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:58:52,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:58:52,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:58:52,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:58:52,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:58:52" (1/1) ... [2024-11-07 19:58:52,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@432d2c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:52, skipping insertion in model container [2024-11-07 19:58:52,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:58:52" (1/1) ... [2024-11-07 19:58:52,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:58:52,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:58:52,577 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:58:52,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:58:52,598 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:58:52,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:52 WrapperNode [2024-11-07 19:58:52,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:58:52,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:58:52,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:58:52,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:58:52,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:52" (1/1) ... [2024-11-07 19:58:52,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:52" (1/1) ... [2024-11-07 19:58:52,622 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2024-11-07 19:58:52,624 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:58:52,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:58:52,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:58:52,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:58:52,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:52" (1/1) ... [2024-11-07 19:58:52,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:52" (1/1) ... [2024-11-07 19:58:52,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:52" (1/1) ... [2024-11-07 19:58:52,638 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-07 19:58:52,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:52" (1/1) ... [2024-11-07 19:58:52,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:52" (1/1) ... [2024-11-07 19:58:52,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:52" (1/1) ... [2024-11-07 19:58:52,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:52" (1/1) ... [2024-11-07 19:58:52,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:52" (1/1) ... [2024-11-07 19:58:52,649 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:52" (1/1) ... [2024-11-07 19:58:52,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:58:52,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:58:52,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:58:52,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:58:52,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:52" (1/1) ... [2024-11-07 19:58:52,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:58:52,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:58:52,690 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 19:58:52,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 19:58:52,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:58:52,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:58:52,783 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:58:52,785 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:58:52,878 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 19:58:52,878 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:58:52,887 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:58:52,889 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 19:58:52,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:58:52 BoogieIcfgContainer [2024-11-07 19:58:52,889 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:58:52,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:58:52,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:58:52,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:58:52,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:58:52" (1/3) ... [2024-11-07 19:58:52,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765e5799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:58:52, skipping insertion in model container [2024-11-07 19:58:52,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:58:52" (2/3) ... [2024-11-07 19:58:52,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765e5799 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:58:52, skipping insertion in model container [2024-11-07 19:58:52,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:58:52" (3/3) ... [2024-11-07 19:58:52,899 INFO L112 eAbstractionObserver]: Analyzing ICFG java_Nested.c [2024-11-07 19:58:52,913 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:58:52,914 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-07 19:58:52,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:58:52,973 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@1d621439, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:58:52,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-07 19:58:52,978 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.8) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:52,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 19:58:52,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:52,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 19:58:52,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:52,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash 28699898, now seen corresponding path program 1 times [2024-11-07 19:58:52,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:52,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487319368] [2024-11-07 19:58:52,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:52,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:53,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:53,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:53,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487319368] [2024-11-07 19:58:53,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487319368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:58:53,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:58:53,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:58:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927910472] [2024-11-07 19:58:53,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:58:53,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:58:53,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:53,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:58:53,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:53,127 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.8) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:53,171 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2024-11-07 19:58:53,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:58:53,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 19:58:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:53,180 INFO L225 Difference]: With dead ends: 55 [2024-11-07 19:58:53,181 INFO L226 Difference]: Without dead ends: 29 [2024-11-07 19:58:53,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:53,188 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:53,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:53,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-07 19:58:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2024-11-07 19:58:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-07 19:58:53,222 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 5 [2024-11-07 19:58:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:53,223 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-07 19:58:53,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,223 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-07 19:58:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 19:58:53,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:53,224 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 19:58:53,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:58:53,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:53,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:53,226 INFO L85 PathProgramCache]: Analyzing trace with hash 28699945, now seen corresponding path program 1 times [2024-11-07 19:58:53,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:53,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889485739] [2024-11-07 19:58:53,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:53,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:53,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:53,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:53,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889485739] [2024-11-07 19:58:53,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889485739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:58:53,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:58:53,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:58:53,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79502108] [2024-11-07 19:58:53,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:58:53,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:58:53,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:53,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:58:53,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:53,277 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:53,310 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-11-07 19:58:53,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:58:53,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 19:58:53,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:53,314 INFO L225 Difference]: With dead ends: 28 [2024-11-07 19:58:53,314 INFO L226 Difference]: Without dead ends: 27 [2024-11-07 19:58:53,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:53,315 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:53,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-07 19:58:53,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-07 19:58:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.631578947368421) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-07 19:58:53,322 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2024-11-07 19:58:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:53,322 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-07 19:58:53,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,323 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-07 19:58:53,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 19:58:53,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:53,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:58:53,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:58:53,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:53,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:53,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1810845099, now seen corresponding path program 1 times [2024-11-07 19:58:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:53,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185104234] [2024-11-07 19:58:53,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:53,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:53,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185104234] [2024-11-07 19:58:53,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185104234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:58:53,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:58:53,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:58:53,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976228283] [2024-11-07 19:58:53,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:58:53,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:58:53,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:53,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:58:53,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:53,383 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:53,394 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2024-11-07 19:58:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:58:53,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-07 19:58:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:53,395 INFO L225 Difference]: With dead ends: 27 [2024-11-07 19:58:53,395 INFO L226 Difference]: Without dead ends: 26 [2024-11-07 19:58:53,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:53,396 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:53,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:53,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-07 19:58:53,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-07 19:58:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-07 19:58:53,403 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 7 [2024-11-07 19:58:53,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:53,405 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-07 19:58:53,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-07 19:58:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 19:58:53,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:53,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:58:53,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:58:53,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:53,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:53,407 INFO L85 PathProgramCache]: Analyzing trace with hash 301623279, now seen corresponding path program 1 times [2024-11-07 19:58:53,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:53,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547932465] [2024-11-07 19:58:53,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:53,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:53,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:53,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547932465] [2024-11-07 19:58:53,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547932465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:58:53,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:58:53,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:58:53,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941364350] [2024-11-07 19:58:53,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:58:53,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:58:53,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:53,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:58:53,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:53,458 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:53,492 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-07 19:58:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:58:53,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-07 19:58:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:53,494 INFO L225 Difference]: With dead ends: 33 [2024-11-07 19:58:53,494 INFO L226 Difference]: Without dead ends: 32 [2024-11-07 19:58:53,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:53,495 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:53,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:53,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-07 19:58:53,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-07 19:58:53,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.4) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2024-11-07 19:58:53,499 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 8 [2024-11-07 19:58:53,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:53,500 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2024-11-07 19:58:53,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,500 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2024-11-07 19:58:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 19:58:53,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:53,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:58:53,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 19:58:53,501 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:53,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:53,501 INFO L85 PathProgramCache]: Analyzing trace with hash 760387117, now seen corresponding path program 1 times [2024-11-07 19:58:53,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:53,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648982583] [2024-11-07 19:58:53,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:53,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:53,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:53,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648982583] [2024-11-07 19:58:53,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648982583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:58:53,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:58:53,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:58:53,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38977256] [2024-11-07 19:58:53,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:58:53,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:58:53,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:53,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:58:53,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:58:53,568 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:53,600 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-07 19:58:53,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:58:53,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-07 19:58:53,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:53,601 INFO L225 Difference]: With dead ends: 32 [2024-11-07 19:58:53,602 INFO L226 Difference]: Without dead ends: 30 [2024-11-07 19:58:53,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:58:53,603 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:53,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:53,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-07 19:58:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-07 19:58:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-07 19:58:53,610 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 9 [2024-11-07 19:58:53,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:53,610 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-07 19:58:53,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,610 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-07 19:58:53,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-07 19:58:53,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:53,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:58:53,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 19:58:53,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:53,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:53,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1035144580, now seen corresponding path program 1 times [2024-11-07 19:58:53,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:53,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944126733] [2024-11-07 19:58:53,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:53,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:58:53,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:53,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944126733] [2024-11-07 19:58:53,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944126733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:58:53,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:58:53,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:58:53,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554976016] [2024-11-07 19:58:53,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:58:53,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:58:53,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:53,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:58:53,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:53,665 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:53,678 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-11-07 19:58:53,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:58:53,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-07 19:58:53,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:53,680 INFO L225 Difference]: With dead ends: 30 [2024-11-07 19:58:53,680 INFO L226 Difference]: Without dead ends: 29 [2024-11-07 19:58:53,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:53,681 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:53,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-07 19:58:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-07 19:58:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-11-07 19:58:53,689 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 12 [2024-11-07 19:58:53,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:53,689 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-11-07 19:58:53,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-11-07 19:58:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 19:58:53,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:53,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:58:53,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:58:53,691 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:53,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:53,691 INFO L85 PathProgramCache]: Analyzing trace with hash 2024710977, now seen corresponding path program 1 times [2024-11-07 19:58:53,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:53,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325526636] [2024-11-07 19:58:53,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:53,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:58:53,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:53,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325526636] [2024-11-07 19:58:53,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325526636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:58:53,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:58:53,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:58:53,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376202305] [2024-11-07 19:58:53,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:58:53,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:58:53,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:53,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:58:53,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:53,737 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:53,749 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2024-11-07 19:58:53,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:58:53,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-07 19:58:53,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:53,750 INFO L225 Difference]: With dead ends: 44 [2024-11-07 19:58:53,750 INFO L226 Difference]: Without dead ends: 43 [2024-11-07 19:58:53,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:53,751 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:53,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:53,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-07 19:58:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2024-11-07 19:58:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2024-11-07 19:58:53,760 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 13 [2024-11-07 19:58:53,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:53,760 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2024-11-07 19:58:53,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2024-11-07 19:58:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-07 19:58:53,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:53,760 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:58:53,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:58:53,761 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:53,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:53,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2024712419, now seen corresponding path program 1 times [2024-11-07 19:58:53,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:53,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639146840] [2024-11-07 19:58:53,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:53,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:58:53,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:53,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639146840] [2024-11-07 19:58:53,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639146840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:58:53,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:58:53,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:58:53,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73981019] [2024-11-07 19:58:53,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:58:53,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:58:53,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:53,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:58:53,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:53,816 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:53,840 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-07 19:58:53,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:58:53,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-07 19:58:53,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:53,841 INFO L225 Difference]: With dead ends: 40 [2024-11-07 19:58:53,841 INFO L226 Difference]: Without dead ends: 38 [2024-11-07 19:58:53,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:53,842 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:53,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:53,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-07 19:58:53,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2024-11-07 19:58:53,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-07 19:58:53,850 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 13 [2024-11-07 19:58:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:53,850 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-07 19:58:53,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:53,850 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-07 19:58:53,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 19:58:53,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:53,855 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:58:53,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:58:53,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:53,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:53,856 INFO L85 PathProgramCache]: Analyzing trace with hash 128451365, now seen corresponding path program 1 times [2024-11-07 19:58:53,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:53,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367782560] [2024-11-07 19:58:53,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:53,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:53,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:53,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367782560] [2024-11-07 19:58:53,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367782560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:58:53,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29479207] [2024-11-07 19:58:53,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:53,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:58:53,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:58:53,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:58:53,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 19:58:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:53,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:58:53,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:58:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:54,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:58:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:54,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29479207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:58:54,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:58:54,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-11-07 19:58:54,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129133168] [2024-11-07 19:58:54,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:58:54,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 19:58:54,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:54,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 19:58:54,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:58:54,065 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:54,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:54,105 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2024-11-07 19:58:54,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:58:54,106 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-07 19:58:54,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:54,107 INFO L225 Difference]: With dead ends: 88 [2024-11-07 19:58:54,107 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 19:58:54,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:58:54,108 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:54,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:54,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 19:58:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-07 19:58:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.144578313253012) internal successors, (95), 84 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:54,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2024-11-07 19:58:54,128 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 15 [2024-11-07 19:58:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:54,128 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2024-11-07 19:58:54,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2024-11-07 19:58:54,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 19:58:54,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:54,129 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-07 19:58:54,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 19:58:54,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:58:54,329 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:54,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:54,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1911050654, now seen corresponding path program 1 times [2024-11-07 19:58:54,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:54,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978840799] [2024-11-07 19:58:54,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:54,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 19:58:54,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:54,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978840799] [2024-11-07 19:58:54,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978840799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:58:54,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:58:54,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:58:54,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146105743] [2024-11-07 19:58:54,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:58:54,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:58:54,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:54,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:58:54,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:54,370 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:54,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:54,379 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2024-11-07 19:58:54,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:58:54,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-07 19:58:54,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:54,381 INFO L225 Difference]: With dead ends: 85 [2024-11-07 19:58:54,381 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 19:58:54,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:58:54,381 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:54,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 12 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 19:58:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 53. [2024-11-07 19:58:54,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2024-11-07 19:58:54,388 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 24 [2024-11-07 19:58:54,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:54,389 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2024-11-07 19:58:54,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2024-11-07 19:58:54,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 19:58:54,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:54,390 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2024-11-07 19:58:54,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:58:54,390 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:54,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:54,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1983309423, now seen corresponding path program 2 times [2024-11-07 19:58:54,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:54,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042751885] [2024-11-07 19:58:54,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:54,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:54,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:54,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042751885] [2024-11-07 19:58:54,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042751885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:58:54,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981424525] [2024-11-07 19:58:54,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:58:54,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:58:54,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:58:54,533 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:58:54,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 19:58:54,582 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 19:58:54,582 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:58:54,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:58:54,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:58:54,661 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:54,661 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:58:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:54,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981424525] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:58:54,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:58:54,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-07 19:58:54,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985413078] [2024-11-07 19:58:54,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:58:54,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 19:58:54,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:54,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 19:58:54,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-07 19:58:54,789 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:54,856 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2024-11-07 19:58:54,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 19:58:54,856 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-07 19:58:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:54,857 INFO L225 Difference]: With dead ends: 120 [2024-11-07 19:58:54,857 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 19:58:54,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-07 19:58:54,858 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 57 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:54,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 106 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:54,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 19:58:54,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-07 19:58:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.0932203389830508) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2024-11-07 19:58:54,879 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 36 [2024-11-07 19:58:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:54,879 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2024-11-07 19:58:54,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.454545454545454) internal successors, (71), 12 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:54,879 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2024-11-07 19:58:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-07 19:58:54,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:54,881 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1] [2024-11-07 19:58:54,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 19:58:55,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:58:55,086 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:55,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:55,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1790508079, now seen corresponding path program 3 times [2024-11-07 19:58:55,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:55,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447473957] [2024-11-07 19:58:55,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:55,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:55,370 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:55,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:55,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447473957] [2024-11-07 19:58:55,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447473957] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:58:55,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944256971] [2024-11-07 19:58:55,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:58:55,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:58:55,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:58:55,375 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:58:55,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 19:58:55,443 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-07 19:58:55,444 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:58:55,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 19:58:55,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:58:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:58:55,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:58:55,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944256971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:58:55,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 19:58:55,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [12] total 25 [2024-11-07 19:58:55,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861768557] [2024-11-07 19:58:55,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:58:55,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 19:58:55,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:55,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 19:58:55,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2024-11-07 19:58:55,779 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:55,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:55,954 INFO L93 Difference]: Finished difference Result 483 states and 538 transitions. [2024-11-07 19:58:55,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 19:58:55,955 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-07 19:58:55,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:55,958 INFO L225 Difference]: With dead ends: 483 [2024-11-07 19:58:55,959 INFO L226 Difference]: Without dead ends: 467 [2024-11-07 19:58:55,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2024-11-07 19:58:55,960 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:55,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 76 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:58:55,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-07 19:58:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 459. [2024-11-07 19:58:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.1331877729257642) internal successors, (519), 458 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 519 transitions. [2024-11-07 19:58:56,000 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 519 transitions. Word has length 78 [2024-11-07 19:58:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:56,000 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 519 transitions. [2024-11-07 19:58:56,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.571428571428571) internal successors, (78), 14 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 519 transitions. [2024-11-07 19:58:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 19:58:56,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:56,004 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1] [2024-11-07 19:58:56,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 19:58:56,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:58:56,208 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:56,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:56,209 INFO L85 PathProgramCache]: Analyzing trace with hash -996843208, now seen corresponding path program 1 times [2024-11-07 19:58:56,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:56,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504371009] [2024-11-07 19:58:56,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:56,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 132 proven. 9 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-07 19:58:56,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:56,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504371009] [2024-11-07 19:58:56,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504371009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:58:56,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146476849] [2024-11-07 19:58:56,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:56,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:58:56,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:58:56,345 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:58:56,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 19:58:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:56,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 19:58:56,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:58:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 132 proven. 9 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-07 19:58:56,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:58:56,516 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 132 proven. 9 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2024-11-07 19:58:56,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146476849] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:58:56,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:58:56,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-07 19:58:56,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226747216] [2024-11-07 19:58:56,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:58:56,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 19:58:56,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:56,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 19:58:56,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:58:56,517 INFO L87 Difference]: Start difference. First operand 459 states and 519 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:56,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:56,584 INFO L93 Difference]: Finished difference Result 606 states and 683 transitions. [2024-11-07 19:58:56,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 19:58:56,585 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-07 19:58:56,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:56,586 INFO L225 Difference]: With dead ends: 606 [2024-11-07 19:58:56,586 INFO L226 Difference]: Without dead ends: 214 [2024-11-07 19:58:56,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-07 19:58:56,591 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:56,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 38 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:58:56,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-07 19:58:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 209. [2024-11-07 19:58:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 1.0721153846153846) internal successors, (223), 208 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 223 transitions. [2024-11-07 19:58:56,610 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 223 transitions. Word has length 82 [2024-11-07 19:58:56,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:56,612 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 223 transitions. [2024-11-07 19:58:56,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 223 transitions. [2024-11-07 19:58:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 19:58:56,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:56,614 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1] [2024-11-07 19:58:56,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 19:58:56,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-07 19:58:56,819 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:56,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:56,819 INFO L85 PathProgramCache]: Analyzing trace with hash -771565384, now seen corresponding path program 2 times [2024-11-07 19:58:56,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:56,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625562458] [2024-11-07 19:58:56,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:56,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 204 proven. 111 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-07 19:58:57,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:57,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625562458] [2024-11-07 19:58:57,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625562458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:58:57,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993135707] [2024-11-07 19:58:57,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:58:57,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:58:57,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:58:57,010 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:58:57,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 19:58:57,059 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 19:58:57,059 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:58:57,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 19:58:57,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:58:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 204 proven. 111 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-07 19:58:57,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:58:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 204 proven. 111 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-07 19:58:57,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993135707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:58:57,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:58:57,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 12 [2024-11-07 19:58:57,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155546727] [2024-11-07 19:58:57,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:58:57,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 19:58:57,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:57,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 19:58:57,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-07 19:58:57,307 INFO L87 Difference]: Start difference. First operand 209 states and 223 transitions. Second operand has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:57,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:57,382 INFO L93 Difference]: Finished difference Result 285 states and 302 transitions. [2024-11-07 19:58:57,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 19:58:57,383 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-07 19:58:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:57,384 INFO L225 Difference]: With dead ends: 285 [2024-11-07 19:58:57,384 INFO L226 Difference]: Without dead ends: 151 [2024-11-07 19:58:57,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 156 SyntacticMatches, 11 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-07 19:58:57,384 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:57,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 46 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:58:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-07 19:58:57,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2024-11-07 19:58:57,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.0633802816901408) internal successors, (151), 142 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:57,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 151 transitions. [2024-11-07 19:58:57,394 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 151 transitions. Word has length 82 [2024-11-07 19:58:57,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:57,395 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 151 transitions. [2024-11-07 19:58:57,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.083333333333333) internal successors, (73), 12 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:57,396 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 151 transitions. [2024-11-07 19:58:57,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-07 19:58:57,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:57,397 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1] [2024-11-07 19:58:57,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 19:58:57,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-07 19:58:57,598 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:57,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:57,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1666726138, now seen corresponding path program 3 times [2024-11-07 19:58:57,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:57,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372710299] [2024-11-07 19:58:57,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:57,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:58:57,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:57,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372710299] [2024-11-07 19:58:57,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372710299] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:58:57,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55917517] [2024-11-07 19:58:57,835 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:58:57,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:58:57,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:58:57,837 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:58:57,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 19:58:57,887 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-07 19:58:57,887 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:58:57,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 19:58:57,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:58:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:58:57,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:58:58,305 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:58:58,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55917517] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:58:58,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:58:58,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-11-07 19:58:58,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417363907] [2024-11-07 19:58:58,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:58:58,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-07 19:58:58,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:58:58,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-07 19:58:58,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-07 19:58:58,307 INFO L87 Difference]: Start difference. First operand 143 states and 151 transitions. Second operand has 24 states, 23 states have (on average 7.086956521739131) internal successors, (163), 24 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:58,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:58:58,387 INFO L93 Difference]: Finished difference Result 232 states and 251 transitions. [2024-11-07 19:58:58,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-07 19:58:58,388 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 7.086956521739131) internal successors, (163), 24 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-11-07 19:58:58,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:58:58,390 INFO L225 Difference]: With dead ends: 232 [2024-11-07 19:58:58,391 INFO L226 Difference]: Without dead ends: 231 [2024-11-07 19:58:58,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2024-11-07 19:58:58,394 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:58:58,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 167 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:58:58,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-07 19:58:58,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2024-11-07 19:58:58,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.0391304347826087) internal successors, (239), 230 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 239 transitions. [2024-11-07 19:58:58,404 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 239 transitions. Word has length 82 [2024-11-07 19:58:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:58:58,405 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 239 transitions. [2024-11-07 19:58:58,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 7.086956521739131) internal successors, (163), 24 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:58:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 239 transitions. [2024-11-07 19:58:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-07 19:58:58,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:58:58,409 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 3, 2, 2, 2, 1, 1, 1] [2024-11-07 19:58:58,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-07 19:58:58,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 19:58:58,610 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:58:58,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:58:58,610 INFO L85 PathProgramCache]: Analyzing trace with hash -366284273, now seen corresponding path program 4 times [2024-11-07 19:58:58,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:58:58,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695810472] [2024-11-07 19:58:58,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:58:58,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:58:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:58:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 1777 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 19:58:59,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:58:59,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695810472] [2024-11-07 19:58:59,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695810472] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:58:59,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885045154] [2024-11-07 19:58:59,260 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-07 19:58:59,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:58:59,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:58:59,263 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:58:59,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 19:58:59,341 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-07 19:58:59,341 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:58:59,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 19:58:59,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:58:59,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 1777 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 19:58:59,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:59:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1779 backedges. 0 proven. 1777 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 19:59:00,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885045154] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:59:00,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:59:00,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2024-11-07 19:59:00,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392621153] [2024-11-07 19:59:00,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:59:00,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-07 19:59:00,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:59:00,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-07 19:59:00,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-07 19:59:00,571 INFO L87 Difference]: Start difference. First operand 231 states and 239 transitions. Second operand has 48 states, 47 states have (on average 7.212765957446808) internal successors, (339), 48 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:59:00,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:59:00,780 INFO L93 Difference]: Finished difference Result 412 states and 443 transitions. [2024-11-07 19:59:00,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-07 19:59:00,780 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 7.212765957446808) internal successors, (339), 48 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2024-11-07 19:59:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:59:00,783 INFO L225 Difference]: With dead ends: 412 [2024-11-07 19:59:00,784 INFO L226 Difference]: Without dead ends: 411 [2024-11-07 19:59:00,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2024-11-07 19:59:00,786 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:59:00,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 305 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:59:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-07 19:59:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2024-11-07 19:59:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.0219512195121951) internal successors, (419), 410 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:59:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 419 transitions. [2024-11-07 19:59:00,800 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 419 transitions. Word has length 170 [2024-11-07 19:59:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:59:00,801 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 419 transitions. [2024-11-07 19:59:00,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 7.212765957446808) internal successors, (339), 48 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:59:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 419 transitions. [2024-11-07 19:59:00,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-07 19:59:00,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:59:00,804 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 6, 5, 5, 5, 1, 1, 1] [2024-11-07 19:59:00,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 19:59:01,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:59:01,009 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:59:01,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:59:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1031670202, now seen corresponding path program 5 times [2024-11-07 19:59:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:59:01,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792059608] [2024-11-07 19:59:01,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:59:01,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:59:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:59:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 7755 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 19:59:03,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:59:03,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792059608] [2024-11-07 19:59:03,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792059608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:59:03,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297684416] [2024-11-07 19:59:03,178 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-07 19:59:03,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:59:03,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:59:03,180 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:59:03,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 19:59:03,357 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-11-07 19:59:03,357 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:59:03,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-07 19:59:03,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:59:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7755 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 19:59:03,778 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:59:06,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7755 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 19:59:06,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297684416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:59:06,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:59:06,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2024-11-07 19:59:06,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137157095] [2024-11-07 19:59:06,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:59:06,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2024-11-07 19:59:06,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:59:06,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2024-11-07 19:59:06,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-11-07 19:59:06,526 INFO L87 Difference]: Start difference. First operand 411 states and 419 transitions. Second operand has 96 states, 95 states have (on average 7.3578947368421055) internal successors, (699), 96 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:59:07,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:59:07,006 INFO L93 Difference]: Finished difference Result 768 states and 823 transitions. [2024-11-07 19:59:07,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-07 19:59:07,008 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 7.3578947368421055) internal successors, (699), 96 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350 [2024-11-07 19:59:07,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:59:07,011 INFO L225 Difference]: With dead ends: 768 [2024-11-07 19:59:07,011 INFO L226 Difference]: Without dead ends: 767 [2024-11-07 19:59:07,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2024-11-07 19:59:07,014 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 19:59:07,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 624 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 19:59:07,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-11-07 19:59:07,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2024-11-07 19:59:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.0117493472584855) internal successors, (775), 766 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:59:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 775 transitions. [2024-11-07 19:59:07,038 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 775 transitions. Word has length 350 [2024-11-07 19:59:07,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:59:07,039 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 775 transitions. [2024-11-07 19:59:07,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 7.3578947368421055) internal successors, (699), 96 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:59:07,040 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 775 transitions. [2024-11-07 19:59:07,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-11-07 19:59:07,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:59:07,051 INFO L215 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 94, 94, 11, 10, 10, 10, 1, 1, 1] [2024-11-07 19:59:07,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-07 19:59:07,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 19:59:07,252 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-11-07 19:59:07,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:59:07,253 INFO L85 PathProgramCache]: Analyzing trace with hash 390262927, now seen corresponding path program 6 times [2024-11-07 19:59:07,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:59:07,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228821167] [2024-11-07 19:59:07,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:59:07,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:59:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:59:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 32207 backedges. 0 proven. 32197 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-07 19:59:13,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:59:13,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228821167] [2024-11-07 19:59:13,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228821167] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:59:13,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939257076] [2024-11-07 19:59:13,928 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-07 19:59:13,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:59:13,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:59:13,930 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:59:13,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-07 19:59:14,199 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 69 check-sat command(s) [2024-11-07 19:59:14,199 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:59:14,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 1202 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 19:59:14,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:59:15,238 INFO L134 CoverageAnalysis]: Checked inductivity of 32207 backedges. 29535 proven. 0 refuted. 0 times theorem prover too weak. 2672 trivial. 0 not checked. [2024-11-07 19:59:15,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:59:15,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939257076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:59:15,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 19:59:15,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [96] total 108 [2024-11-07 19:59:15,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682712898] [2024-11-07 19:59:15,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:59:15,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 19:59:15,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:59:15,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 19:59:15,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4733, Invalid=6823, Unknown=0, NotChecked=0, Total=11556 [2024-11-07 19:59:15,244 INFO L87 Difference]: Start difference. First operand 767 states and 775 transitions. Second operand has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:59:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:59:15,323 INFO L93 Difference]: Finished difference Result 767 states and 775 transitions. [2024-11-07 19:59:15,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 19:59:15,324 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 706 [2024-11-07 19:59:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:59:15,325 INFO L225 Difference]: With dead ends: 767 [2024-11-07 19:59:15,325 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 19:59:15,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 801 GetRequests, 695 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4733, Invalid=6823, Unknown=0, NotChecked=0, Total=11556 [2024-11-07 19:59:15,330 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:59:15,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 292 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:59:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 19:59:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 19:59:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:59:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 19:59:15,331 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 706 [2024-11-07 19:59:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:59:15,331 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 19:59:15,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.307692307692308) internal successors, (121), 13 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:59:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 19:59:15,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 19:59:15,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-11-07 19:59:15,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-11-07 19:59:15,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-11-07 19:59:15,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-11-07 19:59:15,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-11-07 19:59:15,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-11-07 19:59:15,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-11-07 19:59:15,334 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-11-07 19:59:15,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-07 19:59:15,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-07 19:59:15,539 INFO L407 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:59:15,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 19:59:18,558 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:59:18,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:59:18 BoogieIcfgContainer [2024-11-07 19:59:18,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:59:18,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:59:18,627 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:59:18,627 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:59:18,628 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:58:52" (3/4) ... [2024-11-07 19:59:18,630 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 19:59:18,639 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-07 19:59:18,639 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 19:59:18,639 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-07 19:59:18,717 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 19:59:18,718 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 19:59:18,718 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:59:18,718 INFO L158 Benchmark]: Toolchain (without parser) took 26262.42ms. Allocated memory was 117.4MB in the beginning and 671.1MB in the end (delta: 553.6MB). Free memory was 92.8MB in the beginning and 441.0MB in the end (delta: -348.1MB). Peak memory consumption was 200.7MB. Max. memory is 16.1GB. [2024-11-07 19:59:18,719 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:59:18,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.72ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 82.9MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:59:18,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.97ms. Allocated memory is still 117.4MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:59:18,720 INFO L158 Benchmark]: Boogie Preprocessor took 28.91ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 81.0MB in the end (delta: 910.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:59:18,720 INFO L158 Benchmark]: RCFGBuilder took 235.61ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 72.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 19:59:18,722 INFO L158 Benchmark]: TraceAbstraction took 25730.37ms. Allocated memory was 117.4MB in the beginning and 671.1MB in the end (delta: 553.6MB). Free memory was 71.4MB in the beginning and 445.2MB in the end (delta: -373.7MB). Peak memory consumption was 388.3MB. Max. memory is 16.1GB. [2024-11-07 19:59:18,722 INFO L158 Benchmark]: Witness Printer took 94.86ms. Allocated memory is still 671.1MB. Free memory was 445.2MB in the beginning and 441.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:59:18,723 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.20ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 141.72ms. Allocated memory is still 117.4MB. Free memory was 92.8MB in the beginning and 82.9MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.97ms. Allocated memory is still 117.4MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.91ms. Allocated memory is still 117.4MB. Free memory was 81.9MB in the beginning and 81.0MB in the end (delta: 910.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 235.61ms. Allocated memory is still 117.4MB. Free memory was 81.0MB in the beginning and 72.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 25730.37ms. Allocated memory was 117.4MB in the beginning and 671.1MB in the end (delta: 553.6MB). Free memory was 71.4MB in the beginning and 445.2MB in the end (delta: -373.7MB). Peak memory consumption was 388.3MB. Max. memory is 16.1GB. * Witness Printer took 94.86ms. Allocated memory is still 671.1MB. Free memory was 445.2MB in the beginning and 441.0MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 13]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 17]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 22.6s, OverallIterations: 18, TraceHistogramMax: 95, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 247 mSDsluCounter, 1902 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1583 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 827 IncrementalHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 319 mSDtfsCounter, 827 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2645 GetRequests, 2301 SyntacticMatches, 11 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1272 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=767occurred in iteration=17, InterpolantAutomatonStates: 262, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 67 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 3298 NumberOfCodeBlocks, 3235 NumberOfCodeBlocksAsserted, 164 NumberOfCheckSat, 4081 ConstructedInterpolants, 0 QuantifiedInterpolants, 11437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2887 ConjunctsInSsa, 147 ConjunctsInUnsatCore, 34 InterpolantComputations, 11 PerfectInterpolantSequences, 34528/97360 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= c) && (j == 11)) && (c <= 2147483615)) && (i <= 9)) && (6 <= i)) || (((((c <= 27) && (0 <= c)) && (12 <= j)) && (2 <= i)) && (i <= 9))) || (((c == 0) && (i == 0)) && (3 == j))) || (((((0 <= c) && (7 == j)) && (c <= 40)) && (i <= 9)) && (4 <= i))) || (((((c <= 45) && (0 <= c)) && (12 <= j)) && (i <= 9)) && (4 <= i))) || ((((j == 4) && (i == 0)) && (c <= 1)) && (0 <= c))) || (((((c <= 2147483627) && (0 <= c)) && (i <= 9)) && (8 <= i)) && (5 == j))) || (((((1 <= i) && (c <= 14)) && (0 <= c)) && (i <= 9)) && (j == 8))) || (((((7 <= i) && (c <= 2147483616)) && (0 <= c)) && (3 == j)) && (i <= 9))) || (((((c <= 33) && (0 <= c)) && (3 <= i)) && (9 == j)) && (i <= 9))) || (((((c <= 24) && (0 <= c)) && (2 <= i)) && (9 == j)) && (i <= 9))) || (((((0 <= c) && (3 <= i)) && (c <= 31)) && (7 == j)) && (i <= 9))) || (((((c <= 38) && (0 <= c)) && (i <= 9)) && (5 == j)) && (4 <= i))) || (((((c <= 2147483611) && (0 <= c)) && (7 == j)) && (i <= 9)) && (6 <= i))) || (((((0 <= c) && (c <= 2147483614)) && (i <= 9)) && (j == 10)) && (6 <= i))) || (((((6 == j) && (0 <= c)) && (3 <= i)) && (i <= 9)) && (c <= 30))) || (((((0 <= c) && (j == 11)) && (c <= 26)) && (2 <= i)) && (i <= 9))) || (((((c <= 2147483607) && (0 <= c)) && (3 == j)) && (i <= 9)) && (6 <= i))) || (((((5 <= i) && (0 <= c)) && (c <= 2147483603)) && (i <= 9)) && (j == 8))) || (((((j == 4) && (1 <= i)) && (c <= 10)) && (0 <= c)) && (i <= 9))) || (((((c <= 43) && (0 <= c)) && (i <= 9)) && (j == 10)) && (4 <= i))) || (((((7 <= i) && (c <= 2147483620)) && (0 <= c)) && (7 == j)) && (i <= 9))) || ((((c <= 2147483637) && (6 == j)) && (9 == i)) && (0 <= c))) || (((((5 <= i) && (0 <= c)) && (9 == j)) && (i <= 9)) && (c <= 2147483604))) || (((((c <= 2147483605) && (5 <= i)) && (0 <= c)) && (i <= 9)) && (j == 10))) || (((((c <= 2147483632) && (0 <= c)) && (i <= 9)) && (j == 10)) && (8 <= i))) || (((((0 <= c) && (c <= 20)) && (2 <= i)) && (i <= 9)) && (5 == j))) || (((((1 <= i) && (c <= 15)) && (0 <= c)) && (9 == j)) && (i <= 9))) || (((((c <= 25) && (0 <= c)) && (2 <= i)) && (i <= 9)) && (j == 10))) || (((((0 <= c) && (c <= 2147483612)) && (i <= 9)) && (6 <= i)) && (j == 8))) || (((((0 <= c) && (0 <= i)) && (c <= 6)) && (9 == j)) && (i <= 9))) || (((((j == 4) && (7 <= i)) && (0 <= c)) && (i <= 9)) && (c <= 2147483617))) || (((((0 <= c) && (7 == j)) && (i <= 9)) && (c <= 2147483629)) && (8 <= i))) || (((((c <= 2147483606) && (5 <= i)) && (0 <= c)) && (j == 11)) && (i <= 9))) || (((((c <= 21) && (6 == j)) && (0 <= c)) && (2 <= i)) && (i <= 9))) || (((((c <= 2147483600) && (5 <= i)) && (0 <= c)) && (i <= 9)) && (5 == j))) || (((((c <= 36) && (0 <= c)) && (3 == j)) && (i <= 9)) && (4 <= i))) || (((((c <= 2147483613) && (0 <= c)) && (9 == j)) && (i <= 9)) && (6 <= i))) || (((((c <= 35) && (0 <= c)) && (3 <= i)) && (j == 11)) && (i <= 9))) || (((((0 <= c) && (c <= 8)) && (j == 11)) && (0 <= i)) && (i <= 9))) || (((((1 <= i) && (0 <= c)) && (7 == j)) && (i <= 9)) && (c <= 13))) || (((((7 <= i) && (c <= 2147483625)) && (0 <= c)) && (12 <= j)) && (i <= 9))) || (((((6 == j) && (0 <= c)) && (c <= 2147483610)) && (i <= 9)) && (6 <= i))) || (((((7 <= i) && (0 <= c)) && (c <= 2147483623)) && (i <= 9)) && (j == 10))) || (((((c <= 4) && (0 <= c)) && (0 <= i)) && (7 == j)) && (i <= 9))) || (((((6 == j) && (0 <= c)) && (0 <= i)) && (i <= 9)) && (c <= 3))) || (((((c <= 2147483628) && (6 == j)) && (0 <= c)) && (i <= 9)) && (8 <= i))) || (((((j == 4) && (0 <= c)) && (i <= 9)) && (6 <= i)) && (c <= 2147483608))) || (((((c <= 2147483634) && (0 <= c)) && (12 <= j)) && (i <= 9)) && (8 <= i))) || (((((0 <= c) && (j == 11)) && (c <= 44)) && (i <= 9)) && (4 <= i))) || (((((0 <= c) && (i <= 9)) && (4 <= i)) && (c <= 41)) && (j == 8))) || (((((c <= 27) && (0 <= c)) && (3 <= i)) && (3 == j)) && (i <= 9))) || (((((5 <= i) && (c <= 2147483602)) && (0 <= c)) && (7 == j)) && (i <= 9))) || (((((j == 4) && (0 <= c)) && (c <= 2147483626)) && (i <= 9)) && (8 <= i))) || (((((0 <= c) && (c <= 23)) && (2 <= i)) && (i <= 9)) && (j == 8))) || ((((9 == i) && (0 <= c)) && (12 <= j)) && (c <= 2147483643))) || (((((c <= 2147483616) && (0 <= c)) && (12 <= j)) && (i <= 9)) && (6 <= i))) || (((((c <= 42) && (0 <= c)) && (9 == j)) && (i <= 9)) && (4 <= i))) || (((((1 <= i) && (0 <= c)) && (i <= 9)) && (j == 10)) && (c <= 16))) || (((((0 <= c) && (i <= 9)) && (c <= 2147483630)) && (8 <= i)) && (j == 8))) || (((((0 <= c) && (0 <= i)) && (12 <= j)) && (c <= 9)) && (i <= 9))) || (((((7 <= i) && (0 <= c)) && (c <= 2147483618)) && (i <= 9)) && (5 == j))) || (((((j == 4) && (c <= 28)) && (0 <= c)) && (3 <= i)) && (i <= 9))) || (((((6 == j) && (c <= 39)) && (0 <= c)) && (i <= 9)) && (4 <= i))) || (((((j == 4) && (5 <= i)) && (0 <= c)) && (i <= 9)) && (c <= 46))) || (((((1 <= i) && (0 <= c)) && (3 == j)) && (c <= 9)) && (i <= 9))) || (((((1 <= i) && (0 <= c)) && (c <= 11)) && (i <= 9)) && (5 == j))) || (((((c <= 2147483607) && (5 <= i)) && (0 <= c)) && (12 <= j)) && (i <= 9))) || (((((c <= 2147483633) && (0 <= c)) && (j == 11)) && (i <= 9)) && (8 <= i))) || (((((0 <= c) && (3 <= i)) && (i <= 9)) && (c <= 29)) && (5 == j))) || (((((7 <= i) && (c <= 2147483619)) && (6 == j)) && (0 <= c)) && (i <= 9))) || ((((9 == i) && (0 <= c)) && (j == 11)) && (c <= 2147483642))) || ((((c <= 2147483641) && (9 == i)) && (0 <= c)) && (j == 10))) || (((((j == 4) && (c <= 19)) && (0 <= c)) && (2 <= i)) && (i <= 9))) || ((((9 == i) && (c <= 2147483634)) && (0 <= c)) && (3 == j))) || ((((9 == i) && (c <= 2147483638)) && (0 <= c)) && (7 == j))) || ((((9 == i) && (c <= 2147483639)) && (0 <= c)) && (j == 8))) || (((((c <= 5) && (0 <= c)) && (0 <= i)) && (i <= 9)) && (j == 8))) || (((((1 <= i) && (0 <= c)) && (j == 11)) && (i <= 9)) && (c <= 17))) || ((((9 == i) && (0 <= c)) && (9 == j)) && (c <= 2147483640))) || (((((c <= 22) && (0 <= c)) && (7 == j)) && (2 <= i)) && (i <= 9))) || (((((c <= 36) && (0 <= c)) && (3 <= i)) && (12 <= j)) && (i <= 9))) || (((((0 <= c) && (0 <= i)) && (c <= 7)) && (i <= 9)) && (j == 10))) || (((((c <= 2147483621) && (7 <= i)) && (0 <= c)) && (i <= 9)) && (j == 8))) || (((((6 == j) && (5 <= i)) && (0 <= c)) && (c <= 2147483601)) && (i <= 9))) || (((((7 <= i) && (0 <= c)) && (c <= 2147483624)) && (j == 11)) && (i <= 9))) || ((((c <= 2147483636) && (9 == i)) && (0 <= c)) && (5 == j))) || (((((0 <= c) && (0 <= i)) && (c <= 2)) && (i <= 9)) && (5 == j))) || (((((0 <= c) && (3 <= i)) && (i <= 9)) && (j == 10)) && (c <= 34))) || (((((0 <= c) && (3 == j)) && (2 <= i)) && (c <= 18)) && (i <= 9))) || (((((0 <= c) && (3 <= i)) && (i <= 9)) && (c <= 32)) && (j == 8))) || (((((5 <= i) && (c <= 45)) && (0 <= c)) && (3 == j)) && (i <= 9))) || (((((c <= 2147483625) && (0 <= c)) && (3 == j)) && (i <= 9)) && (8 <= i))) || (((((c <= 2147483631) && (0 <= c)) && (9 == j)) && (i <= 9)) && (8 <= i))) || (((((7 <= i) && (0 <= c)) && (9 == j)) && (i <= 9)) && (c <= 2147483622))) || ((((j == 4) && (9 == i)) && (0 <= c)) && (c <= 2147483635))) || (((((1 <= i) && (0 <= c)) && (12 <= j)) && (c <= 18)) && (i <= 9))) || (((((0 <= c) && (i <= 9)) && (5 == j)) && (6 <= i)) && (c <= 2147483609))) || (((((j == 4) && (c <= 37)) && (0 <= c)) && (i <= 9)) && (4 <= i))) || (((((1 <= i) && (6 == j)) && (0 <= c)) && (c <= 12)) && (i <= 9))) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: (((((((((((((c <= 2147483625) && (0 <= c)) && (8 <= i)) || (((0 <= c) && (2 <= i)) && (c <= 18))) || (((c <= 27) && (0 <= c)) && (3 <= i))) || (((5 <= i) && (c <= 45)) && (0 <= c))) || (((1 <= i) && (0 <= c)) && (c <= 9))) || (((7 <= i) && (c <= 2147483616)) && (0 <= c))) || (((c <= 2147483607) && (0 <= c)) && (6 <= i))) || (((c <= 2147483634) && (0 <= c)) && (9 <= i))) || (((c <= 36) && (0 <= c)) && (4 <= i))) || ((c == 0) && (i == 0))) || (((10 <= i) && (0 <= c)) && (c <= 2147483643))) RESULT: Ultimate proved your program to be correct! [2024-11-07 19:59:18,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE