./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/EvenOdd03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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/recursive/EvenOdd03.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash eda92234de2991558d0fa68c10405194bf8879d4d71f81bbe5c79bf2cf318fe2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:30:08,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:30:08,715 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:30:08,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:30:08,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:30:08,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:30:08,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:30:08,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:30:08,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:30:08,750 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:30:08,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:30:08,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:30:08,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:30:08,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:30:08,751 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:30:08,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:30:08,751 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:30:08,752 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:30:08,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:30:08,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:30:08,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:30:08,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:30:08,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:30:08,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:30:08,753 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:30:08,753 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:30:08,753 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:30:08,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:30:08,754 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:30:08,754 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:30:08,754 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:30:08,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:30:08,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:30:08,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:30:08,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:30:08,754 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:30:08,754 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:30:08,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:30:08,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:30:08,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:30:08,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:30:08,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:30:08,754 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:30:08,755 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:30:08,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:30:08,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:30:08,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:30:08,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:30:08,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:30:08,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:30:08,755 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eda92234de2991558d0fa68c10405194bf8879d4d71f81bbe5c79bf2cf318fe2 [2025-01-10 02:30:09,044 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:30:09,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:30:09,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:30:09,059 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:30:09,059 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:30:09,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/EvenOdd03.c [2025-01-10 02:30:10,342 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/236cf684b/aed8d98f43ad4024a92706db918e650d/FLAG8a230b1cb [2025-01-10 02:30:10,613 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:30:10,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursive/EvenOdd03.c [2025-01-10 02:30:10,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/236cf684b/aed8d98f43ad4024a92706db918e650d/FLAG8a230b1cb [2025-01-10 02:30:10,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/236cf684b/aed8d98f43ad4024a92706db918e650d [2025-01-10 02:30:10,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:30:10,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:30:10,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:30:10,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:30:10,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:30:10,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:30:10" (1/1) ... [2025-01-10 02:30:10,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e45b1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10, skipping insertion in model container [2025-01-10 02:30:10,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:30:10" (1/1) ... [2025-01-10 02:30:10,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:30:10,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:30:10,829 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:30:10,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:30:10,859 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:30:10,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10 WrapperNode [2025-01-10 02:30:10,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:30:10,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:30:10,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:30:10,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:30:10,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10" (1/1) ... [2025-01-10 02:30:10,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10" (1/1) ... [2025-01-10 02:30:10,887 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 28 [2025-01-10 02:30:10,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:30:10,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:30:10,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:30:10,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:30:10,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10" (1/1) ... [2025-01-10 02:30:10,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10" (1/1) ... [2025-01-10 02:30:10,899 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10" (1/1) ... [2025-01-10 02:30:10,910 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 02:30:10,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10" (1/1) ... [2025-01-10 02:30:10,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10" (1/1) ... [2025-01-10 02:30:10,912 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10" (1/1) ... [2025-01-10 02:30:10,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10" (1/1) ... [2025-01-10 02:30:10,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10" (1/1) ... [2025-01-10 02:30:10,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10" (1/1) ... [2025-01-10 02:30:10,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10" (1/1) ... [2025-01-10 02:30:10,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:30:10,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:30:10,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:30:10,918 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:30:10,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10" (1/1) ... [2025-01-10 02:30:10,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:30:10,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:10,952 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) [2025-01-10 02:30:10,954 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 [2025-01-10 02:30:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:30:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure isEven [2025-01-10 02:30:10,977 INFO L138 BoogieDeclarations]: Found implementation of procedure isEven [2025-01-10 02:30:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:30:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure isOdd [2025-01-10 02:30:10,977 INFO L138 BoogieDeclarations]: Found implementation of procedure isOdd [2025-01-10 02:30:10,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:30:10,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:30:11,029 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:30:11,030 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:30:11,175 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-10 02:30:11,175 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:30:11,186 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:30:11,186 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 02:30:11,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:30:11 BoogieIcfgContainer [2025-01-10 02:30:11,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:30:11,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:30:11,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:30:11,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:30:11,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:30:10" (1/3) ... [2025-01-10 02:30:11,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131c7d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:30:11, skipping insertion in model container [2025-01-10 02:30:11,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:30:10" (2/3) ... [2025-01-10 02:30:11,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131c7d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:30:11, skipping insertion in model container [2025-01-10 02:30:11,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:30:11" (3/3) ... [2025-01-10 02:30:11,200 INFO L128 eAbstractionObserver]: Analyzing ICFG EvenOdd03.c [2025-01-10 02:30:11,213 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:30:11,216 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG EvenOdd03.c that has 3 procedures, 33 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-01-10 02:30:11,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:30:11,281 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;@5af4e15e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:30:11,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-10 02:30:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.434782608695652) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 02:30:11,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 02:30:11,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:11,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:11,291 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:30:11,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:11,298 INFO L85 PathProgramCache]: Analyzing trace with hash -591639301, now seen corresponding path program 1 times [2025-01-10 02:30:11,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:11,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742273494] [2025-01-10 02:30:11,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:11,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:11,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 02:30:11,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 02:30:11,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:11,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:11,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:11,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742273494] [2025-01-10 02:30:11,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742273494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:11,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:30:11,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:30:11,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428609474] [2025-01-10 02:30:11,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:11,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:30:11,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:11,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:30:11,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:30:11,497 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.434782608695652) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:11,598 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-01-10 02:30:11,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:30:11,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 02:30:11,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:11,607 INFO L225 Difference]: With dead ends: 49 [2025-01-10 02:30:11,607 INFO L226 Difference]: Without dead ends: 27 [2025-01-10 02:30:11,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:30:11,614 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:11,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 110 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:30:11,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-01-10 02:30:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2025-01-10 02:30:11,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:11,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2025-01-10 02:30:11,645 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 8 [2025-01-10 02:30:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:11,645 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2025-01-10 02:30:11,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2025-01-10 02:30:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-10 02:30:11,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:11,646 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:11,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:30:11,646 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:30:11,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:11,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1160949105, now seen corresponding path program 1 times [2025-01-10 02:30:11,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:11,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362031947] [2025-01-10 02:30:11,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:11,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:11,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 02:30:11,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 02:30:11,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:11,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:11,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:11,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:11,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362031947] [2025-01-10 02:30:11,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362031947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:11,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:30:11,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 02:30:11,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607435751] [2025-01-10 02:30:11,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:11,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 02:30:11,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:11,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 02:30:11,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 02:30:11,706 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:11,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:11,757 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2025-01-10 02:30:11,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 02:30:11,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-10 02:30:11,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:11,759 INFO L225 Difference]: With dead ends: 27 [2025-01-10 02:30:11,759 INFO L226 Difference]: Without dead ends: 26 [2025-01-10 02:30:11,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:30:11,760 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:11,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 55 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:30:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-10 02:30:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2025-01-10 02:30:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2025-01-10 02:30:11,767 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 9 [2025-01-10 02:30:11,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:11,768 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2025-01-10 02:30:11,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:11,768 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2025-01-10 02:30:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-10 02:30:11,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:11,769 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:11,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:30:11,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:30:11,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:11,771 INFO L85 PathProgramCache]: Analyzing trace with hash -479178581, now seen corresponding path program 1 times [2025-01-10 02:30:11,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:11,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8274863] [2025-01-10 02:30:11,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:11,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:11,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 02:30:11,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 02:30:11,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:11,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:11,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:11,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8274863] [2025-01-10 02:30:11,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8274863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:11,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:30:11,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:30:11,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157887958] [2025-01-10 02:30:11,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:11,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:30:11,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:11,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:30:11,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:30:11,920 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:11,989 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2025-01-10 02:30:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:30:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-10 02:30:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:11,991 INFO L225 Difference]: With dead ends: 34 [2025-01-10 02:30:11,991 INFO L226 Difference]: Without dead ends: 33 [2025-01-10 02:30:11,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:30:11,992 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 13 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:11,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 55 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:30:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-01-10 02:30:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2025-01-10 02:30:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 25 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:11,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2025-01-10 02:30:11,997 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 14 [2025-01-10 02:30:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:11,997 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2025-01-10 02:30:11,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:11,997 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2025-01-10 02:30:11,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-10 02:30:11,998 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:11,998 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:11,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:30:11,998 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting isOddErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:30:11,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:11,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1969634065, now seen corresponding path program 1 times [2025-01-10 02:30:11,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:11,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153878297] [2025-01-10 02:30:11,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:11,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:12,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 02:30:12,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 02:30:12,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:12,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:12,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:12,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153878297] [2025-01-10 02:30:12,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153878297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:30:12,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:30:12,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:30:12,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584750964] [2025-01-10 02:30:12,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:30:12,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:30:12,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:12,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:30:12,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:30:12,100 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:12,157 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2025-01-10 02:30:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:30:12,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-10 02:30:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:12,158 INFO L225 Difference]: With dead ends: 30 [2025-01-10 02:30:12,158 INFO L226 Difference]: Without dead ends: 28 [2025-01-10 02:30:12,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:30:12,159 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:12,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 26 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 02:30:12,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-01-10 02:30:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-01-10 02:30:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2025-01-10 02:30:12,164 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2025-01-10 02:30:12,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:12,164 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2025-01-10 02:30:12,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2025-01-10 02:30:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 02:30:12,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:12,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:30:12,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:30:12,165 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:30:12,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:12,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1065420109, now seen corresponding path program 1 times [2025-01-10 02:30:12,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:12,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952719366] [2025-01-10 02:30:12,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:12,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:12,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 02:30:12,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 02:30:12,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:12,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:12,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:12,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952719366] [2025-01-10 02:30:12,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952719366] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:12,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477516] [2025-01-10 02:30:12,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:12,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:12,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:12,294 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) [2025-01-10 02:30:12,295 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 [2025-01-10 02:30:12,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 02:30:12,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 02:30:12,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:12,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:12,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 02:30:12,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:12,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:12,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477516] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:12,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:12,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-01-10 02:30:12,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932360137] [2025-01-10 02:30:12,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:12,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-10 02:30:12,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:12,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 02:30:12,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-01-10 02:30:12,541 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 16 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 10 states have internal predecessors, (32), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:12,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:12,698 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2025-01-10 02:30:12,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 02:30:12,699 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 10 states have internal predecessors, (32), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-10 02:30:12,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:12,700 INFO L225 Difference]: With dead ends: 50 [2025-01-10 02:30:12,702 INFO L226 Difference]: Without dead ends: 48 [2025-01-10 02:30:12,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-01-10 02:30:12,703 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 45 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:12,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 68 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:30:12,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-01-10 02:30:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2025-01-10 02:30:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.054054054054054) internal successors, (39), 38 states have internal predecessors, (39), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2025-01-10 02:30:12,716 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 20 [2025-01-10 02:30:12,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:12,716 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2025-01-10 02:30:12,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 10 states have internal predecessors, (32), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2025-01-10 02:30:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-10 02:30:12,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:12,718 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 02:30:12,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 02:30:12,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:12,919 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:30:12,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:12,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1608250545, now seen corresponding path program 1 times [2025-01-10 02:30:12,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:12,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854280314] [2025-01-10 02:30:12,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:12,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:12,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 02:30:12,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 02:30:12,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:12,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:13,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:13,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854280314] [2025-01-10 02:30:13,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854280314] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:13,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145843605] [2025-01-10 02:30:13,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:30:13,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:13,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:13,182 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) [2025-01-10 02:30:13,184 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 [2025-01-10 02:30:13,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-10 02:30:13,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-10 02:30:13,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:30:13,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:13,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-10 02:30:13,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:13,308 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:13,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:13,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145843605] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:13,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:13,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2025-01-10 02:30:13,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784879975] [2025-01-10 02:30:13,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:13,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-10 02:30:13,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:13,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-10 02:30:13,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2025-01-10 02:30:13,591 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 28 states, 25 states have (on average 2.48) internal successors, (62), 16 states have internal predecessors, (62), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:13,908 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2025-01-10 02:30:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-10 02:30:13,909 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.48) internal successors, (62), 16 states have internal predecessors, (62), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-01-10 02:30:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:13,910 INFO L225 Difference]: With dead ends: 92 [2025-01-10 02:30:13,910 INFO L226 Difference]: Without dead ends: 90 [2025-01-10 02:30:13,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=1308, Unknown=0, NotChecked=0, Total=1560 [2025-01-10 02:30:13,912 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 115 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:13,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 68 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:30:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-10 02:30:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-01-10 02:30:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 72 states have (on average 1.0277777777777777) internal successors, (74), 73 states have internal predecessors, (74), 14 states have call successors, (14), 14 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2025-01-10 02:30:13,921 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 38 [2025-01-10 02:30:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:13,921 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2025-01-10 02:30:13,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.48) internal successors, (62), 16 states have internal predecessors, (62), 12 states have call successors, (12), 12 states have call predecessors, (12), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2025-01-10 02:30:13,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-10 02:30:13,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:13,923 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2025-01-10 02:30:13,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-10 02:30:14,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:14,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:30:14,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:14,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1717557735, now seen corresponding path program 2 times [2025-01-10 02:30:14,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:14,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309220241] [2025-01-10 02:30:14,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:14,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:14,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-01-10 02:30:14,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 02:30:14,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:14,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:14,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309220241] [2025-01-10 02:30:14,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309220241] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995998168] [2025-01-10 02:30:14,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:14,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:14,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:14,773 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) [2025-01-10 02:30:14,776 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 [2025-01-10 02:30:14,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 80 statements into 2 equivalence classes. [2025-01-10 02:30:14,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 80 of 80 statements. [2025-01-10 02:30:14,824 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:14,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:14,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-10 02:30:14,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:14,961 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:14,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:15,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995998168] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:15,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:15,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2025-01-10 02:30:15,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719165338] [2025-01-10 02:30:15,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:15,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-01-10 02:30:15,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:15,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-01-10 02:30:15,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=2656, Unknown=0, NotChecked=0, Total=3080 [2025-01-10 02:30:15,757 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand has 56 states, 53 states have (on average 2.490566037735849) internal successors, (132), 30 states have internal predecessors, (132), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:16,590 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2025-01-10 02:30:16,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-01-10 02:30:16,592 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 53 states have (on average 2.490566037735849) internal successors, (132), 30 states have internal predecessors, (132), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-01-10 02:30:16,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:16,593 INFO L225 Difference]: With dead ends: 170 [2025-01-10 02:30:16,595 INFO L226 Difference]: Without dead ends: 168 [2025-01-10 02:30:16,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=970, Invalid=5510, Unknown=0, NotChecked=0, Total=6480 [2025-01-10 02:30:16,601 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 380 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:16,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 104 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:30:16,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-10 02:30:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2025-01-10 02:30:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.0145985401459854) internal successors, (139), 138 states have internal predecessors, (139), 27 states have call successors, (27), 27 states have call predecessors, (27), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:16,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2025-01-10 02:30:16,625 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 80 [2025-01-10 02:30:16,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:16,626 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2025-01-10 02:30:16,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 53 states have (on average 2.490566037735849) internal successors, (132), 30 states have internal predecessors, (132), 26 states have call successors, (26), 26 states have call predecessors, (26), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2025-01-10 02:30:16,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-10 02:30:16,636 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:16,637 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2025-01-10 02:30:16,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-10 02:30:16,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:16,838 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:30:16,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:16,839 INFO L85 PathProgramCache]: Analyzing trace with hash -515335037, now seen corresponding path program 2 times [2025-01-10 02:30:16,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:16,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133717920] [2025-01-10 02:30:16,840 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:16,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:16,856 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-01-10 02:30:16,891 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-01-10 02:30:16,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:16,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:18,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133717920] [2025-01-10 02:30:18,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133717920] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:18,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418230253] [2025-01-10 02:30:18,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 02:30:18,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:18,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:18,513 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) [2025-01-10 02:30:18,515 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 [2025-01-10 02:30:18,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-01-10 02:30:18,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-01-10 02:30:18,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 02:30:18,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:18,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-01-10 02:30:18,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:18,817 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:18,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:20,646 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:20,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418230253] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:20,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:20,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2025-01-10 02:30:20,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168054106] [2025-01-10 02:30:20,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:20,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2025-01-10 02:30:20,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:20,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2025-01-10 02:30:20,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1514, Invalid=10042, Unknown=0, NotChecked=0, Total=11556 [2025-01-10 02:30:20,653 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand has 108 states, 105 states have (on average 2.4952380952380953) internal successors, (262), 56 states have internal predecessors, (262), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:22,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:22,407 INFO L93 Difference]: Finished difference Result 332 states and 357 transitions. [2025-01-10 02:30:22,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-01-10 02:30:22,407 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 105 states have (on average 2.4952380952380953) internal successors, (262), 56 states have internal predecessors, (262), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2025-01-10 02:30:22,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:22,409 INFO L225 Difference]: With dead ends: 332 [2025-01-10 02:30:22,409 INFO L226 Difference]: Without dead ends: 330 [2025-01-10 02:30:22,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7600 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3672, Invalid=21768, Unknown=0, NotChecked=0, Total=25440 [2025-01-10 02:30:22,414 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 945 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:22,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 156 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-10 02:30:22,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-10 02:30:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2025-01-10 02:30:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 272 states have (on average 1.0073529411764706) internal successors, (274), 273 states have internal predecessors, (274), 54 states have call successors, (54), 54 states have call predecessors, (54), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2025-01-10 02:30:22,437 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 158 [2025-01-10 02:30:22,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:22,438 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2025-01-10 02:30:22,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 105 states have (on average 2.4952380952380953) internal successors, (262), 56 states have internal predecessors, (262), 52 states have call successors, (52), 52 states have call predecessors, (52), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:22,438 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2025-01-10 02:30:22,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-01-10 02:30:22,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:22,444 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1] [2025-01-10 02:30:22,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:30:22,644 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,SelfDestructingSolverStorable7 [2025-01-10 02:30:22,644 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:30:22,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:22,645 INFO L85 PathProgramCache]: Analyzing trace with hash -958812593, now seen corresponding path program 3 times [2025-01-10 02:30:22,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:22,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849098909] [2025-01-10 02:30:22,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:30:22,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:22,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 320 statements into 27 equivalence classes. [2025-01-10 02:30:22,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 320 of 320 statements. [2025-01-10 02:30:22,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-01-10 02:30:22,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:27,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4004 backedges. 0 proven. 4004 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:27,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:27,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849098909] [2025-01-10 02:30:27,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849098909] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:27,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173763850] [2025-01-10 02:30:27,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:30:27,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:27,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:27,966 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) [2025-01-10 02:30:27,967 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 [2025-01-10 02:30:27,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 320 statements into 27 equivalence classes. [2025-01-10 02:30:28,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 320 of 320 statements. [2025-01-10 02:30:28,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-01-10 02:30:28,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:28,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-01-10 02:30:28,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:30:28,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4004 backedges. 0 proven. 4004 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:28,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:30:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4004 backedges. 0 proven. 4004 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:34,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173763850] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:30:34,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:30:34,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2025-01-10 02:30:34,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251025871] [2025-01-10 02:30:34,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:30:34,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 216 states [2025-01-10 02:30:34,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:30:34,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2025-01-10 02:30:34,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5944, Invalid=40496, Unknown=0, NotChecked=0, Total=46440 [2025-01-10 02:30:34,787 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand has 216 states, 213 states have (on average 2.4976525821596245) internal successors, (532), 110 states have internal predecessors, (532), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:41,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:30:41,084 INFO L93 Difference]: Finished difference Result 650 states and 701 transitions. [2025-01-10 02:30:41,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2025-01-10 02:30:41,086 INFO L78 Accepts]: Start accepts. Automaton has has 216 states, 213 states have (on average 2.4976525821596245) internal successors, (532), 110 states have internal predecessors, (532), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 320 [2025-01-10 02:30:41,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:30:41,089 INFO L225 Difference]: With dead ends: 650 [2025-01-10 02:30:41,089 INFO L226 Difference]: Without dead ends: 648 [2025-01-10 02:30:41,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 319 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32497 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=14530, Invalid=88190, Unknown=0, NotChecked=0, Total=102720 [2025-01-10 02:30:41,102 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 1820 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1820 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-10 02:30:41,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1820 Valid, 134 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-10 02:30:41,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2025-01-10 02:30:41,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 646. [2025-01-10 02:30:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 537 states have (on average 1.0037243947858474) internal successors, (539), 538 states have internal predecessors, (539), 107 states have call successors, (107), 107 states have call predecessors, (107), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 646 transitions. [2025-01-10 02:30:41,136 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 646 transitions. Word has length 320 [2025-01-10 02:30:41,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:30:41,137 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 646 transitions. [2025-01-10 02:30:41,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 216 states, 213 states have (on average 2.4976525821596245) internal successors, (532), 110 states have internal predecessors, (532), 106 states have call successors, (106), 106 states have call predecessors, (106), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:30:41,138 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 646 transitions. [2025-01-10 02:30:41,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 639 [2025-01-10 02:30:41,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:30:41,150 INFO L218 NwaCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 52, 52, 52, 1, 1, 1, 1, 1] [2025-01-10 02:30:41,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 02:30:41,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:41,354 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [isEvenErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, isEvenErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, isOddErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-01-10 02:30:41,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:30:41,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1777002835, now seen corresponding path program 3 times [2025-01-10 02:30:41,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:30:41,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634096323] [2025-01-10 02:30:41,355 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:30:41,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:30:41,371 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 638 statements into 53 equivalence classes. [2025-01-10 02:30:41,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) and asserted 638 of 638 statements. [2025-01-10 02:30:41,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2025-01-10 02:30:41,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16432 backedges. 0 proven. 16432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:30:59,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:30:59,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634096323] [2025-01-10 02:30:59,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634096323] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 02:30:59,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281905579] [2025-01-10 02:30:59,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-10 02:30:59,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:30:59,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:30:59,254 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) [2025-01-10 02:30:59,255 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 [2025-01-10 02:30:59,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 638 statements into 53 equivalence classes. [2025-01-10 02:30:59,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) and asserted 638 of 638 statements. [2025-01-10 02:30:59,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2025-01-10 02:30:59,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:30:59,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 214 conjuncts are in the unsatisfiable core [2025-01-10 02:30:59,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:31:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 16432 backedges. 0 proven. 16432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:00,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 02:31:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 16432 backedges. 0 proven. 16432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:31:23,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281905579] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 02:31:23,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 02:31:23,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [214, 214, 214] total 427 [2025-01-10 02:31:23,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35265182] [2025-01-10 02:31:23,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 02:31:23,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 428 states [2025-01-10 02:31:23,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:31:23,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 428 interpolants. [2025-01-10 02:31:23,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23114, Invalid=159642, Unknown=0, NotChecked=0, Total=182756 [2025-01-10 02:31:23,122 INFO L87 Difference]: Start difference. First operand 646 states and 646 transitions. Second operand has 428 states, 425 states have (on average 2.498823529411765) internal successors, (1062), 216 states have internal predecessors, (1062), 212 states have call successors, (212), 212 states have call predecessors, (212), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)