./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound50.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! overflow) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '5b0ae54926d75c04421ee4ea5930c958fb8ba0ccacc4d56435da8ae7b298172d'] 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/divbin2_unwindbound50.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b0ae54926d75c04421ee4ea5930c958fb8ba0ccacc4d56435da8ae7b298172d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 20:19:38,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 20:19:38,435 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:19:38,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 20:19:38,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 20:19:38,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 20:19:38,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 20:19:38,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 20:19:38,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 20:19:38,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 20:19:38,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 20:19:38,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 20:19:38,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 20:19:38,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 20:19:38,472 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 20:19:38,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 20:19:38,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 20:19:38,472 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 20:19:38,472 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 20:19:38,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 20:19:38,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 20:19:38,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 20:19:38,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 20:19:38,473 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 20:19:38,473 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 20:19:38,473 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 20:19:38,473 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 20:19:38,473 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 20:19:38,473 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 20:19:38,473 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 20:19:38,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 20:19:38,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 20:19:38,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 20:19:38,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 20:19:38,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:19:38,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 20:19:38,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 20:19:38,474 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 20:19:38,474 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 20:19:38,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 20:19:38,474 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 20:19:38,474 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 20:19:38,474 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 20:19:38,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 20:19:38,475 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 -> 5b0ae54926d75c04421ee4ea5930c958fb8ba0ccacc4d56435da8ae7b298172d [2024-11-07 20:19:38,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 20:19:38,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 20:19:38,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 20:19:38,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 20:19:38,768 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 20:19:38,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound50.i [2024-11-07 20:19:40,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 20:19:40,271 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 20:19:40,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_unwindbound50.i [2024-11-07 20:19:40,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/840d2c876/753d468d811345359c314cc651374aac/FLAGa9206c65e [2024-11-07 20:19:40,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/840d2c876/753d468d811345359c314cc651374aac [2024-11-07 20:19:40,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 20:19:40,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 20:19:40,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 20:19:40,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 20:19:40,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 20:19:40,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:40" (1/1) ... [2024-11-07 20:19:40,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4356b5a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:40, skipping insertion in model container [2024-11-07 20:19:40,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:19:40" (1/1) ... [2024-11-07 20:19:40,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 20:19:40,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:19:40,477 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 20:19:40,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:19:40,502 INFO L204 MainTranslator]: Completed translation [2024-11-07 20:19:40,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:40 WrapperNode [2024-11-07 20:19:40,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 20:19:40,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 20:19:40,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 20:19:40,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 20:19:40,509 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:19:40" (1/1) ... [2024-11-07 20:19:40,514 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:19:40" (1/1) ... [2024-11-07 20:19:40,528 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2024-11-07 20:19:40,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 20:19:40,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 20:19:40,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 20:19:40,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 20:19:40,536 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:40" (1/1) ... [2024-11-07 20:19:40,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:40" (1/1) ... [2024-11-07 20:19:40,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:40" (1/1) ... [2024-11-07 20:19:40,552 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:19:40,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:40" (1/1) ... [2024-11-07 20:19:40,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:40" (1/1) ... [2024-11-07 20:19:40,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:40" (1/1) ... [2024-11-07 20:19:40,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:40" (1/1) ... [2024-11-07 20:19:40,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:40" (1/1) ... [2024-11-07 20:19:40,569 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:40" (1/1) ... [2024-11-07 20:19:40,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 20:19:40,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 20:19:40,575 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 20:19:40,575 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 20:19:40,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:40" (1/1) ... [2024-11-07 20:19:40,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:19:40,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:19:40,613 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:19:40,616 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:19:40,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 20:19:40,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 20:19:40,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 20:19:40,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 20:19:40,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 20:19:40,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 20:19:40,706 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 20:19:40,708 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 20:19:40,870 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-07 20:19:40,870 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 20:19:40,878 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 20:19:40,878 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 20:19:40,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:40 BoogieIcfgContainer [2024-11-07 20:19:40,879 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 20:19:40,881 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 20:19:40,881 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 20:19:40,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 20:19:40,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:19:40" (1/3) ... [2024-11-07 20:19:40,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cff3ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:40, skipping insertion in model container [2024-11-07 20:19:40,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:19:40" (2/3) ... [2024-11-07 20:19:40,887 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cff3ba2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:19:40, skipping insertion in model container [2024-11-07 20:19:40,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:40" (3/3) ... [2024-11-07 20:19:40,889 INFO L112 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound50.i [2024-11-07 20:19:40,903 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 20:19:40,904 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-07 20:19:40,952 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 20:19:40,960 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;@352e8cbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 20:19:40,961 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-07 20:19:40,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:19:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-07 20:19:40,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:40,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-07 20:19:40,969 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:19:40,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:40,973 INFO L85 PathProgramCache]: Analyzing trace with hash 925668, now seen corresponding path program 1 times [2024-11-07 20:19:40,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:40,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971319904] [2024-11-07 20:19:40,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:40,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:41,133 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:19:41,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:41,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971319904] [2024-11-07 20:19:41,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971319904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:19:41,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:19:41,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:19:41,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825152068] [2024-11-07 20:19:41,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:19:41,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:19:41,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:41,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:19:41,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:19:41,159 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 26 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:19:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:41,228 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2024-11-07 20:19:41,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:19:41,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-07 20:19:41,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:41,235 INFO L225 Difference]: With dead ends: 55 [2024-11-07 20:19:41,235 INFO L226 Difference]: Without dead ends: 26 [2024-11-07 20:19:41,237 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:19:41,240 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:41,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 71 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:19:41,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-07 20:19:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2024-11-07 20:19:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 18 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:19:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2024-11-07 20:19:41,275 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 4 [2024-11-07 20:19:41,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:41,276 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2024-11-07 20:19:41,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:19:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2024-11-07 20:19:41,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 20:19:41,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:41,277 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 20:19:41,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 20:19:41,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:19:41,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:41,278 INFO L85 PathProgramCache]: Analyzing trace with hash 28695749, now seen corresponding path program 1 times [2024-11-07 20:19:41,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:41,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802995757] [2024-11-07 20:19:41,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:41,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:41,361 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:19:41,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:41,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802995757] [2024-11-07 20:19:41,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802995757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:19:41,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:19:41,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:19:41,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574797313] [2024-11-07 20:19:41,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:19:41,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:19:41,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:41,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:19:41,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:19:41,364 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:19:41,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:41,419 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-07 20:19:41,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:19:41,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-07 20:19:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:41,421 INFO L225 Difference]: With dead ends: 39 [2024-11-07 20:19:41,422 INFO L226 Difference]: Without dead ends: 25 [2024-11-07 20:19:41,422 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:19:41,423 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 54 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:19:41,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 54 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:19:41,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-07 20:19:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-07 20:19:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:19:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2024-11-07 20:19:41,432 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 5 [2024-11-07 20:19:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:41,432 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2024-11-07 20:19:41,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:19:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2024-11-07 20:19:41,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 20:19:41,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:41,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:41,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 20:19:41,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:19:41,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:41,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1180015242, now seen corresponding path program 1 times [2024-11-07 20:19:41,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:41,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005094472] [2024-11-07 20:19:41,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:41,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:41,541 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:19:41,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005094472] [2024-11-07 20:19:41,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005094472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:19:41,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:19:41,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:19:41,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263742180] [2024-11-07 20:19:41,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:19:41,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:19:41,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:41,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:19:41,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:19:41,544 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:19:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:41,622 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2024-11-07 20:19:41,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 20:19:41,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-07 20:19:41,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:41,623 INFO L225 Difference]: With dead ends: 25 [2024-11-07 20:19:41,624 INFO L226 Difference]: Without dead ends: 24 [2024-11-07 20:19:41,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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:19:41,624 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 35 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:19:41,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 35 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:19:41,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-07 20:19:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-07 20:19:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:19:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2024-11-07 20:19:41,633 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 9 [2024-11-07 20:19:41,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:41,634 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2024-11-07 20:19:41,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 20:19:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2024-11-07 20:19:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 20:19:41,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:41,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:41,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 20:19:41,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:19:41,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:41,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2074233100, now seen corresponding path program 1 times [2024-11-07 20:19:41,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:41,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561641730] [2024-11-07 20:19:41,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:41,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:41,738 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:19:41,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:41,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561641730] [2024-11-07 20:19:41,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561641730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:19:41,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:19:41,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:19:41,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618698292] [2024-11-07 20:19:41,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:19:41,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:19:41,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:41,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:19:41,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:19:41,740 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:19:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:41,805 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2024-11-07 20:19:41,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 20:19:41,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2024-11-07 20:19:41,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:41,807 INFO L225 Difference]: With dead ends: 34 [2024-11-07 20:19:41,807 INFO L226 Difference]: Without dead ends: 33 [2024-11-07 20:19:41,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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:19:41,808 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:41,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 60 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:19:41,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-07 20:19:41,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2024-11-07 20:19:41,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:19:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-07 20:19:41,815 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2024-11-07 20:19:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:41,815 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-07 20:19:41,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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:19:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2024-11-07 20:19:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-07 20:19:41,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:41,815 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:41,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 20:19:41,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:19:41,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:41,817 INFO L85 PathProgramCache]: Analyzing trace with hash -2074194371, now seen corresponding path program 1 times [2024-11-07 20:19:41,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:41,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954745007] [2024-11-07 20:19:41,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:41,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:19:41,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:41,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954745007] [2024-11-07 20:19:41,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954745007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:19:41,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609666684] [2024-11-07 20:19:41,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:41,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:41,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:19:41,896 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:19:41,898 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:19:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:41,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 20:19:41,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:19:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:19:41,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:19:41,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609666684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:19:41,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:19:41,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2024-11-07 20:19:41,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390621374] [2024-11-07 20:19:42,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:19:42,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:19:42,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:42,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:19:42,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 20:19:42,001 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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:19:42,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:42,044 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-07 20:19:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:19:42,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2024-11-07 20:19:42,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:42,045 INFO L225 Difference]: With dead ends: 32 [2024-11-07 20:19:42,045 INFO L226 Difference]: Without dead ends: 31 [2024-11-07 20:19:42,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 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:19:42,045 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:42,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 58 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:19:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-07 20:19:42,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-07 20:19:42,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:19:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2024-11-07 20:19:42,049 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2024-11-07 20:19:42,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:42,050 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2024-11-07 20:19:42,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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:19:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2024-11-07 20:19:42,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 20:19:42,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:42,051 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:42,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 20:19:42,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:42,255 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:19:42,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:42,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1945618765, now seen corresponding path program 1 times [2024-11-07 20:19:42,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:42,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393582781] [2024-11-07 20:19:42,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:42,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:19:42,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:42,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393582781] [2024-11-07 20:19:42,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393582781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:19:42,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000497826] [2024-11-07 20:19:42,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:42,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:42,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:19:42,345 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:19:42,346 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:19:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:42,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 20:19:42,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:19:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:19:42,406 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:19:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:19:42,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000497826] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:19:42,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:19:42,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-07 20:19:42,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421505105] [2024-11-07 20:19:42,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:19:42,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 20:19:42,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:42,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 20:19:42,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-07 20:19:42,469 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:19:42,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:42,590 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-11-07 20:19:42,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 20:19:42,590 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 14 [2024-11-07 20:19:42,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:42,591 INFO L225 Difference]: With dead ends: 61 [2024-11-07 20:19:42,591 INFO L226 Difference]: Without dead ends: 49 [2024-11-07 20:19:42,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 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:19:42,592 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:42,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:19:42,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-07 20:19:42,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2024-11-07 20:19:42,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 20:19:42,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-07 20:19:42,597 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 14 [2024-11-07 20:19:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:42,597 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-07 20:19:42,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:19:42,598 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-07 20:19:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 20:19:42,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:42,598 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:42,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 20:19:42,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:42,803 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:19:42,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash 186216572, now seen corresponding path program 1 times [2024-11-07 20:19:42,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:42,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838036361] [2024-11-07 20:19:42,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:42,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:42,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:19:42,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:42,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838036361] [2024-11-07 20:19:42,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838036361] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:19:42,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038333222] [2024-11-07 20:19:42,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:42,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:42,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:19:42,899 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:19:42,901 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:19:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:42,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 20:19:42,937 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:19:43,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:19:43,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:19:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:19:43,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038333222] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:19:43,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:19:43,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2024-11-07 20:19:43,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305176382] [2024-11-07 20:19:43,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:19:43,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 20:19:43,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:43,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 20:19:43,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2024-11-07 20:19:43,115 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 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:19:43,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:43,412 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2024-11-07 20:19:43,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 20:19:43,412 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-07 20:19:43,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:43,414 INFO L225 Difference]: With dead ends: 70 [2024-11-07 20:19:43,414 INFO L226 Difference]: Without dead ends: 69 [2024-11-07 20:19:43,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2024-11-07 20:19:43,415 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 107 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:43,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 123 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:19:43,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-07 20:19:43,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-11-07 20:19:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 20:19:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-11-07 20:19:43,427 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 15 [2024-11-07 20:19:43,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:43,428 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-11-07 20:19:43,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.411764705882353) internal successors, (41), 18 states have internal predecessors, (41), 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:19:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-11-07 20:19:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-07 20:19:43,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:43,429 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:19:43,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 20:19:43,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:43,636 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:19:43,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:43,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1204191181, now seen corresponding path program 1 times [2024-11-07 20:19:43,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:43,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538044044] [2024-11-07 20:19:43,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:43,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:43,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 20:19:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:43,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 20:19:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:43,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 20:19:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:19:43,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538044044] [2024-11-07 20:19:43,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538044044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:19:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226838887] [2024-11-07 20:19:43,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:43,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:43,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:19:43,917 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:19:43,919 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:19:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:43,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 20:19:43,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:19:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:19:44,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:19:44,444 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 20:19:44,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226838887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:19:44,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:19:44,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 29 [2024-11-07 20:19:44,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000924329] [2024-11-07 20:19:44,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:19:44,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-07 20:19:44,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:44,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-07 20:19:44,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-11-07 20:19:44,447 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 30 states have internal predecessors, (92), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 20:19:45,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:45,056 INFO L93 Difference]: Finished difference Result 216 states and 245 transitions. [2024-11-07 20:19:45,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-07 20:19:45,057 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 30 states have internal predecessors, (92), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 43 [2024-11-07 20:19:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:45,058 INFO L225 Difference]: With dead ends: 216 [2024-11-07 20:19:45,058 INFO L226 Difference]: Without dead ends: 215 [2024-11-07 20:19:45,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=896, Invalid=2296, Unknown=0, NotChecked=0, Total=3192 [2024-11-07 20:19:45,063 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 227 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:45,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 172 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:19:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-07 20:19:45,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 162. [2024-11-07 20:19:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 137 states have (on average 1.1313868613138687) internal successors, (155), 137 states have internal predecessors, (155), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 20:19:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 179 transitions. [2024-11-07 20:19:45,092 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 179 transitions. Word has length 43 [2024-11-07 20:19:45,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:45,092 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 179 transitions. [2024-11-07 20:19:45,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.1724137931034484) internal successors, (92), 30 states have internal predecessors, (92), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 20:19:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2024-11-07 20:19:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-07 20:19:45,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:45,094 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-07 20:19:45,105 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:19:45,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-07 20:19:45,296 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:19:45,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:45,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2011427467, now seen corresponding path program 1 times [2024-11-07 20:19:45,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:45,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230641675] [2024-11-07 20:19:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:45,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 20:19:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:45,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 20:19:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:45,509 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-07 20:19:45,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:45,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230641675] [2024-11-07 20:19:45,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230641675] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:19:45,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872206976] [2024-11-07 20:19:45,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:45,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:45,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:19:45,512 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:19:45,513 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:19:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:45,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 20:19:45,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:19:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-07 20:19:45,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:19:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-07 20:19:45,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872206976] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:19:45,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:19:45,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 22 [2024-11-07 20:19:45,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967327655] [2024-11-07 20:19:45,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:19:45,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 20:19:45,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:45,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 20:19:45,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-07 20:19:45,796 INFO L87 Difference]: Start difference. First operand 162 states and 179 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:46,138 INFO L93 Difference]: Finished difference Result 242 states and 273 transitions. [2024-11-07 20:19:46,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-07 20:19:46,139 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 51 [2024-11-07 20:19:46,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:46,141 INFO L225 Difference]: With dead ends: 242 [2024-11-07 20:19:46,142 INFO L226 Difference]: Without dead ends: 216 [2024-11-07 20:19:46,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=549, Invalid=1091, Unknown=0, NotChecked=0, Total=1640 [2024-11-07 20:19:46,144 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 114 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:46,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 97 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:19:46,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-07 20:19:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 192. [2024-11-07 20:19:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 167 states have (on average 1.1437125748502994) internal successors, (191), 167 states have internal predecessors, (191), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 20:19:46,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 215 transitions. [2024-11-07 20:19:46,172 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 215 transitions. Word has length 51 [2024-11-07 20:19:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:46,172 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 215 transitions. [2024-11-07 20:19:46,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 215 transitions. [2024-11-07 20:19:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-07 20:19:46,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:46,177 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-07 20:19:46,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-07 20:19:46,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:46,378 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:19:46,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:46,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1375833717, now seen corresponding path program 2 times [2024-11-07 20:19:46,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:46,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136958778] [2024-11-07 20:19:46,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:46,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:46,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 20:19:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:46,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 20:19:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-07 20:19:46,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:46,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136958778] [2024-11-07 20:19:46,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136958778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:19:46,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194955323] [2024-11-07 20:19:46,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 20:19:46,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:46,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:19:46,897 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:19:46,899 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:19:46,965 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 20:19:46,965 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 20:19:46,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 20:19:46,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:19:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-07 20:19:47,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:19:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-07 20:19:47,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194955323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:19:47,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:19:47,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 24] total 46 [2024-11-07 20:19:47,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046233526] [2024-11-07 20:19:47,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:19:47,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-07 20:19:47,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:47,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-07 20:19:47,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2024-11-07 20:19:47,618 INFO L87 Difference]: Start difference. First operand 192 states and 215 transitions. Second operand has 46 states, 46 states have (on average 2.717391304347826) internal successors, (125), 46 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:48,628 INFO L93 Difference]: Finished difference Result 338 states and 387 transitions. [2024-11-07 20:19:48,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-11-07 20:19:48,629 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.717391304347826) internal successors, (125), 46 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-11-07 20:19:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:48,631 INFO L225 Difference]: With dead ends: 338 [2024-11-07 20:19:48,631 INFO L226 Difference]: Without dead ends: 312 [2024-11-07 20:19:48,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1615 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2529, Invalid=5303, Unknown=0, NotChecked=0, Total=7832 [2024-11-07 20:19:48,635 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 360 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:48,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 191 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:19:48,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-07 20:19:48,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 252. [2024-11-07 20:19:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 227 states have (on average 1.158590308370044) internal successors, (263), 227 states have internal predecessors, (263), 12 states have call successors, (12), 12 states have call predecessors, (12), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 20:19:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 287 transitions. [2024-11-07 20:19:48,652 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 287 transitions. Word has length 81 [2024-11-07 20:19:48,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:48,653 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 287 transitions. [2024-11-07 20:19:48,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.717391304347826) internal successors, (125), 46 states have internal predecessors, (125), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:19:48,653 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 287 transitions. [2024-11-07 20:19:48,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 20:19:48,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:48,655 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-07 20:19:48,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-07 20:19:48,855 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,SelfDestructingSolverStorable9 [2024-11-07 20:19:48,855 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:19:48,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:48,856 INFO L85 PathProgramCache]: Analyzing trace with hash -55266820, now seen corresponding path program 1 times [2024-11-07 20:19:48,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:48,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261796900] [2024-11-07 20:19:48,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:48,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 20:19:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:49,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 20:19:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:49,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 20:19:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:49,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 20:19:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:49,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 20:19:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:49,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 20:19:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:49,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 20:19:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:49,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 20:19:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:49,475 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 20:19:49,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:49,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261796900] [2024-11-07 20:19:49,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261796900] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:19:49,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207648344] [2024-11-07 20:19:49,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:49,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:49,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:19:49,478 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:19:49,479 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:19:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:49,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 20:19:49,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:19:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 3 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:19:50,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:19:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 3 proven. 222 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 20:19:50,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207648344] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:19:50,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:19:50,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 65 [2024-11-07 20:19:50,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220265818] [2024-11-07 20:19:50,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:19:50,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-07 20:19:50,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:50,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-07 20:19:50,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=974, Invalid=3316, Unknown=0, NotChecked=0, Total=4290 [2024-11-07 20:19:50,771 INFO L87 Difference]: Start difference. First operand 252 states and 287 transitions. Second operand has 66 states, 65 states have (on average 3.2615384615384615) internal successors, (212), 66 states have internal predecessors, (212), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 20:19:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:52,473 INFO L93 Difference]: Finished difference Result 636 states and 723 transitions. [2024-11-07 20:19:52,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-11-07 20:19:52,473 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.2615384615384615) internal successors, (212), 66 states have internal predecessors, (212), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Word has length 103 [2024-11-07 20:19:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:52,477 INFO L225 Difference]: With dead ends: 636 [2024-11-07 20:19:52,477 INFO L226 Difference]: Without dead ends: 635 [2024-11-07 20:19:52,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3661 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4499, Invalid=11757, Unknown=0, NotChecked=0, Total=16256 [2024-11-07 20:19:52,481 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 576 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:52,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 288 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:19:52,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-11-07 20:19:52,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 417. [2024-11-07 20:19:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 362 states have (on average 1.1408839779005524) internal successors, (413), 362 states have internal predecessors, (413), 27 states have call successors, (27), 27 states have call predecessors, (27), 27 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 20:19:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 467 transitions. [2024-11-07 20:19:52,503 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 467 transitions. Word has length 103 [2024-11-07 20:19:52,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:52,504 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 467 transitions. [2024-11-07 20:19:52,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.2615384615384615) internal successors, (212), 66 states have internal predecessors, (212), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 20:19:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 467 transitions. [2024-11-07 20:19:52,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-07 20:19:52,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:52,510 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2024-11-07 20:19:52,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-07 20:19:52,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:52,711 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:19:52,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:52,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2010681684, now seen corresponding path program 2 times [2024-11-07 20:19:52,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:52,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687596275] [2024-11-07 20:19:52,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:52,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 20:19:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 20:19:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 20:19:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 20:19:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 20:19:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 20:19:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 20:19:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 20:19:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 20:19:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 20:19:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 20:19:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 20:19:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 20:19:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 20:19:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-07 20:19:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-07 20:19:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-07 20:19:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 20:19:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:19:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 1140 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 20:19:54,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:19:54,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687596275] [2024-11-07 20:19:54,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687596275] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:19:54,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329869324] [2024-11-07 20:19:54,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 20:19:54,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:54,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:19:54,501 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:19:54,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 20:19:54,610 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 20:19:54,611 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 20:19:54,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-07 20:19:54,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:19:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 1752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 20:19:54,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:19:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 1140 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 20:19:56,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329869324] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:19:56,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:19:56,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 45] total 89 [2024-11-07 20:19:56,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189297434] [2024-11-07 20:19:56,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:19:56,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2024-11-07 20:19:56,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:19:56,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2024-11-07 20:19:56,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1841, Invalid=6169, Unknown=0, NotChecked=0, Total=8010 [2024-11-07 20:19:56,432 INFO L87 Difference]: Start difference. First operand 417 states and 467 transitions. Second operand has 90 states, 89 states have (on average 3.5168539325842696) internal successors, (313), 90 states have internal predecessors, (313), 36 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 36 states have call predecessors, (54), 36 states have call successors, (54) [2024-11-07 20:19:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:19:58,968 INFO L93 Difference]: Finished difference Result 1217 states and 1357 transitions. [2024-11-07 20:19:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2024-11-07 20:19:58,968 INFO L78 Accepts]: Start accepts. Automaton has has 90 states, 89 states have (on average 3.5168539325842696) internal successors, (313), 90 states have internal predecessors, (313), 36 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 36 states have call predecessors, (54), 36 states have call successors, (54) Word has length 218 [2024-11-07 20:19:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:19:58,975 INFO L225 Difference]: With dead ends: 1217 [2024-11-07 20:19:58,975 INFO L226 Difference]: Without dead ends: 1216 [2024-11-07 20:19:58,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8594 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=9010, Invalid=23932, Unknown=0, NotChecked=0, Total=32942 [2024-11-07 20:19:58,982 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 813 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 20:19:58,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 373 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 20:19:58,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-11-07 20:19:59,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 538. [2024-11-07 20:19:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 461 states have (on average 1.1344902386117137) internal successors, (523), 461 states have internal predecessors, (523), 38 states have call successors, (38), 38 states have call predecessors, (38), 38 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 20:19:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 599 transitions. [2024-11-07 20:19:59,035 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 599 transitions. Word has length 218 [2024-11-07 20:19:59,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:19:59,036 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 599 transitions. [2024-11-07 20:19:59,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 89 states have (on average 3.5168539325842696) internal successors, (313), 90 states have internal predecessors, (313), 36 states have call successors, (54), 19 states have call predecessors, (54), 19 states have return successors, (54), 36 states have call predecessors, (54), 36 states have call successors, (54) [2024-11-07 20:19:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 599 transitions. [2024-11-07 20:19:59,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-07 20:19:59,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:19:59,039 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2024-11-07 20:19:59,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-07 20:19:59,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:19:59,239 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-07 20:19:59,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:19:59,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1406495045, now seen corresponding path program 3 times [2024-11-07 20:19:59,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:19:59,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719709460] [2024-11-07 20:19:59,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:19:59,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:19:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 20:20:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 20:20:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 20:20:00,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 20:20:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 20:20:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 20:20:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 20:20:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 20:20:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 20:20:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 20:20:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 20:20:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 20:20:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 20:20:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 20:20:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 20:20:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-07 20:20:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 20:20:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-07 20:20:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-07 20:20:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:20:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1968 backedges. 0 proven. 1284 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 20:20:00,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:20:00,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719709460] [2024-11-07 20:20:00,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719709460] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:20:00,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139693486] [2024-11-07 20:20:00,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 20:20:00,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:20:00,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:20:00,992 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 20:20:01,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-07 20:20:01,061 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-07 20:20:01,061 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 20:20:01,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 20:20:01,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:20:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1968 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2024-11-07 20:20:01,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:20:01,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139693486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:20:01,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:20:01,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [49] total 52 [2024-11-07 20:20:01,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379217603] [2024-11-07 20:20:01,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:20:01,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:20:01,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:20:01,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:20:01,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=2137, Unknown=0, NotChecked=0, Total=2756 [2024-11-07 20:20:01,175 INFO L87 Difference]: Start difference. First operand 538 states and 599 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:20:01,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:20:01,274 INFO L93 Difference]: Finished difference Result 546 states and 607 transitions. [2024-11-07 20:20:01,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:20:01,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 234 [2024-11-07 20:20:01,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:20:01,276 INFO L225 Difference]: With dead ends: 546 [2024-11-07 20:20:01,276 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 20:20:01,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=629, Invalid=2341, Unknown=0, NotChecked=0, Total=2970 [2024-11-07 20:20:01,279 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:20:01,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 48 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:20:01,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 20:20:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 20:20:01,280 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:20:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 20:20:01,280 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 234 [2024-11-07 20:20:01,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:20:01,280 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 20:20:01,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:20:01,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 20:20:01,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 20:20:01,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-07 20:20:01,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-07 20:20:01,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-07 20:20:01,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-07 20:20:01,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-07 20:20:01,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:20:01,492 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:20:01,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 20:20:08,675 WARN L286 SmtUtils]: Spent 7.18s on a formula simplification. DAG size of input: 395 DAG size of output: 114 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-07 20:20:09,590 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 20:20:09,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:20:09 BoogieIcfgContainer [2024-11-07 20:20:09,605 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 20:20:09,605 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 20:20:09,605 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 20:20:09,606 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 20:20:09,606 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:19:40" (3/4) ... [2024-11-07 20:20:09,608 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 20:20:09,613 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2024-11-07 20:20:09,616 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-07 20:20:09,616 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 20:20:09,617 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-07 20:20:09,617 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 20:20:09,689 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 20:20:09,690 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 20:20:09,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 20:20:09,691 INFO L158 Benchmark]: Toolchain (without parser) took 29383.03ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 92.4MB in the beginning and 207.5MB in the end (delta: -115.0MB). Peak memory consumption was 307.8MB. Max. memory is 16.1GB. [2024-11-07 20:20:09,691 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:20:09,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.21ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 81.5MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 20:20:09,692 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.33ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 80.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:20:09,693 INFO L158 Benchmark]: Boogie Preprocessor took 42.36ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 79.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:20:09,693 INFO L158 Benchmark]: RCFGBuilder took 306.80ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 68.6MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 20:20:09,693 INFO L158 Benchmark]: TraceAbstraction took 28723.84ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 68.0MB in the beginning and 211.6MB in the end (delta: -143.6MB). Peak memory consumption was 306.3MB. Max. memory is 16.1GB. [2024-11-07 20:20:09,693 INFO L158 Benchmark]: Witness Printer took 84.73ms. Allocated memory is still 545.3MB. Free memory was 211.6MB in the beginning and 207.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 20:20:09,695 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.21ms. Allocated memory is still 117.4MB. Free memory was 92.3MB in the beginning and 81.5MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.33ms. Allocated memory is still 117.4MB. Free memory was 81.5MB in the beginning and 80.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.36ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 79.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 306.80ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 68.6MB in the end (delta: 10.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 28723.84ms. Allocated memory was 117.4MB in the beginning and 545.3MB in the end (delta: 427.8MB). Free memory was 68.0MB in the beginning and 211.6MB in the end (delta: -143.6MB). Peak memory consumption was 306.3MB. Max. memory is 16.1GB. * Witness Printer took 84.73ms. Allocated memory is still 545.3MB. Free memory was 211.6MB in the beginning and 207.5MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: 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, 30 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 20.6s, OverallIterations: 13, TraceHistogramMax: 20, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2295 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2295 mSDsluCounter, 1653 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1442 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1645 IncrementalHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 211 mSDtfsCounter, 1645 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1843 GetRequests, 1229 SyntacticMatches, 0 SemanticMatches, 614 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15609 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=538occurred in iteration=12, InterpolantAutomatonStates: 450, 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, 13 MinimizatonAttempts, 1061 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1566 NumberOfCodeBlocks, 1358 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2062 ConstructedInterpolants, 0 QuantifiedInterpolants, 4774 SizeOfPredicates, 107 NumberOfNonLiveVariables, 1298 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 29 InterpolantComputations, 6 PerfectInterpolantSequences, 4241/11397 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: 34]: Loop Invariant Derived loop invariant: (((counter <= 50) && (1 <= counter)) || (counter == 0)) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: ((1 <= counter) && (counter <= 2147483629)) - ProcedureContractResult [Line: 18]: 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:20:09,725 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