./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.c --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/nla-digbench-scaling/hard-u_unwindbound20.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! overflow) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '28cfabe4b70eff8f7baaccb87c67f08c79dbf056ceeb2a0d56109f4b60f10f62'] 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/nla-digbench-scaling/hard-u_unwindbound20.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 28cfabe4b70eff8f7baaccb87c67f08c79dbf056ceeb2a0d56109f4b60f10f62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 20:36:45,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 20:36:46,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-07 20:36:46,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 20:36:46,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 20:36:46,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 20:36:46,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 20:36:46,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 20:36:46,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 20:36:46,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 20:36:46,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 20:36:46,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 20:36:46,075 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 20:36:46,075 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 20:36:46,075 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 20:36:46,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 20:36:46,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 20:36:46,076 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 20:36:46,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 20:36:46,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 20:36:46,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 20:36:46,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 20:36:46,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 20:36:46,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 20:36:46,077 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 20:36:46,077 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 20:36:46,077 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 20:36:46,077 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 20:36:46,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 20:36:46,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 20:36:46,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 20:36:46,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 20:36:46,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 20:36:46,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 20:36:46,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:36:46,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 20:36:46,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 20:36:46,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 20:36:46,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 20:36:46,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 20:36:46,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 20:36:46,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 20:36:46,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 20:36:46,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 20:36:46,079 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 -> 28cfabe4b70eff8f7baaccb87c67f08c79dbf056ceeb2a0d56109f4b60f10f62 [2024-11-07 20:36:46,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 20:36:46,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 20:36:46,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 20:36:46,377 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 20:36:46,379 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 20:36:46,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.c [2024-11-07 20:36:47,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 20:36:47,921 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 20:36:47,922 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.c [2024-11-07 20:36:47,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b8544d01/629c5bbf112f4f07a076ed3b83babee0/FLAG03a165c6f [2024-11-07 20:36:47,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3b8544d01/629c5bbf112f4f07a076ed3b83babee0 [2024-11-07 20:36:47,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 20:36:47,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 20:36:47,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 20:36:47,948 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 20:36:47,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 20:36:47,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:36:47" (1/1) ... [2024-11-07 20:36:47,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b6c1b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:47, skipping insertion in model container [2024-11-07 20:36:47,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:36:47" (1/1) ... [2024-11-07 20:36:47,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 20:36:48,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:36:48,125 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 20:36:48,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:36:48,160 INFO L204 MainTranslator]: Completed translation [2024-11-07 20:36:48,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:48 WrapperNode [2024-11-07 20:36:48,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 20:36:48,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 20:36:48,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 20:36:48,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 20:36:48,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:48" (1/1) ... [2024-11-07 20:36:48,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:48" (1/1) ... [2024-11-07 20:36:48,190 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-11-07 20:36:48,191 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 20:36:48,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 20:36:48,192 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 20:36:48,192 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 20:36:48,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:48" (1/1) ... [2024-11-07 20:36:48,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:48" (1/1) ... [2024-11-07 20:36:48,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:48" (1/1) ... [2024-11-07 20:36:48,220 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 20:36:48,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:48" (1/1) ... [2024-11-07 20:36:48,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:48" (1/1) ... [2024-11-07 20:36:48,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:48" (1/1) ... [2024-11-07 20:36:48,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:48" (1/1) ... [2024-11-07 20:36:48,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:48" (1/1) ... [2024-11-07 20:36:48,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:48" (1/1) ... [2024-11-07 20:36:48,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 20:36:48,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 20:36:48,230 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 20:36:48,230 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 20:36:48,231 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:48" (1/1) ... [2024-11-07 20:36:48,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:36:48,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:36:48,263 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 20:36:48,266 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 20:36:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 20:36:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 20:36:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 20:36:48,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 20:36:48,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 20:36:48,290 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 20:36:48,348 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 20:36:48,350 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 20:36:48,476 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-07 20:36:48,476 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 20:36:48,484 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 20:36:48,484 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 20:36:48,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:36:48 BoogieIcfgContainer [2024-11-07 20:36:48,484 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 20:36:48,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 20:36:48,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 20:36:48,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 20:36:48,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:36:47" (1/3) ... [2024-11-07 20:36:48,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230712cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:36:48, skipping insertion in model container [2024-11-07 20:36:48,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:36:48" (2/3) ... [2024-11-07 20:36:48,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230712cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:36:48, skipping insertion in model container [2024-11-07 20:36:48,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:36:48" (3/3) ... [2024-11-07 20:36:48,495 INFO L112 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound20.c [2024-11-07 20:36:48,507 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 20:36:48,508 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 20:36:48,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 20:36:48,559 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;@3bc01f2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 20:36:48,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 20:36:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:36:48,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 20:36:48,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:36:48,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 20:36:48,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:36:48,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:36:48,572 INFO L85 PathProgramCache]: Analyzing trace with hash 889508776, now seen corresponding path program 1 times [2024-11-07 20:36:48,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:36:48,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567129545] [2024-11-07 20:36:48,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:36:48,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:36:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:48,687 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 20:36:48,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:36:48,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567129545] [2024-11-07 20:36:48,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567129545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:36:48,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:36:48,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:36:48,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897846936] [2024-11-07 20:36:48,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:36:48,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 20:36:48,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:36:48,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 20:36:48,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 20:36:48,715 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 20:36:48,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:36:48,746 INFO L93 Difference]: Finished difference Result 68 states and 102 transitions. [2024-11-07 20:36:48,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 20:36:48,747 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-07 20:36:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:36:48,754 INFO L225 Difference]: With dead ends: 68 [2024-11-07 20:36:48,755 INFO L226 Difference]: Without dead ends: 28 [2024-11-07 20:36:48,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 20:36:48,760 INFO L432 NwaCegarLoop]: 45 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, 45 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 20:36:48,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:36:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-07 20:36:48,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-07 20:36:48,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 20:36:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2024-11-07 20:36:48,800 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 6 [2024-11-07 20:36:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:36:48,800 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2024-11-07 20:36:48,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 20:36:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2024-11-07 20:36:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-07 20:36:48,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:36:48,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-07 20:36:48,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 20:36:48,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:36:48,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:36:48,803 INFO L85 PathProgramCache]: Analyzing trace with hash 889568358, now seen corresponding path program 1 times [2024-11-07 20:36:48,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:36:48,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33477976] [2024-11-07 20:36:48,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:36:48,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:36:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:48,883 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 20:36:48,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:36:48,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33477976] [2024-11-07 20:36:48,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33477976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:36:48,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:36:48,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:36:48,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116745664] [2024-11-07 20:36:48,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:36:48,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:36:48,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:36:48,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:36:48,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:36:48,887 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 20:36:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:36:48,937 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-11-07 20:36:48,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:36:48,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-11-07 20:36:48,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:36:48,938 INFO L225 Difference]: With dead ends: 37 [2024-11-07 20:36:48,938 INFO L226 Difference]: Without dead ends: 36 [2024-11-07 20:36:48,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 20:36:48,939 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:36:48,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 67 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:36:48,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-07 20:36:48,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-11-07 20:36:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 20:36:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-07 20:36:48,949 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 6 [2024-11-07 20:36:48,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:36:48,950 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-07 20:36:48,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 20:36:48,950 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-07 20:36:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-07 20:36:48,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:36:48,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:36:48,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 20:36:48,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:36:48,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:36:48,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815370, now seen corresponding path program 1 times [2024-11-07 20:36:48,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:36:48,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827404214] [2024-11-07 20:36:48,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:36:48,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:36:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:49,035 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 20:36:49,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:36:49,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827404214] [2024-11-07 20:36:49,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827404214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:36:49,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:36:49,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:36:49,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898119255] [2024-11-07 20:36:49,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:36:49,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:36:49,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:36:49,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:36:49,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:36:49,037 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:36:49,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:36:49,079 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2024-11-07 20:36:49,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:36:49,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-07 20:36:49,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:36:49,081 INFO L225 Difference]: With dead ends: 50 [2024-11-07 20:36:49,081 INFO L226 Difference]: Without dead ends: 35 [2024-11-07 20:36:49,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 20:36:49,082 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:36:49,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:36:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-07 20:36:49,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-07 20:36:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 20:36:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-11-07 20:36:49,090 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 7 [2024-11-07 20:36:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:36:49,090 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-11-07 20:36:49,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:36:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-11-07 20:36:49,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 20:36:49,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:36:49,091 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:36:49,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 20:36:49,091 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:36:49,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:36:49,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1297109879, now seen corresponding path program 1 times [2024-11-07 20:36:49,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:36:49,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945205174] [2024-11-07 20:36:49,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:36:49,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:36:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:49,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:36:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:49,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 20:36:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:49,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 20:36:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:49,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:36:49,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:36:49,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945205174] [2024-11-07 20:36:49,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945205174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:36:49,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:36:49,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:36:49,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680095452] [2024-11-07 20:36:49,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:36:49,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:36:49,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:36:49,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:36:49,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:36:49,297 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 20:36:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:36:49,365 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-11-07 20:36:49,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 20:36:49,365 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-11-07 20:36:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:36:49,366 INFO L225 Difference]: With dead ends: 35 [2024-11-07 20:36:49,366 INFO L226 Difference]: Without dead ends: 34 [2024-11-07 20:36:49,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 20:36:49,367 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:36:49,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:36:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-07 20:36:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-07 20:36:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 20:36:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-07 20:36:49,379 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 26 [2024-11-07 20:36:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:36:49,380 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-07 20:36:49,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 20:36:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-07 20:36:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 20:36:49,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:36:49,381 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:36:49,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 20:36:49,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:36:49,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:36:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1555700513, now seen corresponding path program 1 times [2024-11-07 20:36:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:36:49,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751239239] [2024-11-07 20:36:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:36:49,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:36:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:49,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:36:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:49,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 20:36:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:49,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 20:36:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:49,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:36:49,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:36:49,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751239239] [2024-11-07 20:36:49,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751239239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:36:49,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:36:49,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 20:36:49,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55855592] [2024-11-07 20:36:49,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:36:49,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:36:49,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:36:49,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:36:49,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:36:49,553 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 20:36:49,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:36:49,643 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-11-07 20:36:49,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 20:36:49,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-07 20:36:49,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:36:49,644 INFO L225 Difference]: With dead ends: 51 [2024-11-07 20:36:49,645 INFO L226 Difference]: Without dead ends: 50 [2024-11-07 20:36:49,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 20:36:49,646 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:36:49,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 110 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:36:49,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-07 20:36:49,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2024-11-07 20:36:49,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.1875) internal successors, (38), 33 states have internal predecessors, (38), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 20:36:49,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-11-07 20:36:49,655 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 27 [2024-11-07 20:36:49,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:36:49,656 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-07 20:36:49,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 20:36:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-11-07 20:36:49,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 20:36:49,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:36:49,657 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:36:49,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 20:36:49,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:36:49,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:36:49,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1555664763, now seen corresponding path program 1 times [2024-11-07 20:36:49,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:36:49,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715963325] [2024-11-07 20:36:49,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:36:49,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:36:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:49,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:36:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:49,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 20:36:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:49,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 20:36:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:36:49,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:36:49,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715963325] [2024-11-07 20:36:49,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715963325] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:36:49,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564375321] [2024-11-07 20:36:49,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:36:49,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:36:49,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:36:49,776 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 20:36:49,777 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 20:36:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:49,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 20:36:49,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:36:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:36:49,935 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:36:49,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564375321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:36:49,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:36:49,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-07 20:36:49,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056895041] [2024-11-07 20:36:49,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:36:49,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:36:49,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:36:49,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:36:49,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 20:36:49,937 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 20:36:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:36:50,004 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-11-07 20:36:50,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:36:50,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-07 20:36:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:36:50,007 INFO L225 Difference]: With dead ends: 49 [2024-11-07 20:36:50,007 INFO L226 Difference]: Without dead ends: 48 [2024-11-07 20:36:50,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 20:36:50,007 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:36:50,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 84 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:36:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-07 20:36:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2024-11-07 20:36:50,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 20:36:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2024-11-07 20:36:50,022 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 27 [2024-11-07 20:36:50,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:36:50,022 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2024-11-07 20:36:50,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 20:36:50,022 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2024-11-07 20:36:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 20:36:50,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:36:50,024 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:36:50,041 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 20:36:50,227 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 20:36:50,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:36:50,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:36:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1040655112, now seen corresponding path program 1 times [2024-11-07 20:36:50,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:36:50,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088918927] [2024-11-07 20:36:50,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:36:50,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:36:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:50,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:36:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:50,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 20:36:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:50,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 20:36:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:36:50,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:36:50,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088918927] [2024-11-07 20:36:50,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088918927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:36:50,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869644175] [2024-11-07 20:36:50,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:36:50,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:36:50,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:36:50,333 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 20:36:50,334 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 20:36:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:50,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 20:36:50,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:36:50,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:36:50,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:36:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:36:50,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869644175] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:36:50,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:36:50,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2024-11-07 20:36:50,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405582441] [2024-11-07 20:36:50,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:36:50,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 20:36:50,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:36:50,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 20:36:50,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-07 20:36:50,542 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 20:36:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:36:50,699 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2024-11-07 20:36:50,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 20:36:50,699 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 31 [2024-11-07 20:36:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:36:50,700 INFO L225 Difference]: With dead ends: 93 [2024-11-07 20:36:50,700 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 20:36:50,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2024-11-07 20:36:50,701 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 56 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:36:50,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 123 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:36:50,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 20:36:50,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 72. [2024-11-07 20:36:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.1346153846153846) internal successors, (59), 52 states have internal predecessors, (59), 14 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-07 20:36:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2024-11-07 20:36:50,719 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 31 [2024-11-07 20:36:50,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:36:50,719 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2024-11-07 20:36:50,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-07 20:36:50,720 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2024-11-07 20:36:50,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-07 20:36:50,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:36:50,721 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-11-07 20:36:50,738 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 20:36:50,925 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 20:36:50,926 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:36:50,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:36:50,926 INFO L85 PathProgramCache]: Analyzing trace with hash 182070449, now seen corresponding path program 1 times [2024-11-07 20:36:50,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:36:50,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500230992] [2024-11-07 20:36:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:36:50,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:36:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:51,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:36:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:51,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 20:36:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:51,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 20:36:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:51,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 20:36:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:51,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 20:36:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:51,068 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 20:36:51,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:36:51,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500230992] [2024-11-07 20:36:51,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500230992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:36:51,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076266429] [2024-11-07 20:36:51,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:36:51,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:36:51,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:36:51,073 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 20:36:51,074 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 20:36:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:51,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 20:36:51,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:36:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-07 20:36:51,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:36:51,378 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 20:36:51,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076266429] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:36:51,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:36:51,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-11-07 20:36:51,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377724421] [2024-11-07 20:36:51,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:36:51,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 20:36:51,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:36:51,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 20:36:51,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-07 20:36:51,382 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-07 20:36:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:36:51,768 INFO L93 Difference]: Finished difference Result 133 states and 162 transitions. [2024-11-07 20:36:51,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-07 20:36:51,769 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) Word has length 43 [2024-11-07 20:36:51,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:36:51,771 INFO L225 Difference]: With dead ends: 133 [2024-11-07 20:36:51,773 INFO L226 Difference]: Without dead ends: 132 [2024-11-07 20:36:51,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 20:36:51,774 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:36:51,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 159 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:36:51,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-07 20:36:51,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-07 20:36:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 97 states have internal predecessors, (109), 24 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 20:36:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2024-11-07 20:36:51,794 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 43 [2024-11-07 20:36:51,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:36:51,795 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2024-11-07 20:36:51,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 6 states have call predecessors, (15), 6 states have call successors, (15) [2024-11-07 20:36:51,795 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2024-11-07 20:36:51,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 20:36:51,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:36:51,797 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:36:51,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 20:36:52,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:36:52,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:36:52,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:36:52,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1955862377, now seen corresponding path program 2 times [2024-11-07 20:36:52,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:36:52,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278743709] [2024-11-07 20:36:52,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:36:52,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:36:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:52,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:36:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:52,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 20:36:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:52,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 20:36:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:52,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 20:36:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:52,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 20:36:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:52,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 20:36:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:52,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 20:36:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 20:36:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 20:36:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:52,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 20:36:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:52,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 20:36:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:52,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:36:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 20:36:52,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:36:52,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278743709] [2024-11-07 20:36:52,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278743709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:36:52,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820221222] [2024-11-07 20:36:52,293 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 20:36:52,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:36:52,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:36:52,295 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 20:36:52,297 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 20:36:52,365 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 20:36:52,366 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 20:36:52,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 20:36:52,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:36:52,647 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 12 proven. 268 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-07 20:36:52,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:36:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-07 20:36:52,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820221222] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:36:52,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:36:52,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2024-11-07 20:36:52,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453743494] [2024-11-07 20:36:52,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:36:52,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-07 20:36:52,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:36:52,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-07 20:36:52,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=861, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 20:36:52,988 INFO L87 Difference]: Start difference. First operand 132 states and 157 transitions. Second operand has 34 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-07 20:36:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:36:53,490 INFO L93 Difference]: Finished difference Result 196 states and 233 transitions. [2024-11-07 20:36:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 20:36:53,490 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) Word has length 91 [2024-11-07 20:36:53,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:36:53,492 INFO L225 Difference]: With dead ends: 196 [2024-11-07 20:36:53,492 INFO L226 Difference]: Without dead ends: 183 [2024-11-07 20:36:53,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=791, Invalid=2071, Unknown=0, NotChecked=0, Total=2862 [2024-11-07 20:36:53,496 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 198 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:36:53,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 250 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:36:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-07 20:36:53,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 144. [2024-11-07 20:36:53,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 105 states have (on average 1.1238095238095238) internal successors, (118), 105 states have internal predecessors, (118), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 20:36:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 172 transitions. [2024-11-07 20:36:53,516 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 172 transitions. Word has length 91 [2024-11-07 20:36:53,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:36:53,517 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 172 transitions. [2024-11-07 20:36:53,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.0) internal successors, (102), 34 states have internal predecessors, (102), 12 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 12 states have call predecessors, (36), 12 states have call successors, (36) [2024-11-07 20:36:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 172 transitions. [2024-11-07 20:36:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-07 20:36:53,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:36:53,519 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:36:53,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 20:36:53,720 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,SelfDestructingSolverStorable8 [2024-11-07 20:36:53,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:36:53,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:36:53,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1533400926, now seen corresponding path program 1 times [2024-11-07 20:36:53,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:36:53,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035103687] [2024-11-07 20:36:53,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:36:53,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:36:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:36:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 20:36:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 20:36:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 20:36:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 20:36:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 20:36:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 20:36:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 20:36:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 20:36:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 20:36:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 20:36:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 20:36:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 20:36:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 20:36:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 20:36:54,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:36:54,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035103687] [2024-11-07 20:36:54,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035103687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:36:54,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254280997] [2024-11-07 20:36:54,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:36:54,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:36:54,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:36:54,135 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 20:36:54,136 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 20:36:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:54,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 20:36:54,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:36:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 3 proven. 389 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-07 20:36:54,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:36:54,975 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 3 proven. 65 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-07 20:36:54,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254280997] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:36:54,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:36:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2024-11-07 20:36:54,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250679278] [2024-11-07 20:36:54,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:36:54,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-07 20:36:54,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:36:54,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-07 20:36:54,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=1344, Unknown=0, NotChecked=0, Total=1722 [2024-11-07 20:36:54,979 INFO L87 Difference]: Start difference. First operand 144 states and 172 transitions. Second operand has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 42 states have internal predecessors, (138), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) [2024-11-07 20:36:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:36:56,097 INFO L93 Difference]: Finished difference Result 370 states and 444 transitions. [2024-11-07 20:36:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-11-07 20:36:56,098 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 42 states have internal predecessors, (138), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) Word has length 111 [2024-11-07 20:36:56,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:36:56,101 INFO L225 Difference]: With dead ends: 370 [2024-11-07 20:36:56,101 INFO L226 Difference]: Without dead ends: 369 [2024-11-07 20:36:56,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1659, Invalid=4661, Unknown=0, NotChecked=0, Total=6320 [2024-11-07 20:36:56,105 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 265 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:36:56,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 380 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:36:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-07 20:36:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 252. [2024-11-07 20:36:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 186 states have (on average 1.118279569892473) internal successors, (208), 186 states have internal predecessors, (208), 45 states have call successors, (45), 20 states have call predecessors, (45), 20 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-07 20:36:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 298 transitions. [2024-11-07 20:36:56,141 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 298 transitions. Word has length 111 [2024-11-07 20:36:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:36:56,142 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 298 transitions. [2024-11-07 20:36:56,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 42 states have internal predecessors, (138), 18 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 18 states have call predecessors, (42), 18 states have call successors, (42) [2024-11-07 20:36:56,142 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 298 transitions. [2024-11-07 20:36:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-07 20:36:56,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:36:56,151 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2024-11-07 20:36:56,167 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 20:36:56,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-07 20:36:56,355 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:36:56,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:36:56,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1354925193, now seen corresponding path program 2 times [2024-11-07 20:36:56,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:36:56,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719468826] [2024-11-07 20:36:56,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:36:56,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:36:56,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:36:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 20:36:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 20:36:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 20:36:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 20:36:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 20:36:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 20:36:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 20:36:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 20:36:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 20:36:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 20:36:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 20:36:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 20:36:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 20:36:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 20:36:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 20:36:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 20:36:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 20:36:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 20:36:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 20:36:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 20:36:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 20:36:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 20:36:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 20:36:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 20:36:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 20:36:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-07 20:36:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-11-07 20:36:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-07 20:36:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:36:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2038 backedges. 0 proven. 414 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 20:36:57,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:36:57,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719468826] [2024-11-07 20:36:57,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719468826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:36:57,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411381178] [2024-11-07 20:36:57,481 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 20:36:57,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:36:57,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:36:57,483 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 20:36:57,485 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 20:36:57,619 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 20:36:57,620 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 20:36:57,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 20:36:57,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:36:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2038 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-07 20:36:57,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:36:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2038 backedges. 0 proven. 414 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-07 20:36:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411381178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:36:58,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:36:58,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 29] total 57 [2024-11-07 20:36:58,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634469202] [2024-11-07 20:36:58,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:36:58,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-07 20:36:58,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:36:58,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-07 20:36:58,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=2569, Unknown=0, NotChecked=0, Total=3306 [2024-11-07 20:36:58,799 INFO L87 Difference]: Start difference. First operand 252 states and 298 transitions. Second operand has 58 states, 57 states have (on average 3.6140350877192984) internal successors, (206), 58 states have internal predecessors, (206), 26 states have call successors, (87), 14 states have call predecessors, (87), 14 states have return successors, (87), 26 states have call predecessors, (87), 26 states have call successors, (87) [2024-11-07 20:37:00,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:37:00,403 INFO L93 Difference]: Finished difference Result 762 states and 904 transitions. [2024-11-07 20:37:00,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2024-11-07 20:37:00,404 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 3.6140350877192984) internal successors, (206), 58 states have internal predecessors, (206), 26 states have call successors, (87), 14 states have call predecessors, (87), 14 states have return successors, (87), 26 states have call predecessors, (87), 26 states have call successors, (87) Word has length 227 [2024-11-07 20:37:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:37:00,413 INFO L225 Difference]: With dead ends: 762 [2024-11-07 20:37:00,413 INFO L226 Difference]: Without dead ends: 761 [2024-11-07 20:37:00,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3474 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3562, Invalid=10244, Unknown=0, NotChecked=0, Total=13806 [2024-11-07 20:37:00,418 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 421 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 20:37:00,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 349 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 20:37:00,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-11-07 20:37:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 356. [2024-11-07 20:37:00,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 261 states have (on average 1.1226053639846743) internal successors, (293), 261 states have internal predecessors, (293), 65 states have call successors, (65), 29 states have call predecessors, (65), 29 states have return successors, (65), 65 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-07 20:37:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 423 transitions. [2024-11-07 20:37:00,455 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 423 transitions. Word has length 227 [2024-11-07 20:37:00,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:37:00,456 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 423 transitions. [2024-11-07 20:37:00,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 3.6140350877192984) internal successors, (206), 58 states have internal predecessors, (206), 26 states have call successors, (87), 14 states have call predecessors, (87), 14 states have return successors, (87), 26 states have call predecessors, (87), 26 states have call successors, (87) [2024-11-07 20:37:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 423 transitions. [2024-11-07 20:37:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-07 20:37:00,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:37:00,460 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2024-11-07 20:37:00,477 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 20:37:00,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 20:37:00,665 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:37:00,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:37:00,665 INFO L85 PathProgramCache]: Analyzing trace with hash -721746986, now seen corresponding path program 3 times [2024-11-07 20:37:00,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:37:00,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386999969] [2024-11-07 20:37:00,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:37:00,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:37:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:37:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-07 20:37:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-07 20:37:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 20:37:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 20:37:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 20:37:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 20:37:01,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-07 20:37:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 20:37:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 20:37:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 20:37:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 20:37:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 20:37:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 20:37:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 20:37:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 20:37:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 20:37:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 20:37:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 20:37:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 20:37:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 20:37:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-07 20:37:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-11-07 20:37:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-07 20:37:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-07 20:37:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 20:37:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-07 20:37:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-07 20:37:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-07 20:37:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-11-07 20:37:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-07 20:37:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-07 20:37:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-07 20:37:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-07 20:37:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:37:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 0 proven. 521 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-07 20:37:01,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:37:01,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386999969] [2024-11-07 20:37:01,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386999969] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:37:01,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756300648] [2024-11-07 20:37:01,847 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 20:37:01,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:37:01,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:37:01,850 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 20:37:01,865 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 20:37:01,937 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-07 20:37:01,937 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 20:37:01,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 20:37:01,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:37:02,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2765 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 2426 trivial. 0 not checked. [2024-11-07 20:37:02,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:37:02,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756300648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:37:02,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:37:02,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [33] total 36 [2024-11-07 20:37:02,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052493007] [2024-11-07 20:37:02,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:37:02,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:37:02,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:37:02,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:37:02,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1041, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 20:37:02,040 INFO L87 Difference]: Start difference. First operand 356 states and 423 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 20:37:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:37:02,145 INFO L93 Difference]: Finished difference Result 364 states and 431 transitions. [2024-11-07 20:37:02,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:37:02,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 263 [2024-11-07 20:37:02,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:37:02,147 INFO L225 Difference]: With dead ends: 364 [2024-11-07 20:37:02,147 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 20:37:02,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2024-11-07 20:37:02,151 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:37:02,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 94 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:37:02,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 20:37:02,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 20:37:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:37:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 20:37:02,152 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 263 [2024-11-07 20:37:02,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:37:02,152 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 20:37:02,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 20:37:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 20:37:02,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 20:37:02,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-07 20:37:02,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-07 20:37:02,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-07 20:37:02,156 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-07 20:37:02,172 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 20:37:02,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:37:02,364 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:37:02,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 20:37:03,479 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 20:37:03,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:37:03 BoogieIcfgContainer [2024-11-07 20:37:03,494 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 20:37:03,494 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 20:37:03,495 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 20:37:03,495 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 20:37:03,495 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:36:48" (3/4) ... [2024-11-07 20:37:03,497 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 20:37:03,502 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-07 20:37:03,506 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-07 20:37:03,506 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 20:37:03,506 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 20:37:03,506 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 20:37:03,584 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 20:37:03,585 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 20:37:03,585 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 20:37:03,586 INFO L158 Benchmark]: Toolchain (without parser) took 15640.17ms. Allocated memory was 100.7MB in the beginning and 268.4MB in the end (delta: 167.8MB). Free memory was 77.7MB in the beginning and 214.8MB in the end (delta: -137.1MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-07 20:37:03,587 INFO L158 Benchmark]: CDTParser took 1.06ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:37:03,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.56ms. Allocated memory is still 100.7MB. Free memory was 77.6MB in the beginning and 66.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:37:03,587 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.89ms. Allocated memory is still 100.7MB. Free memory was 66.6MB in the beginning and 65.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:37:03,587 INFO L158 Benchmark]: Boogie Preprocessor took 36.37ms. Allocated memory is still 100.7MB. Free memory was 65.4MB in the beginning and 64.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:37:03,588 INFO L158 Benchmark]: RCFGBuilder took 254.98ms. Allocated memory is still 100.7MB. Free memory was 64.1MB in the beginning and 52.7MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 20:37:03,588 INFO L158 Benchmark]: TraceAbstraction took 15005.61ms. Allocated memory was 100.7MB in the beginning and 268.4MB in the end (delta: 167.8MB). Free memory was 52.1MB in the beginning and 220.0MB in the end (delta: -167.9MB). Peak memory consumption was 134.7MB. Max. memory is 16.1GB. [2024-11-07 20:37:03,588 INFO L158 Benchmark]: Witness Printer took 90.96ms. Allocated memory is still 268.4MB. Free memory was 220.0MB in the beginning and 214.8MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:37:03,590 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.06ms. Allocated memory is still 83.9MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.56ms. Allocated memory is still 100.7MB. Free memory was 77.6MB in the beginning and 66.7MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.89ms. Allocated memory is still 100.7MB. Free memory was 66.6MB in the beginning and 65.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.37ms. Allocated memory is still 100.7MB. Free memory was 65.4MB in the beginning and 64.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 254.98ms. Allocated memory is still 100.7MB. Free memory was 64.1MB in the beginning and 52.7MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15005.61ms. Allocated memory was 100.7MB in the beginning and 268.4MB in the end (delta: 167.8MB). Free memory was 52.1MB in the beginning and 220.0MB in the end (delta: -167.9MB). Peak memory consumption was 134.7MB. Max. memory is 16.1GB. * Witness Printer took 90.96ms. Allocated memory is still 268.4MB. Free memory was 220.0MB in the beginning and 214.8MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 36 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 12, TraceHistogramMax: 34, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1121 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1121 mSDsluCounter, 1810 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1484 mSDsCounter, 144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1361 IncrementalHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 144 mSolverCounterUnsat, 326 mSDtfsCounter, 1361 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1762 GetRequests, 1404 SyntacticMatches, 0 SemanticMatches, 358 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5649 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred in iteration=11, InterpolantAutomatonStates: 258, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 583 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1658 NumberOfCodeBlocks, 1454 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2137 ConstructedInterpolants, 0 QuantifiedInterpolants, 4471 SizeOfPredicates, 55 NumberOfNonLiveVariables, 1387 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 9890/14155 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((1 <= counter) && (counter <= 20)) || (counter == 0)) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: ((1 <= counter) && (counter <= 2147483637)) - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert. Ensures: (counter == \old(counter)) RESULT: Ultimate proved your program to be correct! [2024-11-07 20:37:03,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE