./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/array-crafted/bAnd4.i --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/array-crafted/bAnd4.i -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 509fca01259c1f1b00d88cc0da560b766d69c2e05ff96a251a9cfffa2096619e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 01:20:47,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 01:20:47,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 01:20:47,812 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 01:20:47,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 01:20:47,838 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 01:20:47,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 01:20:47,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 01:20:47,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 01:20:47,839 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 01:20:47,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 01:20:47,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 01:20:47,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 01:20:47,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 01:20:47,841 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 01:20:47,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 01:20:47,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 01:20:47,841 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 01:20:47,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 01:20:47,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 01:20:47,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 01:20:47,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 01:20:47,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 01:20:47,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 01:20:47,842 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 01:20:47,842 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 01:20:47,842 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 01:20:47,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 01:20:47,842 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 01:20:47,842 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 01:20:47,843 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 01:20:47,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:20:47,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:20:47,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:20:47,843 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:20:47,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 01:20:47,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 01:20:47,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 01:20:47,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 01:20:47,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:20:47,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 01:20:47,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 01:20:47,844 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 01:20:47,844 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 01:20:47,844 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 01:20:47,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 01:20:47,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 01:20:47,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 01:20:47,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 01:20:47,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 01:20:47,844 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 -> 509fca01259c1f1b00d88cc0da560b766d69c2e05ff96a251a9cfffa2096619e [2025-01-10 01:20:48,095 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 01:20:48,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 01:20:48,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 01:20:48,108 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 01:20:48,108 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 01:20:48,110 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bAnd4.i [2025-01-10 01:20:49,249 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb441f5ac/655247499ca0491da39f7d060a25d6ed/FLAGb7c5cb729 [2025-01-10 01:20:49,452 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 01:20:49,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd4.i [2025-01-10 01:20:49,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb441f5ac/655247499ca0491da39f7d060a25d6ed/FLAGb7c5cb729 [2025-01-10 01:20:49,819 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fb441f5ac/655247499ca0491da39f7d060a25d6ed [2025-01-10 01:20:49,821 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 01:20:49,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 01:20:49,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 01:20:49,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 01:20:49,826 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 01:20:49,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:20:49" (1/1) ... [2025-01-10 01:20:49,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@642e99a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:49, skipping insertion in model container [2025-01-10 01:20:49,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:20:49" (1/1) ... [2025-01-10 01:20:49,837 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 01:20:49,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:20:49,966 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 01:20:49,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 01:20:50,000 INFO L204 MainTranslator]: Completed translation [2025-01-10 01:20:50,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:50 WrapperNode [2025-01-10 01:20:50,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 01:20:50,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 01:20:50,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 01:20:50,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 01:20:50,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:50" (1/1) ... [2025-01-10 01:20:50,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:50" (1/1) ... [2025-01-10 01:20:50,032 INFO L138 Inliner]: procedures = 16, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2025-01-10 01:20:50,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 01:20:50,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 01:20:50,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 01:20:50,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 01:20:50,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:50" (1/1) ... [2025-01-10 01:20:50,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:50" (1/1) ... [2025-01-10 01:20:50,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:50" (1/1) ... [2025-01-10 01:20:50,061 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 5 writes are split as follows [0, 0, 5]. [2025-01-10 01:20:50,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:50" (1/1) ... [2025-01-10 01:20:50,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:50" (1/1) ... [2025-01-10 01:20:50,068 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:50" (1/1) ... [2025-01-10 01:20:50,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:50" (1/1) ... [2025-01-10 01:20:50,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:50" (1/1) ... [2025-01-10 01:20:50,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:50" (1/1) ... [2025-01-10 01:20:50,075 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:50" (1/1) ... [2025-01-10 01:20:50,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 01:20:50,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 01:20:50,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 01:20:50,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 01:20:50,078 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:50" (1/1) ... [2025-01-10 01:20:50,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 01:20:50,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:20:50,110 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 01:20:50,114 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 01:20:50,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 01:20:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 01:20:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 01:20:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 01:20:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 01:20:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 01:20:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 01:20:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 01:20:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2025-01-10 01:20:50,134 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2025-01-10 01:20:50,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 01:20:50,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 01:20:50,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 01:20:50,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 01:20:50,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 01:20:50,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 01:20:50,193 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 01:20:50,195 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 01:20:50,344 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-01-10 01:20:50,344 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 01:20:50,351 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 01:20:50,351 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 01:20:50,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:20:50 BoogieIcfgContainer [2025-01-10 01:20:50,351 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 01:20:50,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 01:20:50,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 01:20:50,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 01:20:50,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:20:49" (1/3) ... [2025-01-10 01:20:50,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f7afce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:20:50, skipping insertion in model container [2025-01-10 01:20:50,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:20:50" (2/3) ... [2025-01-10 01:20:50,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f7afce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:20:50, skipping insertion in model container [2025-01-10 01:20:50,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:20:50" (3/3) ... [2025-01-10 01:20:50,358 INFO L128 eAbstractionObserver]: Analyzing ICFG bAnd4.i [2025-01-10 01:20:50,370 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 01:20:50,372 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bAnd4.i that has 2 procedures, 41 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-01-10 01:20:50,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 01:20:50,421 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;@e2ed10b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 01:20:50,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-10 01:20:50,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-10 01:20:50,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-10 01:20:50,429 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:50,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-10 01:20:50,429 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:50,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1695236, now seen corresponding path program 1 times [2025-01-10 01:20:50,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:50,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996466845] [2025-01-10 01:20:50,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:50,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:50,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 01:20:50,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 01:20:50,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:50,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:50,629 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 01:20:50,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:50,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996466845] [2025-01-10 01:20:50,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996466845] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:50,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:50,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:20:50,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269742841] [2025-01-10 01:20:50,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:50,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:20:50,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:50,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:20:50,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:50,651 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:50,698 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2025-01-10 01:20:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:20:50,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-01-10 01:20:50,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:50,704 INFO L225 Difference]: With dead ends: 79 [2025-01-10 01:20:50,704 INFO L226 Difference]: Without dead ends: 36 [2025-01-10 01:20:50,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:50,708 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:50,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 122 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:50,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-01-10 01:20:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-01-10 01:20:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 32 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:20:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-01-10 01:20:50,740 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 4 [2025-01-10 01:20:50,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:50,740 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-01-10 01:20:50,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:50,741 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-01-10 01:20:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-10 01:20:50,741 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:50,741 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-01-10 01:20:50,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 01:20:50,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:50,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:50,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1036767457, now seen corresponding path program 1 times [2025-01-10 01:20:50,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:50,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933561668] [2025-01-10 01:20:50,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:50,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:20:50,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:20:50,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:50,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:20:50,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:50,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933561668] [2025-01-10 01:20:50,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933561668] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:20:50,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270907426] [2025-01-10 01:20:50,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:50,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:20:50,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:20:50,862 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 01:20:50,864 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 01:20:50,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 01:20:50,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 01:20:50,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:50,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:50,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 01:20:50,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:20:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:20:50,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:20:50,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270907426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:50,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:20:50,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-01-10 01:20:50,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015479651] [2025-01-10 01:20:50,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:50,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 01:20:50,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:50,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 01:20:50,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:20:50,984 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:51,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:51,013 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2025-01-10 01:20:51,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 01:20:51,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-10 01:20:51,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:51,014 INFO L225 Difference]: With dead ends: 36 [2025-01-10 01:20:51,014 INFO L226 Difference]: Without dead ends: 35 [2025-01-10 01:20:51,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 01:20:51,015 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:51,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 161 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-01-10 01:20:51,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-01-10 01:20:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.5) internal successors, (36), 31 states have internal predecessors, (36), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:20:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-01-10 01:20:51,021 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 7 [2025-01-10 01:20:51,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:51,021 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-01-10 01:20:51,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-01-10 01:20:51,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-10 01:20:51,022 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:51,022 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-01-10 01:20:51,030 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 01:20:51,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:20:51,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:51,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:51,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2075020030, now seen corresponding path program 1 times [2025-01-10 01:20:51,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:51,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030560767] [2025-01-10 01:20:51,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:51,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:51,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 01:20:51,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 01:20:51,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:51,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 01:20:51,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:51,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030560767] [2025-01-10 01:20:51,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030560767] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:51,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:51,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:20:51,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757959278] [2025-01-10 01:20:51,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:51,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:20:51,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:51,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:20:51,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:20:51,286 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:51,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:51,296 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2025-01-10 01:20:51,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:20:51,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-01-10 01:20:51,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:51,298 INFO L225 Difference]: With dead ends: 35 [2025-01-10 01:20:51,298 INFO L226 Difference]: Without dead ends: 34 [2025-01-10 01:20:51,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:20:51,299 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:51,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-10 01:20:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-01-10 01:20:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.5) internal successors, (33), 28 states have internal predecessors, (33), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:20:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-01-10 01:20:51,305 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 8 [2025-01-10 01:20:51,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:51,306 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-01-10 01:20:51,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:51,306 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-01-10 01:20:51,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-10 01:20:51,306 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:51,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:51,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 01:20:51,307 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:51,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:51,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1841242208, now seen corresponding path program 1 times [2025-01-10 01:20:51,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:51,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526818928] [2025-01-10 01:20:51,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:51,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:51,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:20:51,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:20:51,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:51,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:20:51,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:51,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526818928] [2025-01-10 01:20:51,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526818928] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:20:51,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548517511] [2025-01-10 01:20:51,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:51,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:20:51,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:20:51,369 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 01:20:51,370 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 01:20:51,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 01:20:51,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 01:20:51,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:51,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:51,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 01:20:51,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:20:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:20:51,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:20:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 01:20:51,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548517511] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:20:51,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:20:51,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-10 01:20:51,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100293619] [2025-01-10 01:20:51,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:20:51,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 01:20:51,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:51,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 01:20:51,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:20:51,487 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 01:20:51,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:51,522 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2025-01-10 01:20:51,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 01:20:51,526 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 12 [2025-01-10 01:20:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:51,527 INFO L225 Difference]: With dead ends: 64 [2025-01-10 01:20:51,528 INFO L226 Difference]: Without dead ends: 38 [2025-01-10 01:20:51,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 01:20:51,529 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:51,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-01-10 01:20:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-01-10 01:20:51,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:20:51,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2025-01-10 01:20:51,537 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 12 [2025-01-10 01:20:51,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:51,538 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2025-01-10 01:20:51,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 01:20:51,538 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2025-01-10 01:20:51,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-10 01:20:51,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:51,538 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:51,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 01:20:51,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:20:51,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:51,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:51,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1897552256, now seen corresponding path program 2 times [2025-01-10 01:20:51,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:51,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058294268] [2025-01-10 01:20:51,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:20:51,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:51,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-01-10 01:20:51,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 18 statements. [2025-01-10 01:20:51,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:20:51,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:51,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:20:51,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:51,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058294268] [2025-01-10 01:20:51,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058294268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:51,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:51,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:20:51,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833940339] [2025-01-10 01:20:51,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:51,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:20:51,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:51,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:20:51,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:51,789 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 01:20:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:51,814 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2025-01-10 01:20:51,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:20:51,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 18 [2025-01-10 01:20:51,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:51,816 INFO L225 Difference]: With dead ends: 70 [2025-01-10 01:20:51,816 INFO L226 Difference]: Without dead ends: 45 [2025-01-10 01:20:51,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:51,817 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:51,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 93 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-10 01:20:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-01-10 01:20:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 40 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:20:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-01-10 01:20:51,822 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 18 [2025-01-10 01:20:51,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:51,822 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-01-10 01:20:51,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 01:20:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-01-10 01:20:51,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-10 01:20:51,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:51,823 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:51,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 01:20:51,823 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:51,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:51,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1305422259, now seen corresponding path program 1 times [2025-01-10 01:20:51,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:51,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353811735] [2025-01-10 01:20:51,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:51,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:51,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 01:20:51,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 01:20:51,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:51,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 01:20:51,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:51,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353811735] [2025-01-10 01:20:51,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353811735] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:51,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:51,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:20:51,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494151834] [2025-01-10 01:20:51,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:51,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:20:51,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:51,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:20:51,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:51,888 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 01:20:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:51,907 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-01-10 01:20:51,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:20:51,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 19 [2025-01-10 01:20:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:51,908 INFO L225 Difference]: With dead ends: 46 [2025-01-10 01:20:51,908 INFO L226 Difference]: Without dead ends: 45 [2025-01-10 01:20:51,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:51,909 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:51,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 95 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-01-10 01:20:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-01-10 01:20:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 41 states have internal predecessors, (48), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:20:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-01-10 01:20:51,912 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 19 [2025-01-10 01:20:51,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:51,913 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-01-10 01:20:51,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 01:20:51,913 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-01-10 01:20:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 01:20:51,913 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:51,913 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:51,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 01:20:51,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:51,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:51,916 INFO L85 PathProgramCache]: Analyzing trace with hash 436018584, now seen corresponding path program 1 times [2025-01-10 01:20:51,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:51,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429291792] [2025-01-10 01:20:51,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:51,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:51,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:20:51,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:20:51,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:51,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:20:52,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:52,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429291792] [2025-01-10 01:20:52,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429291792] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:20:52,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140921729] [2025-01-10 01:20:52,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:52,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:20:52,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:20:52,036 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 01:20:52,037 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 01:20:52,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 01:20:52,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 01:20:52,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:52,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:52,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 01:20:52,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:20:52,115 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:20:52,115 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:20:52,212 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:20:52,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140921729] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:20:52,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:20:52,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-10 01:20:52,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920441336] [2025-01-10 01:20:52,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:20:52,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 01:20:52,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:52,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 01:20:52,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:20:52,213 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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 01:20:52,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:52,254 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2025-01-10 01:20:52,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-10 01:20:52,258 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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 23 [2025-01-10 01:20:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:52,259 INFO L225 Difference]: With dead ends: 90 [2025-01-10 01:20:52,259 INFO L226 Difference]: Without dead ends: 57 [2025-01-10 01:20:52,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-10 01:20:52,260 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:52,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:52,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-10 01:20:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-10 01:20:52,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 53 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:20:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2025-01-10 01:20:52,270 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 23 [2025-01-10 01:20:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:52,270 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2025-01-10 01:20:52,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 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 01:20:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2025-01-10 01:20:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-10 01:20:52,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:52,271 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:52,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 01:20:52,472 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 01:20:52,472 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:52,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1443758424, now seen corresponding path program 2 times [2025-01-10 01:20:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:52,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805906132] [2025-01-10 01:20:52,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:20:52,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:52,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:20:52,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:20:52,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:20:52,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-10 01:20:52,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:52,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805906132] [2025-01-10 01:20:52,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805906132] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:20:52,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824872481] [2025-01-10 01:20:52,550 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:20:52,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:20:52,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:20:52,552 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 01:20:52,554 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 01:20:52,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 01:20:52,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 01:20:52,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 01:20:52,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:52,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-10 01:20:52,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:20:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:20:52,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:20:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 01:20:53,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824872481] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:20:53,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:20:53,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 36 [2025-01-10 01:20:53,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567225239] [2025-01-10 01:20:53,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:20:53,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-10 01:20:53,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:53,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-10 01:20:53,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2025-01-10 01:20:53,136 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 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 01:20:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:53,238 INFO L93 Difference]: Finished difference Result 113 states and 137 transitions. [2025-01-10 01:20:53,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-10 01:20:53,242 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 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 35 [2025-01-10 01:20:53,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:53,242 INFO L225 Difference]: With dead ends: 113 [2025-01-10 01:20:53,242 INFO L226 Difference]: Without dead ends: 80 [2025-01-10 01:20:53,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=280, Invalid=980, Unknown=0, NotChecked=0, Total=1260 [2025-01-10 01:20:53,244 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 9 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:53,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 301 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:20:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-10 01:20:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-10 01:20:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 71 states have (on average 1.1690140845070423) internal successors, (83), 76 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:20:53,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2025-01-10 01:20:53,251 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 35 [2025-01-10 01:20:53,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:53,251 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2025-01-10 01:20:53,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 states have internal predecessors, (69), 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 01:20:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2025-01-10 01:20:53,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-10 01:20:53,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:53,254 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:53,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 01:20:53,454 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 01:20:53,455 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:53,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:53,455 INFO L85 PathProgramCache]: Analyzing trace with hash -412863909, now seen corresponding path program 1 times [2025-01-10 01:20:53,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:53,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704658512] [2025-01-10 01:20:53,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:53,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:53,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-10 01:20:53,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-10 01:20:53,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:53,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:53,536 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-01-10 01:20:53,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:53,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704658512] [2025-01-10 01:20:53,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704658512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:53,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:53,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:20:53,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745007707] [2025-01-10 01:20:53,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:53,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:20:53,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:53,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:20:53,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:53,537 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 01:20:53,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:53,549 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2025-01-10 01:20:53,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:20:53,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 60 [2025-01-10 01:20:53,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:53,551 INFO L225 Difference]: With dead ends: 80 [2025-01-10 01:20:53,551 INFO L226 Difference]: Without dead ends: 78 [2025-01-10 01:20:53,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:53,552 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:53,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-10 01:20:53,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2025-01-10 01:20:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.123076923076923) internal successors, (73), 68 states have internal predecessors, (73), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:20:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2025-01-10 01:20:53,562 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 60 [2025-01-10 01:20:53,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:53,563 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2025-01-10 01:20:53,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 01:20:53,563 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2025-01-10 01:20:53,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-01-10 01:20:53,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:53,566 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:53,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 01:20:53,566 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:53,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:53,566 INFO L85 PathProgramCache]: Analyzing trace with hash -838297206, now seen corresponding path program 1 times [2025-01-10 01:20:53,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:53,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773257232] [2025-01-10 01:20:53,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:53,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:53,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 01:20:53,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 01:20:53,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:53,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-01-10 01:20:53,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:53,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773257232] [2025-01-10 01:20:53,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773257232] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:20:53,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971904729] [2025-01-10 01:20:53,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:53,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:20:53,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:20:53,717 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 01:20:53,720 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 01:20:53,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-10 01:20:53,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-10 01:20:53,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:53,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:53,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:20:53,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:20:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-01-10 01:20:53,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:20:53,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971904729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:53,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:20:53,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-10 01:20:53,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281869987] [2025-01-10 01:20:53,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:53,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:20:53,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:53,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:20:53,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:20:53,820 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:20:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:53,832 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2025-01-10 01:20:53,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:20:53,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 72 [2025-01-10 01:20:53,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:53,833 INFO L225 Difference]: With dead ends: 76 [2025-01-10 01:20:53,833 INFO L226 Difference]: Without dead ends: 75 [2025-01-10 01:20:53,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:20:53,834 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:53,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 54 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:53,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-10 01:20:53,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-01-10 01:20:53,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 70 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:20:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2025-01-10 01:20:53,839 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 72 [2025-01-10 01:20:53,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:53,840 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2025-01-10 01:20:53,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:20:53,841 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2025-01-10 01:20:53,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-10 01:20:53,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:53,841 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:53,848 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 01:20:54,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-10 01:20:54,042 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:54,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash -217409531, now seen corresponding path program 1 times [2025-01-10 01:20:54,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:54,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506452148] [2025-01-10 01:20:54,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:54,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 01:20:54,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 01:20:54,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:54,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-01-10 01:20:54,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:54,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506452148] [2025-01-10 01:20:54,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506452148] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:20:54,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390069828] [2025-01-10 01:20:54,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:54,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:20:54,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:20:54,178 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 01:20:54,179 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 01:20:54,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-10 01:20:54,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-10 01:20:54,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:54,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:54,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 01:20:54,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:20:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-01-10 01:20:54,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 01:20:54,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390069828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:54,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 01:20:54,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-10 01:20:54,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034132292] [2025-01-10 01:20:54,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:54,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:20:54,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:54,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:20:54,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:20:54,277 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:20:54,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:54,288 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2025-01-10 01:20:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:20:54,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 73 [2025-01-10 01:20:54,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:54,290 INFO L225 Difference]: With dead ends: 76 [2025-01-10 01:20:54,290 INFO L226 Difference]: Without dead ends: 75 [2025-01-10 01:20:54,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 01:20:54,291 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:54,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:54,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-10 01:20:54,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-01-10 01:20:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 71 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:20:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2025-01-10 01:20:54,295 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 73 [2025-01-10 01:20:54,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:54,295 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2025-01-10 01:20:54,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:20:54,295 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2025-01-10 01:20:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-01-10 01:20:54,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:54,297 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:54,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 01:20:54,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-10 01:20:54,498 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:54,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:54,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1850239212, now seen corresponding path program 1 times [2025-01-10 01:20:54,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:54,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052644992] [2025-01-10 01:20:54,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:54,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:54,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 01:20:54,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 01:20:54,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:54,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-01-10 01:20:54,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:54,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052644992] [2025-01-10 01:20:54,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052644992] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 01:20:54,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081242692] [2025-01-10 01:20:54,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:54,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:20:54,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 01:20:54,610 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 01:20:54,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 01:20:54,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-10 01:20:54,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-10 01:20:54,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:54,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:54,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 01:20:54,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 01:20:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:20:55,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 01:20:56,056 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-10 01:20:56,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081242692] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 01:20:56,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 01:20:56,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 33, 33] total 67 [2025-01-10 01:20:56,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414888886] [2025-01-10 01:20:56,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 01:20:56,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-01-10 01:20:56,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:56,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-01-10 01:20:56,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2025-01-10 01:20:56,059 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 67 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 67 states have internal predecessors, (129), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:20:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:56,214 INFO L93 Difference]: Finished difference Result 161 states and 193 transitions. [2025-01-10 01:20:56,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-01-10 01:20:56,214 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 67 states have internal predecessors, (129), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2025-01-10 01:20:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:56,215 INFO L225 Difference]: With dead ends: 161 [2025-01-10 01:20:56,215 INFO L226 Difference]: Without dead ends: 134 [2025-01-10 01:20:56,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1063, Invalid=3359, Unknown=0, NotChecked=0, Total=4422 [2025-01-10 01:20:56,217 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:56,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 476 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 01:20:56,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-10 01:20:56,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2025-01-10 01:20:56,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 123 states have (on average 1.08130081300813) internal successors, (133), 126 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:20:56,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2025-01-10 01:20:56,223 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 74 [2025-01-10 01:20:56,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:56,223 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2025-01-10 01:20:56,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 67 states have internal predecessors, (129), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-10 01:20:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2025-01-10 01:20:56,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-10 01:20:56,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:56,224 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:56,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 01:20:56,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 01:20:56,428 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:56,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:56,428 INFO L85 PathProgramCache]: Analyzing trace with hash 267334506, now seen corresponding path program 2 times [2025-01-10 01:20:56,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:56,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6835031] [2025-01-10 01:20:56,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 01:20:56,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:56,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 132 statements into 2 equivalence classes. [2025-01-10 01:20:56,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 132 statements. [2025-01-10 01:20:56,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 01:20:56,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2025-01-10 01:20:56,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:56,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6835031] [2025-01-10 01:20:56,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6835031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:56,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:56,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:20:56,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037023590] [2025-01-10 01:20:56,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:56,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:20:56,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:56,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:20:56,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:56,470 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:20:56,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:56,486 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2025-01-10 01:20:56,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:20:56,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 132 [2025-01-10 01:20:56,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:56,487 INFO L225 Difference]: With dead ends: 130 [2025-01-10 01:20:56,487 INFO L226 Difference]: Without dead ends: 128 [2025-01-10 01:20:56,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:56,488 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:56,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 69 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:56,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-10 01:20:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-01-10 01:20:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.065040650406504) internal successors, (131), 124 states have internal predecessors, (131), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:20:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 135 transitions. [2025-01-10 01:20:56,493 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 135 transitions. Word has length 132 [2025-01-10 01:20:56,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:56,493 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 135 transitions. [2025-01-10 01:20:56,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:20:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 135 transitions. [2025-01-10 01:20:56,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-10 01:20:56,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:56,494 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:56,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 01:20:56,494 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:56,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:56,494 INFO L85 PathProgramCache]: Analyzing trace with hash -302564823, now seen corresponding path program 1 times [2025-01-10 01:20:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:56,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851549518] [2025-01-10 01:20:56,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:56,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-10 01:20:56,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-10 01:20:56,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:56,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2025-01-10 01:20:56,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:56,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851549518] [2025-01-10 01:20:56,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851549518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:56,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:56,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:20:56,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793287074] [2025-01-10 01:20:56,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:56,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:20:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:56,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:20:56,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:56,632 INFO L87 Difference]: Start difference. First operand 128 states and 135 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:20:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:56,648 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2025-01-10 01:20:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:20:56,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 133 [2025-01-10 01:20:56,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:56,649 INFO L225 Difference]: With dead ends: 131 [2025-01-10 01:20:56,649 INFO L226 Difference]: Without dead ends: 130 [2025-01-10 01:20:56,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:56,650 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:56,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:56,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-10 01:20:56,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-01-10 01:20:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.064) internal successors, (133), 126 states have internal predecessors, (133), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:20:56,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 137 transitions. [2025-01-10 01:20:56,655 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 137 transitions. Word has length 133 [2025-01-10 01:20:56,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:56,655 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 137 transitions. [2025-01-10 01:20:56,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:20:56,655 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2025-01-10 01:20:56,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-10 01:20:56,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:56,656 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:56,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 01:20:56,656 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:56,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:56,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1427786852, now seen corresponding path program 1 times [2025-01-10 01:20:56,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:56,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566350401] [2025-01-10 01:20:56,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:56,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:56,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-10 01:20:56,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-10 01:20:56,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:56,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2025-01-10 01:20:56,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:56,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566350401] [2025-01-10 01:20:56,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566350401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:56,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:56,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 01:20:56,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889302182] [2025-01-10 01:20:56,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:56,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 01:20:56,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:56,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 01:20:56,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:20:56,760 INFO L87 Difference]: Start difference. First operand 130 states and 137 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:20:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:56,768 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2025-01-10 01:20:56,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 01:20:56,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 136 [2025-01-10 01:20:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:56,769 INFO L225 Difference]: With dead ends: 130 [2025-01-10 01:20:56,770 INFO L226 Difference]: Without dead ends: 129 [2025-01-10 01:20:56,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 01:20:56,771 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:56,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-10 01:20:56,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-01-10 01:20:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 125 states have (on average 1.056) internal successors, (132), 125 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-10 01:20:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2025-01-10 01:20:56,775 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 136 [2025-01-10 01:20:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:56,776 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2025-01-10 01:20:56,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:20:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2025-01-10 01:20:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-10 01:20:56,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 01:20:56,778 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:56,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 01:20:56,778 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-01-10 01:20:56,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 01:20:56,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2008599942, now seen corresponding path program 1 times [2025-01-10 01:20:56,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 01:20:56,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164054158] [2025-01-10 01:20:56,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 01:20:56,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 01:20:56,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-10 01:20:56,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-10 01:20:56,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 01:20:56,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 01:20:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1473 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2025-01-10 01:20:56,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 01:20:56,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164054158] [2025-01-10 01:20:56,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164054158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 01:20:56,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 01:20:56,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 01:20:56,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163729332] [2025-01-10 01:20:56,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 01:20:56,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 01:20:56,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 01:20:56,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 01:20:56,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:56,908 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:20:56,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 01:20:56,919 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2025-01-10 01:20:56,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 01:20:56,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 138 [2025-01-10 01:20:56,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 01:20:56,919 INFO L225 Difference]: With dead ends: 129 [2025-01-10 01:20:56,920 INFO L226 Difference]: Without dead ends: 0 [2025-01-10 01:20:56,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 01:20:56,920 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-10 01:20:56,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-10 01:20:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-10 01:20:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-10 01:20:56,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 01:20:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 01:20:56,921 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2025-01-10 01:20:56,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 01:20:56,921 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 01:20:56,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-10 01:20:56,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-10 01:20:56,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-10 01:20:56,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location bAndErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-01-10 01:20:56,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location bAndErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2025-01-10 01:20:56,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2025-01-10 01:20:56,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-01-10 01:20:56,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-01-10 01:20:56,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-01-10 01:20:56,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-01-10 01:20:56,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-01-10 01:20:56,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 01:20:56,927 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 01:20:56,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-10 01:20:56,960 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 01:20:56,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:20:56 BoogieIcfgContainer [2025-01-10 01:20:56,971 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 01:20:56,972 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 01:20:56,972 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 01:20:56,972 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 01:20:56,972 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:20:50" (3/4) ... [2025-01-10 01:20:56,974 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 01:20:56,977 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure bAnd [2025-01-10 01:20:56,980 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-01-10 01:20:56,980 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-10 01:20:56,980 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 01:20:56,980 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:20:56,980 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 01:20:57,040 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 01:20:57,041 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 01:20:57,041 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 01:20:57,041 INFO L158 Benchmark]: Toolchain (without parser) took 7218.89ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 112.4MB in the beginning and 346.0MB in the end (delta: -233.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2025-01-10 01:20:57,041 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:20:57,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.57ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 101.0MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:20:57,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.23ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:20:57,042 INFO L158 Benchmark]: Boogie Preprocessor took 43.89ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:20:57,042 INFO L158 Benchmark]: RCFGBuilder took 274.13ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 83.8MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 01:20:57,042 INFO L158 Benchmark]: TraceAbstraction took 6618.10ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 83.3MB in the beginning and 350.4MB in the end (delta: -267.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2025-01-10 01:20:57,042 INFO L158 Benchmark]: Witness Printer took 69.08ms. Allocated memory is still 411.0MB. Free memory was 350.4MB in the beginning and 346.0MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 01:20:57,044 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.57ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 101.0MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.23ms. Allocated memory is still 142.6MB. Free memory was 101.0MB in the beginning and 99.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.89ms. Allocated memory is still 142.6MB. Free memory was 99.6MB in the beginning and 98.1MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 274.13ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 83.8MB in the end (delta: 14.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6618.10ms. Allocated memory was 142.6MB in the beginning and 411.0MB in the end (delta: 268.4MB). Free memory was 83.3MB in the beginning and 350.4MB in the end (delta: -267.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Witness Printer took 69.08ms. Allocated memory is still 411.0MB. Free memory was 350.4MB in the beginning and 346.0MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 23]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 16, TraceHistogramMax: 31, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 2133 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1640 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 610 IncrementalHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 493 mSDtfsCounter, 610 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=12, InterpolantAutomatonStates: 169, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 14 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1240 NumberOfCodeBlocks, 1112 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1357 ConstructedInterpolants, 0 QuantifiedInterpolants, 1861 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1468 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 27 InterpolantComputations, 12 PerfectInterpolantSequences, 8042/8920 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((1 < i) || (i == 1)) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (0 < (2147483650 + i)) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: ((i == 0) || (0 < i)) RESULT: Ultimate proved your program to be correct! [2025-01-10 01:20:57,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE