./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-2.i --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for overflows
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/bitvector/byte_add_1-2.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) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c']
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/bitvector/byte_add_1-2.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 db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-07 19:48:20,279 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-07 19:48:20,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf
[2024-11-07 19:48:20,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-07 19:48:20,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-07 19:48:20,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-07 19:48:20,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-07 19:48:20,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-07 19:48:20,366 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-07 19:48:20,368 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-07 19:48:20,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-07 19:48:20,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-07 19:48:20,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-07 19:48:20,369 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-07 19:48:20,369 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-07 19:48:20,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-07 19:48:20,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-07 19:48:20,370 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-07 19:48:20,370 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-07 19:48:20,370 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-07 19:48:20,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-07 19:48:20,370 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-07 19:48:20,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-07 19:48:20,370 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-07 19:48:20,370 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-07 19:48:20,370 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME
[2024-11-07 19:48:20,370 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-07 19:48:20,371 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-07 19:48:20,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-07 19:48:20,371 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-07 19:48:20,371 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-07 19:48:20,371 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-07 19:48:20,371 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-07 19:48:20,371 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-07 19:48:20,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 19:48:20,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-07 19:48:20,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-07 19:48:20,372 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-07 19:48:20,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-07 19:48:20,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-07 19:48:20,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-07 19:48:20,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-07 19:48:20,372 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-07 19:48:20,372 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-07 19:48:20,372 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 -> db53fe9124e215e75c7f288cadf12df33daef67c04c75ea6ca77bc804670a99c
[2024-11-07 19:48:20,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-07 19:48:20,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-07 19:48:20,682 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-07 19:48:20,684 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-07 19:48:20,684 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-07 19:48:20,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-2.i
[2024-11-07 19:48:21,784 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-07 19:48:21,949 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-07 19:48:21,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-2.i
[2024-11-07 19:48:21,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5901d8777/1aee33bb46bc43d688c7f93ba42974b6/FLAG4a1e29bcc
[2024-11-07 19:48:21,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5901d8777/1aee33bb46bc43d688c7f93ba42974b6
[2024-11-07 19:48:21,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-07 19:48:21,974 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-07 19:48:21,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-07 19:48:21,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-07 19:48:21,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-07 19:48:21,980 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:48:21" (1/1) ...
[2024-11-07 19:48:21,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4428eab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:21, skipping insertion in model container
[2024-11-07 19:48:21,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:48:21" (1/1) ...
[2024-11-07 19:48:21,996 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-07 19:48:22,129 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 19:48:22,137 INFO L200 MainTranslator]: Completed pre-run
[2024-11-07 19:48:22,160 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-07 19:48:22,170 INFO L204 MainTranslator]: Completed translation
[2024-11-07 19:48:22,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:22 WrapperNode
[2024-11-07 19:48:22,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-07 19:48:22,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-07 19:48:22,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-07 19:48:22,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-07 19:48:22,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:22" (1/1) ...
[2024-11-07 19:48:22,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:22" (1/1) ...
[2024-11-07 19:48:22,215 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 190
[2024-11-07 19:48:22,215 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-07 19:48:22,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-07 19:48:22,216 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-07 19:48:22,216 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-07 19:48:22,222 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:22" (1/1) ...
[2024-11-07 19:48:22,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:22" (1/1) ...
[2024-11-07 19:48:22,229 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:22" (1/1) ...
[2024-11-07 19:48:22,247 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-07 19:48:22,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:22" (1/1) ...
[2024-11-07 19:48:22,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:22" (1/1) ...
[2024-11-07 19:48:22,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:22" (1/1) ...
[2024-11-07 19:48:22,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:22" (1/1) ...
[2024-11-07 19:48:22,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:22" (1/1) ...
[2024-11-07 19:48:22,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:22" (1/1) ...
[2024-11-07 19:48:22,264 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-07 19:48:22,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-07 19:48:22,268 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-07 19:48:22,268 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-07 19:48:22,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:22" (1/1) ...
[2024-11-07 19:48:22,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-07 19:48:22,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 19:48:22,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-07 19:48:22,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-07 19:48:22,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-07 19:48:22,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-07 19:48:22,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-07 19:48:22,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-07 19:48:22,360 INFO L238 CfgBuilder]: Building ICFG
[2024-11-07 19:48:22,362 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-07 19:48:22,652 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live.
[2024-11-07 19:48:22,652 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-07 19:48:22,669 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-07 19:48:22,671 INFO L316 CfgBuilder]: Removed 2 assume(true) statements.
[2024-11-07 19:48:22,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:48:22 BoogieIcfgContainer
[2024-11-07 19:48:22,671 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-07 19:48:22,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-07 19:48:22,673 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-07 19:48:22,676 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-07 19:48:22,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:48:21" (1/3) ...
[2024-11-07 19:48:22,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526a20dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:48:22, skipping insertion in model container
[2024-11-07 19:48:22,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:22" (2/3) ...
[2024-11-07 19:48:22,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526a20dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:48:22, skipping insertion in model container
[2024-11-07 19:48:22,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:48:22" (3/3) ...
[2024-11-07 19:48:22,678 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-2.i
[2024-11-07 19:48:22,687 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-07 19:48:22,688 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations.
[2024-11-07 19:48:22,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-07 19:48:22,736 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;@7cfe0b01, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-07 19:48:22,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations.
[2024-11-07 19:48:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 90 states have (on average 1.8666666666666667) internal successors, (168), 131 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5
[2024-11-07 19:48:22,744 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:22,744 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1]
[2024-11-07 19:48:22,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:22,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:22,749 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times
[2024-11-07 19:48:22,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:22,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55126306]
[2024-11-07 19:48:22,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:22,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 19:48:22,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:22,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55126306]
[2024-11-07 19:48:22,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55126306] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:22,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:48:22,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2024-11-07 19:48:22,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765445588]
[2024-11-07 19:48:22,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:22,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-07 19:48:22,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:22,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-07 19:48:22,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 19:48:22,853 INFO L87 Difference]: Start difference. First operand has 132 states, 90 states have (on average 1.8666666666666667) internal successors, (168), 131 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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)
[2024-11-07 19:48:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:22,864 INFO L93 Difference]: Finished difference Result 167 states and 226 transitions.
[2024-11-07 19:48:22,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-07 19:48:22,865 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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
[2024-11-07 19:48:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:22,869 INFO L225 Difference]: With dead ends: 167
[2024-11-07 19:48:22,869 INFO L226 Difference]: Without dead ends: 79
[2024-11-07 19:48:22,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-07 19:48:22,872 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:22,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 19:48:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states.
[2024-11-07 19:48:22,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79.
[2024-11-07 19:48:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions.
[2024-11-07 19:48:22,892 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 4
[2024-11-07 19:48:22,892 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:22,892 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions.
[2024-11-07 19:48:22,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 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)
[2024-11-07 19:48:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions.
[2024-11-07 19:48:22,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2024-11-07 19:48:22,893 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:22,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:22,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-07 19:48:22,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:22,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:22,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1213044638, now seen corresponding path program 1 times
[2024-11-07 19:48:22,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:22,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188188369]
[2024-11-07 19:48:22,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:22,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 19:48:23,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:23,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188188369]
[2024-11-07 19:48:23,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188188369] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:23,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:48:23,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 19:48:23,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994262449]
[2024-11-07 19:48:23,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:23,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 19:48:23,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:23,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 19:48:23,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 19:48:23,006 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:23,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:23,122 INFO L93 Difference]: Finished difference Result 165 states and 240 transitions.
[2024-11-07 19:48:23,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 19:48:23,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19
[2024-11-07 19:48:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:23,123 INFO L225 Difference]: With dead ends: 165
[2024-11-07 19:48:23,123 INFO L226 Difference]: Without dead ends: 108
[2024-11-07 19:48:23,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 19:48:23,124 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 30 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:23,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 149 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 19:48:23,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states.
[2024-11-07 19:48:23,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104.
[2024-11-07 19:48:23,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 103 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:23,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions.
[2024-11-07 19:48:23,135 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 19
[2024-11-07 19:48:23,136 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:23,136 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions.
[2024-11-07 19:48:23,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions.
[2024-11-07 19:48:23,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2024-11-07 19:48:23,137 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:23,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:23,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-07 19:48:23,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:23,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:23,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1776244864, now seen corresponding path program 1 times
[2024-11-07 19:48:23,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:23,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554697720]
[2024-11-07 19:48:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:23,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:23,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 19:48:23,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:23,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554697720]
[2024-11-07 19:48:23,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554697720] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:23,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:48:23,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 19:48:23,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275754758]
[2024-11-07 19:48:23,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:23,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 19:48:23,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:23,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 19:48:23,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 19:48:23,334 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:23,535 INFO L93 Difference]: Finished difference Result 234 states and 345 transitions.
[2024-11-07 19:48:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 19:48:23,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26
[2024-11-07 19:48:23,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:23,536 INFO L225 Difference]: With dead ends: 234
[2024-11-07 19:48:23,536 INFO L226 Difference]: Without dead ends: 177
[2024-11-07 19:48:23,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 19:48:23,537 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 114 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:23,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 205 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 19:48:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states.
[2024-11-07 19:48:23,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 129.
[2024-11-07 19:48:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.3671875) internal successors, (175), 128 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 175 transitions.
[2024-11-07 19:48:23,544 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 175 transitions. Word has length 26
[2024-11-07 19:48:23,544 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:23,544 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 175 transitions.
[2024-11-07 19:48:23,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:23,545 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 175 transitions.
[2024-11-07 19:48:23,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2024-11-07 19:48:23,545 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:23,545 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:23,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-07 19:48:23,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:23,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:23,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1932025242, now seen corresponding path program 1 times
[2024-11-07 19:48:23,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:23,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69460495]
[2024-11-07 19:48:23,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:23,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-11-07 19:48:23,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:23,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69460495]
[2024-11-07 19:48:23,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69460495] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:23,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:48:23,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 19:48:23,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240253754]
[2024-11-07 19:48:23,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:23,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 19:48:23,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:23,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 19:48:23,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 19:48:23,673 INFO L87 Difference]: Start difference. First operand 129 states and 175 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:23,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:23,790 INFO L93 Difference]: Finished difference Result 335 states and 454 transitions.
[2024-11-07 19:48:23,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 19:48:23,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 33
[2024-11-07 19:48:23,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:23,792 INFO L225 Difference]: With dead ends: 335
[2024-11-07 19:48:23,792 INFO L226 Difference]: Without dead ends: 231
[2024-11-07 19:48:23,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 19:48:23,797 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 110 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:23,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 310 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 19:48:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states.
[2024-11-07 19:48:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 142.
[2024-11-07 19:48:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.3546099290780143) internal successors, (191), 141 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 191 transitions.
[2024-11-07 19:48:23,807 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 191 transitions. Word has length 33
[2024-11-07 19:48:23,808 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:23,809 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 191 transitions.
[2024-11-07 19:48:23,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 191 transitions.
[2024-11-07 19:48:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2024-11-07 19:48:23,810 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:23,811 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:23,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-07 19:48:23,811 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:23,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:23,811 INFO L85 PathProgramCache]: Analyzing trace with hash 880692086, now seen corresponding path program 1 times
[2024-11-07 19:48:23,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:23,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952439992]
[2024-11-07 19:48:23,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:23,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-11-07 19:48:23,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:23,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952439992]
[2024-11-07 19:48:23,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952439992] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:23,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:48:23,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 19:48:23,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385615480]
[2024-11-07 19:48:23,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:23,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 19:48:23,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:23,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 19:48:23,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 19:48:23,937 INFO L87 Difference]: Start difference. First operand 142 states and 191 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:24,062 INFO L93 Difference]: Finished difference Result 341 states and 460 transitions.
[2024-11-07 19:48:24,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 19:48:24,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36
[2024-11-07 19:48:24,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:24,063 INFO L225 Difference]: With dead ends: 341
[2024-11-07 19:48:24,063 INFO L226 Difference]: Without dead ends: 237
[2024-11-07 19:48:24,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-11-07 19:48:24,064 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 99 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:24,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 300 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 19:48:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states.
[2024-11-07 19:48:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 155.
[2024-11-07 19:48:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.3311688311688312) internal successors, (205), 154 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 205 transitions.
[2024-11-07 19:48:24,076 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 205 transitions. Word has length 36
[2024-11-07 19:48:24,076 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:24,076 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 205 transitions.
[2024-11-07 19:48:24,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:24,076 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 205 transitions.
[2024-11-07 19:48:24,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2024-11-07 19:48:24,077 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:24,078 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:24,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-07 19:48:24,078 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:24,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:24,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1757161921, now seen corresponding path program 1 times
[2024-11-07 19:48:24,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:24,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328622684]
[2024-11-07 19:48:24,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:24,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 19:48:24,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:24,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328622684]
[2024-11-07 19:48:24,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328622684] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 19:48:24,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824606435]
[2024-11-07 19:48:24,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:24,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:24,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 19:48:24,169 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 19:48:24,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-07 19:48:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:24,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 19:48:24,224 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:48:24,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-07 19:48:24,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:48:24,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824606435] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:24,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 19:48:24,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6
[2024-11-07 19:48:24,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389935630]
[2024-11-07 19:48:24,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:24,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 19:48:24,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:24,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 19:48:24,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-07 19:48:24,265 INFO L87 Difference]: Start difference. First operand 155 states and 205 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:24,414 INFO L93 Difference]: Finished difference Result 310 states and 439 transitions.
[2024-11-07 19:48:24,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 19:48:24,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 39
[2024-11-07 19:48:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:24,418 INFO L225 Difference]: With dead ends: 310
[2024-11-07 19:48:24,418 INFO L226 Difference]: Without dead ends: 208
[2024-11-07 19:48:24,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-11-07 19:48:24,419 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 48 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:24,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 247 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 19:48:24,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states.
[2024-11-07 19:48:24,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 186.
[2024-11-07 19:48:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.308108108108108) internal successors, (242), 185 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions.
[2024-11-07 19:48:24,432 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 39
[2024-11-07 19:48:24,432 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:24,432 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions.
[2024-11-07 19:48:24,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions.
[2024-11-07 19:48:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2024-11-07 19:48:24,433 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:24,433 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:24,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-07 19:48:24,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:24,633 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:24,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:24,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1239804479, now seen corresponding path program 1 times
[2024-11-07 19:48:24,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:24,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428530807]
[2024-11-07 19:48:24,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:24,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-07 19:48:24,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:24,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428530807]
[2024-11-07 19:48:24,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428530807] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 19:48:24,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118805266]
[2024-11-07 19:48:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:24,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:24,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 19:48:24,745 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 19:48:24,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-07 19:48:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:24,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjuncts are in the unsatisfiable core
[2024-11-07 19:48:24,788 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:48:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-07 19:48:24,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:48:24,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118805266] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:24,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 19:48:24,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7
[2024-11-07 19:48:24,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114413796]
[2024-11-07 19:48:24,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:24,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 19:48:24,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:24,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 19:48:24,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-07 19:48:24,812 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:24,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:24,941 INFO L93 Difference]: Finished difference Result 372 states and 507 transitions.
[2024-11-07 19:48:24,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 19:48:24,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 46
[2024-11-07 19:48:24,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:24,943 INFO L225 Difference]: With dead ends: 372
[2024-11-07 19:48:24,943 INFO L226 Difference]: Without dead ends: 239
[2024-11-07 19:48:24,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-07 19:48:24,943 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 47 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:24,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 247 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 19:48:24,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states.
[2024-11-07 19:48:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 211.
[2024-11-07 19:48:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 210 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 271 transitions.
[2024-11-07 19:48:24,953 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 271 transitions. Word has length 46
[2024-11-07 19:48:24,956 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:24,956 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 271 transitions.
[2024-11-07 19:48:24,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 271 transitions.
[2024-11-07 19:48:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2024-11-07 19:48:24,958 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:24,958 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:24,971 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
[2024-11-07 19:48:25,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:25,159 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:25,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:25,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1676819835, now seen corresponding path program 1 times
[2024-11-07 19:48:25,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:25,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898450757]
[2024-11-07 19:48:25,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:25,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2024-11-07 19:48:25,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:25,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898450757]
[2024-11-07 19:48:25,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898450757] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:25,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:48:25,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-07 19:48:25,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298293838]
[2024-11-07 19:48:25,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:25,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 19:48:25,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:25,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 19:48:25,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 19:48:25,225 INFO L87 Difference]: Start difference. First operand 211 states and 271 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:25,236 INFO L93 Difference]: Finished difference Result 258 states and 328 transitions.
[2024-11-07 19:48:25,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 19:48:25,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 53
[2024-11-07 19:48:25,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:25,237 INFO L225 Difference]: With dead ends: 258
[2024-11-07 19:48:25,237 INFO L226 Difference]: Without dead ends: 185
[2024-11-07 19:48:25,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 19:48:25,238 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:25,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 225 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 19:48:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states.
[2024-11-07 19:48:25,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185.
[2024-11-07 19:48:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 184 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:25,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions.
[2024-11-07 19:48:25,243 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 53
[2024-11-07 19:48:25,243 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:25,243 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions.
[2024-11-07 19:48:25,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions.
[2024-11-07 19:48:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2024-11-07 19:48:25,244 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:25,244 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:25,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-07 19:48:25,244 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:25,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:25,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2137686151, now seen corresponding path program 1 times
[2024-11-07 19:48:25,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:25,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830634718]
[2024-11-07 19:48:25,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:25,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked.
[2024-11-07 19:48:25,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:25,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830634718]
[2024-11-07 19:48:25,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830634718] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:25,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:48:25,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 19:48:25,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457623314]
[2024-11-07 19:48:25,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:25,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 19:48:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:25,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 19:48:25,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 19:48:25,380 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:25,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:25,486 INFO L93 Difference]: Finished difference Result 480 states and 612 transitions.
[2024-11-07 19:48:25,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 19:48:25,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 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 65
[2024-11-07 19:48:25,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:25,488 INFO L225 Difference]: With dead ends: 480
[2024-11-07 19:48:25,488 INFO L226 Difference]: Without dead ends: 346
[2024-11-07 19:48:25,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-07 19:48:25,488 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 152 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:25,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 197 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 19:48:25,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states.
[2024-11-07 19:48:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 227.
[2024-11-07 19:48:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.2743362831858407) internal successors, (288), 226 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:25,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 288 transitions.
[2024-11-07 19:48:25,498 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 288 transitions. Word has length 65
[2024-11-07 19:48:25,499 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:25,499 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 288 transitions.
[2024-11-07 19:48:25,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 288 transitions.
[2024-11-07 19:48:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2024-11-07 19:48:25,500 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:25,501 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:25,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-07 19:48:25,501 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:25,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:25,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2110196596, now seen corresponding path program 1 times
[2024-11-07 19:48:25,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:25,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872262190]
[2024-11-07 19:48:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:25,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:25,586 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2024-11-07 19:48:25,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:25,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872262190]
[2024-11-07 19:48:25,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872262190] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:25,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:48:25,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-07 19:48:25,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504953267]
[2024-11-07 19:48:25,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:25,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 19:48:25,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:25,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 19:48:25,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 19:48:25,589 INFO L87 Difference]: Start difference. First operand 227 states and 288 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:25,630 INFO L93 Difference]: Finished difference Result 513 states and 651 transitions.
[2024-11-07 19:48:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 19:48:25,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 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 68
[2024-11-07 19:48:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:25,632 INFO L225 Difference]: With dead ends: 513
[2024-11-07 19:48:25,632 INFO L226 Difference]: Without dead ends: 337
[2024-11-07 19:48:25,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-07 19:48:25,634 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 68 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:25,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 387 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 19:48:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states.
[2024-11-07 19:48:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 249.
[2024-11-07 19:48:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.2983870967741935) internal successors, (322), 248 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:25,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 322 transitions.
[2024-11-07 19:48:25,643 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 322 transitions. Word has length 68
[2024-11-07 19:48:25,643 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:25,643 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 322 transitions.
[2024-11-07 19:48:25,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 322 transitions.
[2024-11-07 19:48:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2024-11-07 19:48:25,644 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:25,644 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:25,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-07 19:48:25,644 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:25,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:25,645 INFO L85 PathProgramCache]: Analyzing trace with hash -301960682, now seen corresponding path program 1 times
[2024-11-07 19:48:25,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:25,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709419381]
[2024-11-07 19:48:25,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:25,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-11-07 19:48:25,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:25,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709419381]
[2024-11-07 19:48:25,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709419381] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:25,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:48:25,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 19:48:25,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249717497]
[2024-11-07 19:48:25,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:25,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 19:48:25,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:25,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 19:48:25,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-07 19:48:25,770 INFO L87 Difference]: Start difference. First operand 249 states and 322 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:25,922 INFO L93 Difference]: Finished difference Result 685 states and 891 transitions.
[2024-11-07 19:48:25,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 19:48:25,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 74
[2024-11-07 19:48:25,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:25,924 INFO L225 Difference]: With dead ends: 685
[2024-11-07 19:48:25,924 INFO L226 Difference]: Without dead ends: 482
[2024-11-07 19:48:25,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72
[2024-11-07 19:48:25,925 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 162 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:25,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 232 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 19:48:25,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states.
[2024-11-07 19:48:25,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 407.
[2024-11-07 19:48:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 406 states have (on average 1.2857142857142858) internal successors, (522), 406 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 522 transitions.
[2024-11-07 19:48:25,937 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 522 transitions. Word has length 74
[2024-11-07 19:48:25,937 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:25,937 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 522 transitions.
[2024-11-07 19:48:25,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 522 transitions.
[2024-11-07 19:48:25,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2024-11-07 19:48:25,940 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:25,940 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:25,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-07 19:48:25,940 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:25,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:25,941 INFO L85 PathProgramCache]: Analyzing trace with hash -326786310, now seen corresponding path program 1 times
[2024-11-07 19:48:25,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:25,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487078969]
[2024-11-07 19:48:25,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:25,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2024-11-07 19:48:26,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:26,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487078969]
[2024-11-07 19:48:26,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487078969] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 19:48:26,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196044768]
[2024-11-07 19:48:26,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:26,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:26,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 19:48:26,016 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 19:48:26,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-07 19:48:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:26,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-07 19:48:26,066 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:48:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2024-11-07 19:48:26,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:48:26,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196044768] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:26,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 19:48:26,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4
[2024-11-07 19:48:26,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925133231]
[2024-11-07 19:48:26,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:26,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 19:48:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:26,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 19:48:26,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 19:48:26,119 INFO L87 Difference]: Start difference. First operand 407 states and 522 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:26,185 INFO L93 Difference]: Finished difference Result 1047 states and 1341 transitions.
[2024-11-07 19:48:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 19:48:26,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 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 74
[2024-11-07 19:48:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:26,188 INFO L225 Difference]: With dead ends: 1047
[2024-11-07 19:48:26,188 INFO L226 Difference]: Without dead ends: 649
[2024-11-07 19:48:26,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-07 19:48:26,189 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 49 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:26,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 177 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 19:48:26,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states.
[2024-11-07 19:48:26,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 555.
[2024-11-07 19:48:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 554 states have (on average 1.2761732851985559) internal successors, (707), 554 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 707 transitions.
[2024-11-07 19:48:26,206 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 707 transitions. Word has length 74
[2024-11-07 19:48:26,206 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:26,207 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 707 transitions.
[2024-11-07 19:48:26,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:26,207 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 707 transitions.
[2024-11-07 19:48:26,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75
[2024-11-07 19:48:26,207 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:26,207 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:26,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-07 19:48:26,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:26,408 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:26,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1468144829, now seen corresponding path program 1 times
[2024-11-07 19:48:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:26,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816920156]
[2024-11-07 19:48:26,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-11-07 19:48:26,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:26,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816920156]
[2024-11-07 19:48:26,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816920156] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:26,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:48:26,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-07 19:48:26,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630421153]
[2024-11-07 19:48:26,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:26,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 19:48:26,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:26,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 19:48:26,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-11-07 19:48:26,507 INFO L87 Difference]: Start difference. First operand 555 states and 707 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:26,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:26,673 INFO L93 Difference]: Finished difference Result 1345 states and 1704 transitions.
[2024-11-07 19:48:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-07 19:48:26,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 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 74
[2024-11-07 19:48:26,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:26,676 INFO L225 Difference]: With dead ends: 1345
[2024-11-07 19:48:26,676 INFO L226 Difference]: Without dead ends: 794
[2024-11-07 19:48:26,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72
[2024-11-07 19:48:26,677 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 156 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:26,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 349 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 19:48:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states.
[2024-11-07 19:48:26,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 696.
[2024-11-07 19:48:26,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 695 states have (on average 1.2618705035971223) internal successors, (877), 695 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 877 transitions.
[2024-11-07 19:48:26,691 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 877 transitions. Word has length 74
[2024-11-07 19:48:26,691 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:26,691 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 877 transitions.
[2024-11-07 19:48:26,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 877 transitions.
[2024-11-07 19:48:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2024-11-07 19:48:26,692 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:26,693 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:26,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-07 19:48:26,693 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:26,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:26,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2112281364, now seen corresponding path program 1 times
[2024-11-07 19:48:26,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:26,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094274935]
[2024-11-07 19:48:26,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:26,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-11-07 19:48:26,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:26,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094274935]
[2024-11-07 19:48:26,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094274935] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:26,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:48:26,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 19:48:26,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101696432]
[2024-11-07 19:48:26,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:26,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 19:48:26,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:26,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 19:48:26,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-07 19:48:26,818 INFO L87 Difference]: Start difference. First operand 696 states and 877 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:27,050 INFO L93 Difference]: Finished difference Result 1731 states and 2171 transitions.
[2024-11-07 19:48:27,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-07 19:48:27,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 80
[2024-11-07 19:48:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:27,053 INFO L225 Difference]: With dead ends: 1731
[2024-11-07 19:48:27,053 INFO L226 Difference]: Without dead ends: 961
[2024-11-07 19:48:27,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132
[2024-11-07 19:48:27,054 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 198 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:27,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 319 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 19:48:27,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states.
[2024-11-07 19:48:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 826.
[2024-11-07 19:48:27,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 1.2642424242424242) internal successors, (1043), 825 states have internal predecessors, (1043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1043 transitions.
[2024-11-07 19:48:27,073 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1043 transitions. Word has length 80
[2024-11-07 19:48:27,074 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:27,074 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1043 transitions.
[2024-11-07 19:48:27,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1043 transitions.
[2024-11-07 19:48:27,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2024-11-07 19:48:27,075 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:27,075 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:27,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-07 19:48:27,075 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:27,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1262585566, now seen corresponding path program 1 times
[2024-11-07 19:48:27,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:27,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137700945]
[2024-11-07 19:48:27,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:27,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2024-11-07 19:48:27,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:27,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137700945]
[2024-11-07 19:48:27,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137700945] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 19:48:27,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952236223]
[2024-11-07 19:48:27,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:27,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:27,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 19:48:27,162 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 19:48:27,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-07 19:48:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:27,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 11 conjuncts are in the unsatisfiable core
[2024-11-07 19:48:27,215 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:48:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 26 proven. 43 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2024-11-07 19:48:27,284 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 19:48:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 39 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2024-11-07 19:48:27,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952236223] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 19:48:27,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 19:48:27,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9
[2024-11-07 19:48:27,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475214471]
[2024-11-07 19:48:27,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 19:48:27,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-11-07 19:48:27,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:27,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-07 19:48:27,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-11-07 19:48:27,354 INFO L87 Difference]: Start difference. First operand 826 states and 1043 transitions. Second operand has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:28,448 INFO L93 Difference]: Finished difference Result 4972 states and 6140 transitions.
[2024-11-07 19:48:28,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states.
[2024-11-07 19:48:28,449 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 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 80
[2024-11-07 19:48:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:28,459 INFO L225 Difference]: With dead ends: 4972
[2024-11-07 19:48:28,459 INFO L226 Difference]: Without dead ends: 4016
[2024-11-07 19:48:28,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=592, Invalid=2600, Unknown=0, NotChecked=0, Total=3192
[2024-11-07 19:48:28,463 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 842 mSDsluCounter, 1172 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:28,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1470 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2024-11-07 19:48:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states.
[2024-11-07 19:48:28,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 1079.
[2024-11-07 19:48:28,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 1078 states have (on average 1.4063079777365493) internal successors, (1516), 1078 states have internal predecessors, (1516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1516 transitions.
[2024-11-07 19:48:28,506 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1516 transitions. Word has length 80
[2024-11-07 19:48:28,506 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:28,506 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1516 transitions.
[2024-11-07 19:48:28,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 12.444444444444445) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1516 transitions.
[2024-11-07 19:48:28,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2024-11-07 19:48:28,508 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:28,508 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:28,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-11-07 19:48:28,709 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,SelfDestructingSolverStorable14
[2024-11-07 19:48:28,709 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:28,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:28,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1514248837, now seen corresponding path program 1 times
[2024-11-07 19:48:28,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:28,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404994013]
[2024-11-07 19:48:28,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:28,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2024-11-07 19:48:28,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:28,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404994013]
[2024-11-07 19:48:28,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404994013] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:28,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:48:28,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-07 19:48:28,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896747921]
[2024-11-07 19:48:28,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:28,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-07 19:48:28,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:28,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-07 19:48:28,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-11-07 19:48:28,825 INFO L87 Difference]: Start difference. First operand 1079 states and 1516 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:29,045 INFO L93 Difference]: Finished difference Result 2425 states and 3400 transitions.
[2024-11-07 19:48:29,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2024-11-07 19:48:29,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 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 80
[2024-11-07 19:48:29,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:29,050 INFO L225 Difference]: With dead ends: 2425
[2024-11-07 19:48:29,050 INFO L226 Difference]: Without dead ends: 1331
[2024-11-07 19:48:29,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132
[2024-11-07 19:48:29,053 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 254 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:29,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 306 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 19:48:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states.
[2024-11-07 19:48:29,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1239.
[2024-11-07 19:48:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 1.4103392568659128) internal successors, (1746), 1238 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1746 transitions.
[2024-11-07 19:48:29,086 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1746 transitions. Word has length 80
[2024-11-07 19:48:29,086 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:29,086 INFO L471 AbstractCegarLoop]: Abstraction has 1239 states and 1746 transitions.
[2024-11-07 19:48:29,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1746 transitions.
[2024-11-07 19:48:29,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-07 19:48:29,087 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:29,088 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:29,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-07 19:48:29,088 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:29,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:29,088 INFO L85 PathProgramCache]: Analyzing trace with hash -468213532, now seen corresponding path program 1 times
[2024-11-07 19:48:29,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:29,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504090109]
[2024-11-07 19:48:29,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:29,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked.
[2024-11-07 19:48:29,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:29,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504090109]
[2024-11-07 19:48:29,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504090109] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:29,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:48:29,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-07 19:48:29,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370879202]
[2024-11-07 19:48:29,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:29,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-07 19:48:29,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:29,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-07 19:48:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 19:48:29,218 INFO L87 Difference]: Start difference. First operand 1239 states and 1746 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:29,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:29,236 INFO L93 Difference]: Finished difference Result 2433 states and 3436 transitions.
[2024-11-07 19:48:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-07 19:48:29,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 86
[2024-11-07 19:48:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:29,239 INFO L225 Difference]: With dead ends: 2433
[2024-11-07 19:48:29,239 INFO L226 Difference]: Without dead ends: 1213
[2024-11-07 19:48:29,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-07 19:48:29,242 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 92 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:29,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 93 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 19:48:29,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states.
[2024-11-07 19:48:29,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1213.
[2024-11-07 19:48:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 1212 states have (on average 1.4125412541254125) internal successors, (1712), 1212 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1712 transitions.
[2024-11-07 19:48:29,267 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1712 transitions. Word has length 86
[2024-11-07 19:48:29,267 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:29,267 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1712 transitions.
[2024-11-07 19:48:29,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1712 transitions.
[2024-11-07 19:48:29,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-07 19:48:29,269 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:29,269 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:29,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-07 19:48:29,270 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:29,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:29,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1893852281, now seen corresponding path program 1 times
[2024-11-07 19:48:29,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:29,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752333633]
[2024-11-07 19:48:29,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:29,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:29,489 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2024-11-07 19:48:29,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:29,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752333633]
[2024-11-07 19:48:29,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752333633] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 19:48:29,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108458312]
[2024-11-07 19:48:29,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:29,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:29,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 19:48:29,492 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 19:48:29,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-11-07 19:48:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:29,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-11-07 19:48:29,568 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:48:29,618 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2024-11-07 19:48:29,620 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:48:29,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108458312] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:29,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 19:48:29,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10
[2024-11-07 19:48:29,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222787047]
[2024-11-07 19:48:29,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:29,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 19:48:29,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:29,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 19:48:29,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-11-07 19:48:29,622 INFO L87 Difference]: Start difference. First operand 1213 states and 1712 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:29,714 INFO L93 Difference]: Finished difference Result 3739 states and 5287 transitions.
[2024-11-07 19:48:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-07 19:48:29,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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 86
[2024-11-07 19:48:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:29,723 INFO L225 Difference]: With dead ends: 3739
[2024-11-07 19:48:29,723 INFO L226 Difference]: Without dead ends: 3543
[2024-11-07 19:48:29,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2024-11-07 19:48:29,724 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 126 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:29,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 357 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 19:48:29,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states.
[2024-11-07 19:48:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 1872.
[2024-11-07 19:48:29,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1872 states, 1871 states have (on average 1.4270443613041155) internal successors, (2670), 1871 states have internal predecessors, (2670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2670 transitions.
[2024-11-07 19:48:29,780 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2670 transitions. Word has length 86
[2024-11-07 19:48:29,780 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:29,780 INFO L471 AbstractCegarLoop]: Abstraction has 1872 states and 2670 transitions.
[2024-11-07 19:48:29,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2670 transitions.
[2024-11-07 19:48:29,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2024-11-07 19:48:29,782 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:29,782 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:29,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-11-07 19:48:29,983 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,SelfDestructingSolverStorable17
[2024-11-07 19:48:29,983 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:29,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:29,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1153171285, now seen corresponding path program 1 times
[2024-11-07 19:48:29,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:29,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987576443]
[2024-11-07 19:48:29,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:29,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2024-11-07 19:48:30,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:30,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987576443]
[2024-11-07 19:48:30,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987576443] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:30,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-07 19:48:30,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-07 19:48:30,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701214325]
[2024-11-07 19:48:30,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:30,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-07 19:48:30,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:30,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-07 19:48:30,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-11-07 19:48:30,112 INFO L87 Difference]: Start difference. First operand 1872 states and 2670 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:30,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:30,215 INFO L93 Difference]: Finished difference Result 4733 states and 6415 transitions.
[2024-11-07 19:48:30,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-07 19:48:30,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 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 89
[2024-11-07 19:48:30,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:30,222 INFO L225 Difference]: With dead ends: 4733
[2024-11-07 19:48:30,222 INFO L226 Difference]: Without dead ends: 2892
[2024-11-07 19:48:30,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-07 19:48:30,224 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 246 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:30,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 338 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 19:48:30,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states.
[2024-11-07 19:48:30,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2142.
[2024-11-07 19:48:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 2141 states have (on average 1.2993928070994862) internal successors, (2782), 2141 states have internal predecessors, (2782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:30,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 2782 transitions.
[2024-11-07 19:48:30,283 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 2782 transitions. Word has length 89
[2024-11-07 19:48:30,283 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:30,283 INFO L471 AbstractCegarLoop]: Abstraction has 2142 states and 2782 transitions.
[2024-11-07 19:48:30,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 2782 transitions.
[2024-11-07 19:48:30,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2024-11-07 19:48:30,285 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:30,285 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:30,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-07 19:48:30,286 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:30,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:30,286 INFO L85 PathProgramCache]: Analyzing trace with hash 944742117, now seen corresponding path program 1 times
[2024-11-07 19:48:30,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:30,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462248209]
[2024-11-07 19:48:30,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:30,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:30,472 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-11-07 19:48:30,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:30,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462248209]
[2024-11-07 19:48:30,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462248209] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 19:48:30,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394913523]
[2024-11-07 19:48:30,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:30,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:30,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 19:48:30,474 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 19:48:30,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-11-07 19:48:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:30,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-07 19:48:30,583 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:48:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2024-11-07 19:48:30,652 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:48:30,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394913523] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:30,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 19:48:30,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11
[2024-11-07 19:48:30,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923790978]
[2024-11-07 19:48:30,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:30,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-07 19:48:30,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:30,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-07 19:48:30,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-11-07 19:48:30,653 INFO L87 Difference]: Start difference. First operand 2142 states and 2782 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:30,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:30,852 INFO L93 Difference]: Finished difference Result 5572 states and 7155 transitions.
[2024-11-07 19:48:30,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-07 19:48:30,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 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 89
[2024-11-07 19:48:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:30,864 INFO L225 Difference]: With dead ends: 5572
[2024-11-07 19:48:30,864 INFO L226 Difference]: Without dead ends: 5354
[2024-11-07 19:48:30,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2024-11-07 19:48:30,867 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 161 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:30,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 631 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 19:48:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5354 states.
[2024-11-07 19:48:30,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5354 to 2142.
[2024-11-07 19:48:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2142 states, 2141 states have (on average 1.2993928070994862) internal successors, (2782), 2141 states have internal predecessors, (2782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 2782 transitions.
[2024-11-07 19:48:30,950 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 2782 transitions. Word has length 89
[2024-11-07 19:48:30,950 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:30,950 INFO L471 AbstractCegarLoop]: Abstraction has 2142 states and 2782 transitions.
[2024-11-07 19:48:30,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 2782 transitions.
[2024-11-07 19:48:30,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2024-11-07 19:48:30,952 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:30,952 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:30,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-11-07 19:48:31,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:31,153 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:31,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:31,154 INFO L85 PathProgramCache]: Analyzing trace with hash 786075514, now seen corresponding path program 1 times
[2024-11-07 19:48:31,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:31,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777355333]
[2024-11-07 19:48:31,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:31,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:31,249 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2024-11-07 19:48:31,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:31,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777355333]
[2024-11-07 19:48:31,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777355333] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 19:48:31,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115999243]
[2024-11-07 19:48:31,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:31,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:31,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 19:48:31,251 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 19:48:31,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-11-07 19:48:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:31,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-07 19:48:31,300 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:48:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 49 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2024-11-07 19:48:31,335 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 19:48:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 40 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2024-11-07 19:48:31,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115999243] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 19:48:31,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 19:48:31,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6] total 11
[2024-11-07 19:48:31,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111646055]
[2024-11-07 19:48:31,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 19:48:31,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-11-07 19:48:31,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:31,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-11-07 19:48:31,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-11-07 19:48:31,429 INFO L87 Difference]: Start difference. First operand 2142 states and 2782 transitions. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:31,657 INFO L93 Difference]: Finished difference Result 3490 states and 4527 transitions.
[2024-11-07 19:48:31,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2024-11-07 19:48:31,657 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 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 89
[2024-11-07 19:48:31,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:31,661 INFO L225 Difference]: With dead ends: 3490
[2024-11-07 19:48:31,661 INFO L226 Difference]: Without dead ends: 1371
[2024-11-07 19:48:31,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272
[2024-11-07 19:48:31,664 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 234 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:31,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 255 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-07 19:48:31,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states.
[2024-11-07 19:48:31,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1105.
[2024-11-07 19:48:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1104 states have (on average 1.1748188405797102) internal successors, (1297), 1104 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1297 transitions.
[2024-11-07 19:48:31,689 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1297 transitions. Word has length 89
[2024-11-07 19:48:31,690 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:31,690 INFO L471 AbstractCegarLoop]: Abstraction has 1105 states and 1297 transitions.
[2024-11-07 19:48:31,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:31,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1297 transitions.
[2024-11-07 19:48:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2024-11-07 19:48:31,690 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:31,691 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:31,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2024-11-07 19:48:31,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:31,892 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:31,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:31,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1857009734, now seen corresponding path program 1 times
[2024-11-07 19:48:31,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:31,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633092512]
[2024-11-07 19:48:31,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:31,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:31,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2024-11-07 19:48:31,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:31,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633092512]
[2024-11-07 19:48:31,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633092512] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 19:48:31,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061192157]
[2024-11-07 19:48:31,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:31,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:31,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 19:48:31,996 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 19:48:31,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-11-07 19:48:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:32,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-07 19:48:32,051 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:48:32,097 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2024-11-07 19:48:32,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-07 19:48:32,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061192157] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-07 19:48:32,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-07 19:48:32,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7
[2024-11-07 19:48:32,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999882506]
[2024-11-07 19:48:32,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-07 19:48:32,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-07 19:48:32,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:32,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-07 19:48:32,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-07 19:48:32,099 INFO L87 Difference]: Start difference. First operand 1105 states and 1297 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:32,183 INFO L93 Difference]: Finished difference Result 1759 states and 2056 transitions.
[2024-11-07 19:48:32,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-07 19:48:32,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 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 89
[2024-11-07 19:48:32,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:32,188 INFO L225 Difference]: With dead ends: 1759
[2024-11-07 19:48:32,188 INFO L226 Difference]: Without dead ends: 1548
[2024-11-07 19:48:32,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2024-11-07 19:48:32,190 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 56 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:32,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 166 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-07 19:48:32,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states.
[2024-11-07 19:48:32,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1451.
[2024-11-07 19:48:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1450 states have (on average 1.1779310344827587) internal successors, (1708), 1450 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1708 transitions.
[2024-11-07 19:48:32,221 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1708 transitions. Word has length 89
[2024-11-07 19:48:32,221 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:32,222 INFO L471 AbstractCegarLoop]: Abstraction has 1451 states and 1708 transitions.
[2024-11-07 19:48:32,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:32,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1708 transitions.
[2024-11-07 19:48:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2024-11-07 19:48:32,223 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:32,223 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:32,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-11-07 19:48:32,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:32,424 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:32,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:32,425 INFO L85 PathProgramCache]: Analyzing trace with hash 114731745, now seen corresponding path program 1 times
[2024-11-07 19:48:32,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:32,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176925933]
[2024-11-07 19:48:32,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:32,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:32,615 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 39 proven. 33 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-11-07 19:48:32,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:32,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176925933]
[2024-11-07 19:48:32,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176925933] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 19:48:32,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137888736]
[2024-11-07 19:48:32,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:32,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:32,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 19:48:32,617 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 19:48:32,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-11-07 19:48:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:32,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 20 conjuncts are in the unsatisfiable core
[2024-11-07 19:48:32,700 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:48:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2024-11-07 19:48:32,805 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 19:48:33,010 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2024-11-07 19:48:33,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137888736] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 19:48:33,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 19:48:33,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 18
[2024-11-07 19:48:33,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063312676]
[2024-11-07 19:48:33,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 19:48:33,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2024-11-07 19:48:33,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:33,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2024-11-07 19:48:33,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306
[2024-11-07 19:48:33,011 INFO L87 Difference]: Start difference. First operand 1451 states and 1708 transitions. Second operand has 18 states, 18 states have (on average 11.333333333333334) internal successors, (204), 18 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:34,043 INFO L93 Difference]: Finished difference Result 3062 states and 3530 transitions.
[2024-11-07 19:48:34,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states.
[2024-11-07 19:48:34,043 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 11.333333333333334) internal successors, (204), 18 states have internal predecessors, (204), 0 states have call successors, (0), 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 91
[2024-11-07 19:48:34,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:34,048 INFO L225 Difference]: With dead ends: 3062
[2024-11-07 19:48:34,048 INFO L226 Difference]: Without dead ends: 2658
[2024-11-07 19:48:34,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=611, Invalid=2251, Unknown=0, NotChecked=0, Total=2862
[2024-11-07 19:48:34,049 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 771 mSDsluCounter, 2277 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:34,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 2537 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-07 19:48:34,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2658 states.
[2024-11-07 19:48:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2658 to 943.
[2024-11-07 19:48:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 942 states have (on average 1.134819532908705) internal successors, (1069), 942 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:34,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1069 transitions.
[2024-11-07 19:48:34,081 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1069 transitions. Word has length 91
[2024-11-07 19:48:34,081 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:34,081 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1069 transitions.
[2024-11-07 19:48:34,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.333333333333334) internal successors, (204), 18 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1069 transitions.
[2024-11-07 19:48:34,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2024-11-07 19:48:34,082 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:34,082 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:34,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2024-11-07 19:48:34,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:34,287 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:34,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:34,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1314407751, now seen corresponding path program 1 times
[2024-11-07 19:48:34,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:34,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748601728]
[2024-11-07 19:48:34,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:34,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2024-11-07 19:48:34,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:34,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748601728]
[2024-11-07 19:48:34,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748601728] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 19:48:34,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529548514]
[2024-11-07 19:48:34,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:34,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:34,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 19:48:34,399 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 19:48:34,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-11-07 19:48:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:34,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 13 conjuncts are in the unsatisfiable core
[2024-11-07 19:48:34,468 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:48:34,539 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2024-11-07 19:48:34,539 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 19:48:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 44 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2024-11-07 19:48:34,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529548514] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 19:48:34,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 19:48:34,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 17
[2024-11-07 19:48:34,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388604893]
[2024-11-07 19:48:34,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 19:48:34,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-11-07 19:48:34,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:34,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-11-07 19:48:34,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272
[2024-11-07 19:48:34,690 INFO L87 Difference]: Start difference. First operand 943 states and 1069 transitions. Second operand has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:35,556 INFO L93 Difference]: Finished difference Result 2840 states and 3234 transitions.
[2024-11-07 19:48:35,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2024-11-07 19:48:35,557 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 states have internal predecessors, (159), 0 states have call successors, (0), 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 92
[2024-11-07 19:48:35,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:35,560 INFO L225 Difference]: With dead ends: 2840
[2024-11-07 19:48:35,560 INFO L226 Difference]: Without dead ends: 1704
[2024-11-07 19:48:35,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=535, Invalid=1105, Unknown=0, NotChecked=0, Total=1640
[2024-11-07 19:48:35,564 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 1014 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:35,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 620 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-07 19:48:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states.
[2024-11-07 19:48:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1269.
[2024-11-07 19:48:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 1268 states have (on average 1.1443217665615142) internal successors, (1451), 1268 states have internal predecessors, (1451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1451 transitions.
[2024-11-07 19:48:35,606 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1451 transitions. Word has length 92
[2024-11-07 19:48:35,607 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:35,607 INFO L471 AbstractCegarLoop]: Abstraction has 1269 states and 1451 transitions.
[2024-11-07 19:48:35,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.352941176470589) internal successors, (159), 17 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1451 transitions.
[2024-11-07 19:48:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2024-11-07 19:48:35,608 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:35,608 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:35,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2024-11-07 19:48:35,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2024-11-07 19:48:35,812 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:35,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:35,812 INFO L85 PathProgramCache]: Analyzing trace with hash -819850507, now seen corresponding path program 1 times
[2024-11-07 19:48:35,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:35,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006457687]
[2024-11-07 19:48:35,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:35,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2024-11-07 19:48:35,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-07 19:48:35,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006457687]
[2024-11-07 19:48:35,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006457687] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-07 19:48:35,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525853372]
[2024-11-07 19:48:35,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:35,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-07 19:48:35,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-07 19:48:35,997 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-07 19:48:36,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-11-07 19:48:36,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-07 19:48:36,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 21 conjuncts are in the unsatisfiable core
[2024-11-07 19:48:36,112 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-07 19:48:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-07 19:48:36,199 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-07 19:48:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2024-11-07 19:48:36,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525853372] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-07 19:48:36,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-07 19:48:36,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15
[2024-11-07 19:48:36,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136756408]
[2024-11-07 19:48:36,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-07 19:48:36,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-11-07 19:48:36,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-07 19:48:36,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-11-07 19:48:36,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210
[2024-11-07 19:48:36,341 INFO L87 Difference]: Start difference. First operand 1269 states and 1451 transitions. Second operand has 15 states, 15 states have (on average 15.133333333333333) internal successors, (227), 15 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:36,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-07 19:48:36,838 INFO L93 Difference]: Finished difference Result 2801 states and 3136 transitions.
[2024-11-07 19:48:36,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states.
[2024-11-07 19:48:36,838 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 15.133333333333333) internal successors, (227), 15 states have internal predecessors, (227), 0 states have call successors, (0), 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 97
[2024-11-07 19:48:36,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-07 19:48:36,840 INFO L225 Difference]: With dead ends: 2801
[2024-11-07 19:48:36,840 INFO L226 Difference]: Without dead ends: 781
[2024-11-07 19:48:36,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=299, Invalid=961, Unknown=0, NotChecked=0, Total=1260
[2024-11-07 19:48:36,841 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 671 mSDsluCounter, 1413 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-07 19:48:36,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1618 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-07 19:48:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states.
[2024-11-07 19:48:36,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 431.
[2024-11-07 19:48:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 1.1744186046511629) internal successors, (505), 430 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:36,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 505 transitions.
[2024-11-07 19:48:36,854 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 505 transitions. Word has length 97
[2024-11-07 19:48:36,854 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-07 19:48:36,854 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 505 transitions.
[2024-11-07 19:48:36,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 15.133333333333333) internal successors, (227), 15 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-07 19:48:36,854 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 505 transitions.
[2024-11-07 19:48:36,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108
[2024-11-07 19:48:36,854 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-07 19:48:36,855 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:36,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-11-07 19:48:37,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24
[2024-11-07 19:48:37,055 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] ===
[2024-11-07 19:48:37,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-07 19:48:37,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2012530208, now seen corresponding path program 1 times
[2024-11-07 19:48:37,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-07 19:48:37,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647681667]
[2024-11-07 19:48:37,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-07 19:48:37,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-07 19:48:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 19:48:37,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-07 19:48:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-07 19:48:37,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-07 19:48:37,171 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-07 19:48:37,172 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 41 remaining)
[2024-11-07 19:48:37,173 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 41 remaining)
[2024-11-07 19:48:37,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 41 remaining)
[2024-11-07 19:48:37,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-11-07 19:48:37,177 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-07 19:48:37,219 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-07 19:48:37,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:48:37 BoogieIcfgContainer
[2024-11-07 19:48:37,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-07 19:48:37,223 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-07 19:48:37,223 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-07 19:48:37,223 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-07 19:48:37,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:48:22" (3/4) ...
[2024-11-07 19:48:37,223 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-07 19:48:37,292 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-07 19:48:37,292 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-07 19:48:37,292 INFO L158 Benchmark]: Toolchain (without parser) took 15318.86ms. Allocated memory was 117.4MB in the beginning and 310.4MB in the end (delta: 192.9MB). Free memory was 91.5MB in the beginning and 258.7MB in the end (delta: -167.2MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB.
[2024-11-07 19:48:37,293 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 19:48:37,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.50ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 78.2MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 19:48:37,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.22ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 74.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 19:48:37,293 INFO L158 Benchmark]: Boogie Preprocessor took 48.05ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 71.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-07 19:48:37,293 INFO L158 Benchmark]: RCFGBuilder took 403.46ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 89.8MB in the end (delta: -18.1MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB.
[2024-11-07 19:48:37,293 INFO L158 Benchmark]: TraceAbstraction took 14549.21ms. Allocated memory was 117.4MB in the beginning and 310.4MB in the end (delta: 192.9MB). Free memory was 88.9MB in the beginning and 270.5MB in the end (delta: -181.6MB). Peak memory consumption was 181.9MB. Max. memory is 16.1GB.
[2024-11-07 19:48:37,293 INFO L158 Benchmark]: Witness Printer took 69.32ms. Allocated memory is still 310.4MB. Free memory was 270.5MB in the beginning and 258.7MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2024-11-07 19:48:37,294 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.19ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 195.50ms. Allocated memory is still 117.4MB. Free memory was 91.3MB in the beginning and 78.2MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 44.22ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 74.4MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 48.05ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 71.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 403.46ms. Allocated memory is still 117.4MB. Free memory was 71.7MB in the beginning and 89.8MB in the end (delta: -18.1MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB.
* TraceAbstraction took 14549.21ms. Allocated memory was 117.4MB in the beginning and 310.4MB in the end (delta: 192.9MB). Free memory was 88.9MB in the beginning and 270.5MB in the end (delta: -181.6MB). Peak memory consumption was 181.9MB. Max. memory is 16.1GB.
* Witness Printer took 69.32ms. Allocated memory is still 310.4MB. Free memory was 270.5MB in the beginning and 258.7MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. 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
- CounterExampleResult [Line: 116]: integer overflow possible
integer overflow possible
We found a FailurePath:
[L124] unsigned int a, b, r;
[L126] b = __VERIFIER_nondet_uint()
[L128] a = 234770789
[L130] CALL mp_add(a, b)
[L42] unsigned char a0, a1, a2, a3;
[L43] unsigned char b0, b1, b2, b3;
[L44] unsigned char r0, r1, r2, r3;
[L45] unsigned short carry;
[L46] unsigned short partial_sum;
[L47] unsigned int r;
[L48] unsigned char i;
[L49] unsigned char na, nb;
[L50] a0 = a
[L51] a1 = a >> 8
[L52] a2 = a >> 16U
[L53] a3 = a >> 24U
[L54] b0 = b
[L55] b1 = b >> 8U
[L56] b2 = b >> 16U
[L57] b3 = b >> 24U
[L58] na = (unsigned char)4
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, na=4]
[L59] COND FALSE !(a3 == (unsigned char)0)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, na=4]
[L68] nb = (unsigned char)4
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, na=4, nb=4]
[L69] COND FALSE !(b3 == (unsigned char)0)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, na=4, nb=4]
[L78] carry = (unsigned short)0
[L79] i = (unsigned char)0
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4]
[L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0)
[L81] partial_sum = carry
[L82] carry = (unsigned short)0
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=0]
[L83] COND TRUE i < na
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=0]
[L84] COND TRUE i == (unsigned char)0
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=0]
[L84] EXPR partial_sum + a0
[L84] partial_sum = partial_sum + a0
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101]
[L85] COND FALSE !(i == (unsigned char)1)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101]
[L86] COND FALSE !(i == (unsigned char)2)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101]
[L87] COND FALSE !(i == (unsigned char)3)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101]
[L89] COND TRUE i < nb
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101]
[L90] COND TRUE i == (unsigned char)0
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=101]
[L90] EXPR partial_sum + b0
[L90] partial_sum = partial_sum + b0
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=256]
[L91] COND FALSE !(i == (unsigned char)1)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=256]
[L92] COND FALSE !(i == (unsigned char)2)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=256]
[L93] COND FALSE !(i == (unsigned char)3)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=0, na=4, nb=4, partial_sum=256]
[L95] COND TRUE partial_sum > ((unsigned char)255)
[L96] partial_sum = partial_sum & ((unsigned char)255)
[L97] carry = (unsigned short)1
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0]
[L99] COND TRUE i == (unsigned char)0
[L99] r0 = (unsigned char)partial_sum
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0]
[L100] COND FALSE !(i == (unsigned char)1)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0]
[L101] COND FALSE !(i == (unsigned char)2)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0]
[L102] COND FALSE !(i == (unsigned char)3)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=0, na=4, nb=4, partial_sum=0, r0=0]
[L104] EXPR i + (unsigned char)1
[L104] i = i + (unsigned char)1
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0]
[L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0)
[L81] partial_sum = carry
[L82] carry = (unsigned short)0
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0]
[L83] COND TRUE i < na
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0]
[L84] COND FALSE !(i == (unsigned char)0)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0]
[L85] COND TRUE i == (unsigned char)1
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=1, r0=0]
[L85] EXPR partial_sum + a1
[L85] partial_sum = partial_sum + a1
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0]
[L86] COND FALSE !(i == (unsigned char)2)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0]
[L87] COND FALSE !(i == (unsigned char)3)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0]
[L89] COND TRUE i < nb
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0]
[L90] COND FALSE !(i == (unsigned char)0)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0]
[L91] COND TRUE i == (unsigned char)1
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=82, r0=0]
[L91] EXPR partial_sum + b1
[L91] partial_sum = partial_sum + b1
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0]
[L92] COND FALSE !(i == (unsigned char)2)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0]
[L93] COND FALSE !(i == (unsigned char)3)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=1, na=4, nb=4, partial_sum=256, r0=0]
[L95] COND TRUE partial_sum > ((unsigned char)255)
[L96] partial_sum = partial_sum & ((unsigned char)255)
[L97] carry = (unsigned short)1
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0]
[L99] COND FALSE !(i == (unsigned char)0)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0]
[L100] COND TRUE i == (unsigned char)1
[L100] r1 = (unsigned char)partial_sum
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0]
[L101] COND FALSE !(i == (unsigned char)2)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0]
[L102] COND FALSE !(i == (unsigned char)3)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=1, na=4, nb=4, partial_sum=0, r0=0, r1=0]
[L104] EXPR i + (unsigned char)1
[L104] i = i + (unsigned char)1
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0]
[L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0)
[L81] partial_sum = carry
[L82] carry = (unsigned short)0
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0]
[L83] COND TRUE i < na
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0]
[L84] COND FALSE !(i == (unsigned char)0)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0]
[L85] COND FALSE !(i == (unsigned char)1)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0]
[L86] COND TRUE i == (unsigned char)2
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=1, r0=0, r1=0]
[L86] EXPR partial_sum + a2
[L86] partial_sum = partial_sum + a2
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0]
[L87] COND FALSE !(i == (unsigned char)3)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0]
[L89] COND TRUE i < nb
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0]
[L90] COND FALSE !(i == (unsigned char)0)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0]
[L91] COND FALSE !(i == (unsigned char)1)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0]
[L92] COND TRUE i == (unsigned char)2
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=255, r0=0, r1=0]
[L92] EXPR partial_sum + b2
[L92] partial_sum = partial_sum + b2
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0]
[L93] COND FALSE !(i == (unsigned char)3)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=2, na=4, nb=4, partial_sum=256, r0=0, r1=0]
[L95] COND TRUE partial_sum > ((unsigned char)255)
[L96] partial_sum = partial_sum & ((unsigned char)255)
[L97] carry = (unsigned short)1
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0]
[L99] COND FALSE !(i == (unsigned char)0)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0]
[L100] COND FALSE !(i == (unsigned char)1)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0]
[L101] COND TRUE i == (unsigned char)2
[L101] r2 = (unsigned char)partial_sum
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0]
[L102] COND FALSE !(i == (unsigned char)3)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=2, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0]
[L104] EXPR i + (unsigned char)1
[L104] i = i + (unsigned char)1
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=1, i=3, na=4, nb=4, partial_sum=0, r0=0, r1=0, r2=0]
[L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0)
[L81] partial_sum = carry
[L82] carry = (unsigned short)0
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0]
[L83] COND TRUE i < na
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0]
[L84] COND FALSE !(i == (unsigned char)0)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0]
[L85] COND FALSE !(i == (unsigned char)1)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0]
[L86] COND FALSE !(i == (unsigned char)2)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0]
[L87] COND TRUE i == (unsigned char)3
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=1, r0=0, r1=0, r2=0]
[L87] EXPR partial_sum + a3
[L87] partial_sum = partial_sum + a3
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0]
[L89] COND TRUE i < nb
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0]
[L90] COND FALSE !(i == (unsigned char)0)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0]
[L91] COND FALSE !(i == (unsigned char)1)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0]
[L92] COND FALSE !(i == (unsigned char)2)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0]
[L93] COND TRUE i == (unsigned char)3
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=14, r0=0, r1=0, r2=0]
[L93] EXPR partial_sum + b3
[L93] partial_sum = partial_sum + b3
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0]
[L95] COND FALSE !(partial_sum > ((unsigned char)255))
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0]
[L99] COND FALSE !(i == (unsigned char)0)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0]
[L100] COND FALSE !(i == (unsigned char)1)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0]
[L101] COND FALSE !(i == (unsigned char)2)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, partial_sum=255, r0=0, r1=0, r2=0]
[L102] COND TRUE i == (unsigned char)3
[L102] r3 = (unsigned char)partial_sum
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=3, na=4, nb=4, r0=0, r1=0, r2=0, r3=255]
[L104] EXPR i + (unsigned char)1
[L104] i = i + (unsigned char)1
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, carry=0, i=4, na=4, nb=4, r0=0, r1=0, r2=0, r3=255]
[L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0))
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, i=4, r0=0, r1=0, r2=0, r3=255]
[L107] COND FALSE !(i < (unsigned char)4)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, r0=0, r1=0, r2=0, r3=255]
[L116] EXPR r1 << 8U
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, r0=0, r1=0, r2=0, r3=255]
[L116] EXPR r0 | (r1 << 8U)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, r2=0, r3=255]
[L116] EXPR r2 << 16U
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, r2=0, r3=255]
[L116] r0 | (r1 << 8U) | (r2 << 16U)
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241, r3=255]
[L116] r3 << 24U
VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4043419291, b1=15794606, b2=61697, b3=241]
- UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 64]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 72]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 84]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 85]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 86]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 87]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 90]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 91]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 92]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 93]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 104]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur
Unable to prove that integer overflow can never occur
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 1 procedures, 132 locations, 41 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 26, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5716 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5716 mSDsluCounter, 11858 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8763 mSDsCounter, 452 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5729 IncrementalHoareTripleChecker+Invalid, 6181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 452 mSolverCounterUnsat, 3095 mSDtfsCounter, 5729 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1652 GetRequests, 1364 SyntacticMatches, 2 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2290 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2142occurred in iteration=19, InterpolantAutomatonStates: 267, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 12407 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 2638 NumberOfCodeBlocks, 2638 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2939 ConstructedInterpolants, 0 QuantifiedInterpolants, 9999 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1960 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 41 InterpolantComputations, 20 PerfectInterpolantSequences, 2287/2663 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-11-07 19:48:37,314 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
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE(OVERFLOW)