./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound50.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! overflow) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '0ac0f213d1d000e527ab073eb0dd4288784176d966909606abb71d9dc425fd71'] 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/fermat1-ll_valuebound50.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ac0f213d1d000e527ab073eb0dd4288784176d966909606abb71d9dc425fd71 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 20:25:42,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 20:25:42,293 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:25:42,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 20:25:42,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 20:25:42,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 20:25:42,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 20:25:42,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 20:25:42,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 20:25:42,328 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 20:25:42,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 20:25:42,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 20:25:42,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 20:25:42,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 20:25:42,329 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 20:25:42,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 20:25:42,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 20:25:42,330 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 20:25:42,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 20:25:42,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 20:25:42,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 20:25:42,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 20:25:42,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 20:25:42,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 20:25:42,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 20:25:42,331 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 20:25:42,331 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 20:25:42,331 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 20:25:42,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 20:25:42,332 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 20:25:42,332 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 20:25:42,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 20:25:42,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 20:25:42,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 20:25:42,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:25:42,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 20:25:42,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 20:25:42,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 20:25:42,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 20:25:42,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 20:25:42,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 20:25:42,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 20:25:42,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 20:25:42,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 20:25:42,334 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 -> 0ac0f213d1d000e527ab073eb0dd4288784176d966909606abb71d9dc425fd71 [2024-11-07 20:25:42,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 20:25:42,619 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 20:25:42,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 20:25:42,623 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 20:25:42,623 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 20:25:42,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound50.c [2024-11-07 20:25:43,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 20:25:44,170 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 20:25:44,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_valuebound50.c [2024-11-07 20:25:44,185 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64310bfb0/1c6d90f3a86c4277963b9c37075f2170/FLAG8181b0815 [2024-11-07 20:25:44,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/64310bfb0/1c6d90f3a86c4277963b9c37075f2170 [2024-11-07 20:25:44,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 20:25:44,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 20:25:44,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 20:25:44,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 20:25:44,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 20:25:44,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:25:44" (1/1) ... [2024-11-07 20:25:44,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee85fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:44, skipping insertion in model container [2024-11-07 20:25:44,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:25:44" (1/1) ... [2024-11-07 20:25:44,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 20:25:44,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:25:44,388 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 20:25:44,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 20:25:44,427 INFO L204 MainTranslator]: Completed translation [2024-11-07 20:25:44,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:44 WrapperNode [2024-11-07 20:25:44,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 20:25:44,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 20:25:44,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 20:25:44,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 20:25:44,437 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:25:44" (1/1) ... [2024-11-07 20:25:44,446 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:25:44" (1/1) ... [2024-11-07 20:25:44,472 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 155 [2024-11-07 20:25:44,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 20:25:44,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 20:25:44,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 20:25:44,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 20:25:44,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:44" (1/1) ... [2024-11-07 20:25:44,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:44" (1/1) ... [2024-11-07 20:25:44,489 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:44" (1/1) ... [2024-11-07 20:25:44,506 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:25:44,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:44" (1/1) ... [2024-11-07 20:25:44,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:44" (1/1) ... [2024-11-07 20:25:44,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:44" (1/1) ... [2024-11-07 20:25:44,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:44" (1/1) ... [2024-11-07 20:25:44,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:44" (1/1) ... [2024-11-07 20:25:44,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:44" (1/1) ... [2024-11-07 20:25:44,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 20:25:44,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 20:25:44,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 20:25:44,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 20:25:44,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:44" (1/1) ... [2024-11-07 20:25:44,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 20:25:44,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:44,551 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:25:44,558 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:25:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 20:25:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 20:25:44,575 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 20:25:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 20:25:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 20:25:44,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 20:25:44,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 20:25:44,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 20:25:44,620 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 20:25:44,621 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 20:25:45,056 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2024-11-07 20:25:45,056 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 20:25:45,070 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 20:25:45,070 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-07 20:25:45,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:25:45 BoogieIcfgContainer [2024-11-07 20:25:45,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 20:25:45,073 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 20:25:45,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 20:25:45,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 20:25:45,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:25:44" (1/3) ... [2024-11-07 20:25:45,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d45a5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:25:45, skipping insertion in model container [2024-11-07 20:25:45,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:25:44" (2/3) ... [2024-11-07 20:25:45,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d45a5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:25:45, skipping insertion in model container [2024-11-07 20:25:45,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:25:45" (3/3) ... [2024-11-07 20:25:45,080 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat1-ll_valuebound50.c [2024-11-07 20:25:45,094 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 20:25:45,094 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2024-11-07 20:25:45,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 20:25:45,156 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;@4f49ecb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 20:25:45,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2024-11-07 20:25:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 215 states, 112 states have (on average 1.9196428571428572) internal successors, (215), 204 states have internal predecessors, (215), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-07 20:25:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 20:25:45,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:45,166 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:45,166 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:45,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:45,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1439424693, now seen corresponding path program 1 times [2024-11-07 20:25:45,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:45,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120104340] [2024-11-07 20:25:45,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:45,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:45,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:45,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:25:45,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:45,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120104340] [2024-11-07 20:25:45,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120104340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:45,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:45,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:25:45,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949010060] [2024-11-07 20:25:45,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:45,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 20:25:45,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:45,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 20:25:45,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 20:25:45,313 INFO L87 Difference]: Start difference. First operand has 215 states, 112 states have (on average 1.9196428571428572) internal successors, (215), 204 states have internal predecessors, (215), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:25:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:45,349 INFO L93 Difference]: Finished difference Result 416 states and 465 transitions. [2024-11-07 20:25:45,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 20:25:45,350 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-11-07 20:25:45,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:45,357 INFO L225 Difference]: With dead ends: 416 [2024-11-07 20:25:45,357 INFO L226 Difference]: Without dead ends: 198 [2024-11-07 20:25:45,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 20:25:45,362 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:45,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:25:45,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-07 20:25:45,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2024-11-07 20:25:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 107 states have (on average 1.7850467289719627) internal successors, (191), 188 states have internal predecessors, (191), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 205 transitions. [2024-11-07 20:25:45,414 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 205 transitions. Word has length 14 [2024-11-07 20:25:45,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:45,416 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 205 transitions. [2024-11-07 20:25:45,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 20:25:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 205 transitions. [2024-11-07 20:25:45,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 20:25:45,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:45,417 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:45,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 20:25:45,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:45,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:45,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1832392121, now seen corresponding path program 1 times [2024-11-07 20:25:45,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:45,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412052661] [2024-11-07 20:25:45,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:45,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:45,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:45,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:25:45,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:45,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412052661] [2024-11-07 20:25:45,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412052661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:45,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:45,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:25:45,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911992318] [2024-11-07 20:25:45,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:45,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:25:45,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:45,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:25:45,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:45,503 INFO L87 Difference]: Start difference. First operand 198 states and 205 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:25:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:45,564 INFO L93 Difference]: Finished difference Result 198 states and 205 transitions. [2024-11-07 20:25:45,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:25:45,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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) Word has length 14 [2024-11-07 20:25:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:45,569 INFO L225 Difference]: With dead ends: 198 [2024-11-07 20:25:45,569 INFO L226 Difference]: Without dead ends: 194 [2024-11-07 20:25:45,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:45,570 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 13 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:45,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 353 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:25:45,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-07 20:25:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-11-07 20:25:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 107 states have (on average 1.7476635514018692) internal successors, (187), 184 states have internal predecessors, (187), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 201 transitions. [2024-11-07 20:25:45,590 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 201 transitions. Word has length 14 [2024-11-07 20:25:45,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:45,591 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 201 transitions. [2024-11-07 20:25:45,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:25:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 201 transitions. [2024-11-07 20:25:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 20:25:45,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:45,593 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:45,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 20:25:45,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:45,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:45,594 INFO L85 PathProgramCache]: Analyzing trace with hash -969580864, now seen corresponding path program 1 times [2024-11-07 20:25:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:45,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559392363] [2024-11-07 20:25:45,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:45,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:45,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:45,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:45,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 20:25:45,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:45,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559392363] [2024-11-07 20:25:45,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559392363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:45,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:45,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:25:45,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323726944] [2024-11-07 20:25:45,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:45,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:25:45,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:45,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:25:45,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:45,665 INFO L87 Difference]: Start difference. First operand 194 states and 201 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:25:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:45,720 INFO L93 Difference]: Finished difference Result 194 states and 201 transitions. [2024-11-07 20:25:45,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:25:45,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 15 [2024-11-07 20:25:45,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:45,722 INFO L225 Difference]: With dead ends: 194 [2024-11-07 20:25:45,722 INFO L226 Difference]: Without dead ends: 190 [2024-11-07 20:25:45,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:45,723 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 12 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:45,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 353 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 20:25:45,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-07 20:25:45,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-07 20:25:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 107 states have (on average 1.7102803738317758) internal successors, (183), 180 states have internal predecessors, (183), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:45,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 197 transitions. [2024-11-07 20:25:45,734 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 197 transitions. Word has length 15 [2024-11-07 20:25:45,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:45,734 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 197 transitions. [2024-11-07 20:25:45,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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:25:45,735 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 197 transitions. [2024-11-07 20:25:45,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-07 20:25:45,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:45,735 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:45,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 20:25:45,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:45,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:45,736 INFO L85 PathProgramCache]: Analyzing trace with hash -621065980, now seen corresponding path program 1 times [2024-11-07 20:25:45,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:45,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10259298] [2024-11-07 20:25:45,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:45,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:25:45,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1049093411] [2024-11-07 20:25:45,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:45,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:45,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:45,783 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:25:45,784 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:25:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:45,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 20:25:45,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 20:25:45,897 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:25:45,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:45,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10259298] [2024-11-07 20:25:45,898 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:25:45,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049093411] [2024-11-07 20:25:45,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049093411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:45,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:45,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:25:45,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725531302] [2024-11-07 20:25:45,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:45,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:25:45,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:45,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:25:45,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:25:45,899 INFO L87 Difference]: Start difference. First operand 190 states and 197 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:25:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:45,991 INFO L93 Difference]: Finished difference Result 190 states and 197 transitions. [2024-11-07 20:25:45,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:25:45,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2024-11-07 20:25:45,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:45,993 INFO L225 Difference]: With dead ends: 190 [2024-11-07 20:25:45,994 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 20:25:45,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:25:45,995 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 8 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:45,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 683 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:25:45,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 20:25:46,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-07 20:25:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 107 states have (on average 1.691588785046729) internal successors, (181), 178 states have internal predecessors, (181), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 195 transitions. [2024-11-07 20:25:46,017 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 195 transitions. Word has length 19 [2024-11-07 20:25:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:46,017 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 195 transitions. [2024-11-07 20:25:46,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 20:25:46,018 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 195 transitions. [2024-11-07 20:25:46,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-07 20:25:46,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:46,018 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:46,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 20:25:46,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:46,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:46,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:46,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1742643569, now seen corresponding path program 1 times [2024-11-07 20:25:46,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:46,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081264070] [2024-11-07 20:25:46,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:46,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:25:46,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257015063] [2024-11-07 20:25:46,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:46,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:46,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:46,258 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:25:46,261 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:25:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:46,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 20:25:46,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 20:25:46,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:25:46,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081264070] [2024-11-07 20:25:46,506 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:25:46,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257015063] [2024-11-07 20:25:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257015063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:25:46,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:25:46,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2024-11-07 20:25:46,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115199454] [2024-11-07 20:25:46,508 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 20:25:46,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:25:46,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:46,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:25:46,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:25:46,509 INFO L87 Difference]: Start difference. First operand 188 states and 195 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 20:25:46,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:46,628 INFO L93 Difference]: Finished difference Result 188 states and 195 transitions. [2024-11-07 20:25:46,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:25:46,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 36 [2024-11-07 20:25:46,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:46,630 INFO L225 Difference]: With dead ends: 188 [2024-11-07 20:25:46,630 INFO L226 Difference]: Without dead ends: 185 [2024-11-07 20:25:46,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:25:46,631 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 144 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:46,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 476 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:25:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-07 20:25:46,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-11-07 20:25:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 107 states have (on average 1.6635514018691588) internal successors, (178), 175 states have internal predecessors, (178), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:46,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 192 transitions. [2024-11-07 20:25:46,639 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 192 transitions. Word has length 36 [2024-11-07 20:25:46,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:46,639 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 192 transitions. [2024-11-07 20:25:46,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 20:25:46,640 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 192 transitions. [2024-11-07 20:25:46,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-07 20:25:46,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:46,644 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:46,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 20:25:46,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:46,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:46,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:46,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1812624144, now seen corresponding path program 1 times [2024-11-07 20:25:46,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:46,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744098638] [2024-11-07 20:25:46,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:46,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,097 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 20:25:47,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:47,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744098638] [2024-11-07 20:25:47,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744098638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:25:47,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012333592] [2024-11-07 20:25:47,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:47,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:47,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:47,100 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:25:47,101 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:25:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 20:25:47,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 20:25:47,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:25:47,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012333592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:47,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 20:25:47,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-07 20:25:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555732057] [2024-11-07 20:25:47,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:47,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 20:25:47,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:47,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 20:25:47,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:25:47,245 INFO L87 Difference]: Start difference. First operand 185 states and 192 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:47,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:47,415 INFO L93 Difference]: Finished difference Result 185 states and 192 transitions. [2024-11-07 20:25:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 20:25:47,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-11-07 20:25:47,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:47,417 INFO L225 Difference]: With dead ends: 185 [2024-11-07 20:25:47,417 INFO L226 Difference]: Without dead ends: 184 [2024-11-07 20:25:47,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 20:25:47,419 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 143 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:47,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 611 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:25:47,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-07 20:25:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-11-07 20:25:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 107 states have (on average 1.6542056074766356) internal successors, (177), 174 states have internal predecessors, (177), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 191 transitions. [2024-11-07 20:25:47,428 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 191 transitions. Word has length 37 [2024-11-07 20:25:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:47,429 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 191 transitions. [2024-11-07 20:25:47,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 191 transitions. [2024-11-07 20:25:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-07 20:25:47,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:47,434 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:47,450 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:25:47,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:47,639 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:47,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:47,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1824922162, now seen corresponding path program 1 times [2024-11-07 20:25:47,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:47,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12018997] [2024-11-07 20:25:47,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:47,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 20:25:47,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:47,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12018997] [2024-11-07 20:25:47,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12018997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:47,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:47,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:25:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076894367] [2024-11-07 20:25:47,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:47,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:25:47,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:47,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:25:47,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:47,741 INFO L87 Difference]: Start difference. First operand 184 states and 191 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:47,809 INFO L93 Difference]: Finished difference Result 190 states and 197 transitions. [2024-11-07 20:25:47,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:25:47,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-11-07 20:25:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:47,811 INFO L225 Difference]: With dead ends: 190 [2024-11-07 20:25:47,811 INFO L226 Difference]: Without dead ends: 187 [2024-11-07 20:25:47,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:47,812 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 99 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:47,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 221 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:25:47,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-07 20:25:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-07 20:25:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 111 states have (on average 1.6216216216216217) internal successors, (180), 177 states have internal predecessors, (180), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 194 transitions. [2024-11-07 20:25:47,826 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 194 transitions. Word has length 39 [2024-11-07 20:25:47,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:47,828 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 194 transitions. [2024-11-07 20:25:47,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 194 transitions. [2024-11-07 20:25:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-07 20:25:47,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:47,830 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:47,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 20:25:47,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:47,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:47,832 INFO L85 PathProgramCache]: Analyzing trace with hash 738012252, now seen corresponding path program 1 times [2024-11-07 20:25:47,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:47,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437707287] [2024-11-07 20:25:47,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:47,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:47,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 20:25:47,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:47,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437707287] [2024-11-07 20:25:47,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437707287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:47,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:47,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:25:47,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285422081] [2024-11-07 20:25:47,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:47,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:25:47,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:47,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:25:47,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:25:47,892 INFO L87 Difference]: Start difference. First operand 187 states and 194 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:48,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:48,012 INFO L93 Difference]: Finished difference Result 191 states and 198 transitions. [2024-11-07 20:25:48,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:25:48,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-11-07 20:25:48,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:48,014 INFO L225 Difference]: With dead ends: 191 [2024-11-07 20:25:48,014 INFO L226 Difference]: Without dead ends: 188 [2024-11-07 20:25:48,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:25:48,015 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 109 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:48,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 335 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:25:48,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-07 20:25:48,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-07 20:25:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 113 states have (on average 1.6017699115044248) internal successors, (181), 178 states have internal predecessors, (181), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 20:25:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 195 transitions. [2024-11-07 20:25:48,025 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 195 transitions. Word has length 40 [2024-11-07 20:25:48,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:48,025 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 195 transitions. [2024-11-07 20:25:48,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:48,026 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 195 transitions. [2024-11-07 20:25:48,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-07 20:25:48,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:48,028 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:48,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 20:25:48,029 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:48,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:48,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1403543412, now seen corresponding path program 1 times [2024-11-07 20:25:48,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:48,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24999888] [2024-11-07 20:25:48,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:48,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:25:48,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [413733267] [2024-11-07 20:25:48,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:48,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:48,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:48,053 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:25:48,055 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:25:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:48,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 20:25:48,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 20:25:48,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:25:48,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24999888] [2024-11-07 20:25:48,132 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:25:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413733267] [2024-11-07 20:25:48,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413733267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:48,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:48,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:25:48,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606473259] [2024-11-07 20:25:48,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:48,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:25:48,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:48,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:25:48,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:48,133 INFO L87 Difference]: Start difference. First operand 188 states and 195 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:48,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:48,253 INFO L93 Difference]: Finished difference Result 294 states and 314 transitions. [2024-11-07 20:25:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:25:48,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-11-07 20:25:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:48,255 INFO L225 Difference]: With dead ends: 294 [2024-11-07 20:25:48,255 INFO L226 Difference]: Without dead ends: 291 [2024-11-07 20:25:48,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:48,256 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 97 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:48,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 308 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 20:25:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-07 20:25:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 251. [2024-11-07 20:25:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 173 states have (on average 1.6358381502890174) internal successors, (283), 238 states have internal predecessors, (283), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-07 20:25:48,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 303 transitions. [2024-11-07 20:25:48,288 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 303 transitions. Word has length 41 [2024-11-07 20:25:48,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:48,288 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 303 transitions. [2024-11-07 20:25:48,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:48,289 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 303 transitions. [2024-11-07 20:25:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-07 20:25:48,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:48,290 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:48,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 20:25:48,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-07 20:25:48,495 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:48,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:48,495 INFO L85 PathProgramCache]: Analyzing trace with hash 560172894, now seen corresponding path program 1 times [2024-11-07 20:25:48,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:48,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407915332] [2024-11-07 20:25:48,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:48,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:48,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:48,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:48,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:48,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 20:25:48,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:48,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407915332] [2024-11-07 20:25:48,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407915332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:25:48,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45400233] [2024-11-07 20:25:48,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:48,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:48,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:48,796 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:25:48,797 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:25:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:48,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 20:25:48,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 20:25:49,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:25:49,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45400233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:25:49,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 20:25:49,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-07 20:25:49,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306278379] [2024-11-07 20:25:49,328 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 20:25:49,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 20:25:49,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:49,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 20:25:49,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-07 20:25:49,329 INFO L87 Difference]: Start difference. First operand 251 states and 303 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 7 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-07 20:25:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:50,085 INFO L93 Difference]: Finished difference Result 392 states and 423 transitions. [2024-11-07 20:25:50,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 20:25:50,087 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 7 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 42 [2024-11-07 20:25:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:50,089 INFO L225 Difference]: With dead ends: 392 [2024-11-07 20:25:50,089 INFO L226 Difference]: Without dead ends: 389 [2024-11-07 20:25:50,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-11-07 20:25:50,090 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 587 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:50,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 1232 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 20:25:50,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-07 20:25:50,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 295. [2024-11-07 20:25:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 215 states have (on average 1.6325581395348838) internal successors, (351), 280 states have internal predecessors, (351), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 20:25:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 375 transitions. [2024-11-07 20:25:50,109 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 375 transitions. Word has length 42 [2024-11-07 20:25:50,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:50,109 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 375 transitions. [2024-11-07 20:25:50,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 states have internal predecessors, (49), 7 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-07 20:25:50,110 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 375 transitions. [2024-11-07 20:25:50,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 20:25:50,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:50,110 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:50,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 20:25:50,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-07 20:25:50,311 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:50,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:50,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1455241824, now seen corresponding path program 1 times [2024-11-07 20:25:50,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:50,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791878405] [2024-11-07 20:25:50,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:50,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:25:50,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688289591] [2024-11-07 20:25:50,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:50,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:50,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:50,326 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:25:50,327 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:25:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:50,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 20:25:50,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 20:25:50,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:25:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 20:25:50,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:50,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791878405] [2024-11-07 20:25:50,677 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:25:50,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688289591] [2024-11-07 20:25:50,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688289591] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:25:50,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 20:25:50,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 20:25:50,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66310500] [2024-11-07 20:25:50,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 20:25:50,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 20:25:50,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:50,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 20:25:50,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 20:25:50,679 INFO L87 Difference]: Start difference. First operand 295 states and 375 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 20:25:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:51,766 INFO L93 Difference]: Finished difference Result 429 states and 547 transitions. [2024-11-07 20:25:51,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 20:25:51,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2024-11-07 20:25:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:51,768 INFO L225 Difference]: With dead ends: 429 [2024-11-07 20:25:51,769 INFO L226 Difference]: Without dead ends: 402 [2024-11-07 20:25:51,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-07 20:25:51,769 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 311 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:51,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 517 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 20:25:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-07 20:25:51,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 376. [2024-11-07 20:25:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 310 states have (on average 1.4387096774193548) internal successors, (446), 358 states have internal predecessors, (446), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 20:25:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 476 transitions. [2024-11-07 20:25:51,792 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 476 transitions. Word has length 44 [2024-11-07 20:25:51,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:51,792 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 476 transitions. [2024-11-07 20:25:51,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 20:25:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 476 transitions. [2024-11-07 20:25:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-07 20:25:51,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:51,793 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:51,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 20:25:51,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 20:25:51,994 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:51,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:51,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1671942814, now seen corresponding path program 1 times [2024-11-07 20:25:51,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:51,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958658894] [2024-11-07 20:25:51,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:51,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 20:25:52,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [793464687] [2024-11-07 20:25:52,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:52,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:52,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:52,009 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:25:52,012 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:25:52,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:52,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 20:25:52,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-07 20:25:52,075 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 20:25:52,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:52,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958658894] [2024-11-07 20:25:52,076 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 20:25:52,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793464687] [2024-11-07 20:25:52,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793464687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:52,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:52,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 20:25:52,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514943035] [2024-11-07 20:25:52,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:52,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 20:25:52,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:52,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 20:25:52,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:52,078 INFO L87 Difference]: Start difference. First operand 376 states and 476 transitions. Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:52,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:52,266 INFO L93 Difference]: Finished difference Result 577 states and 730 transitions. [2024-11-07 20:25:52,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 20:25:52,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2024-11-07 20:25:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:52,270 INFO L225 Difference]: With dead ends: 577 [2024-11-07 20:25:52,270 INFO L226 Difference]: Without dead ends: 536 [2024-11-07 20:25:52,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 20:25:52,271 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 88 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:52,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 210 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:25:52,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-07 20:25:52,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 524. [2024-11-07 20:25:52,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 453 states have (on average 1.346578366445916) internal successors, (610), 501 states have internal predecessors, (610), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 20:25:52,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 650 transitions. [2024-11-07 20:25:52,298 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 650 transitions. Word has length 46 [2024-11-07 20:25:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:52,298 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 650 transitions. [2024-11-07 20:25:52,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 20:25:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 650 transitions. [2024-11-07 20:25:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-07 20:25:52,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:52,301 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:52,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-07 20:25:52,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:52,505 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:52,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash -510342249, now seen corresponding path program 1 times [2024-11-07 20:25:52,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:52,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188502038] [2024-11-07 20:25:52,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:52,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:52,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:52,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:52,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:52,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:52,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 20:25:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:52,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 20:25:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 20:25:52,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:52,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188502038] [2024-11-07 20:25:52,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188502038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:52,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:52,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 20:25:52,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408951966] [2024-11-07 20:25:52,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:52,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 20:25:52,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:52,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 20:25:52,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:25:52,639 INFO L87 Difference]: Start difference. First operand 524 states and 650 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 20:25:52,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:52,858 INFO L93 Difference]: Finished difference Result 537 states and 651 transitions. [2024-11-07 20:25:52,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 20:25:52,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 88 [2024-11-07 20:25:52,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:52,861 INFO L225 Difference]: With dead ends: 537 [2024-11-07 20:25:52,861 INFO L226 Difference]: Without dead ends: 536 [2024-11-07 20:25:52,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 20:25:52,863 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 57 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:52,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 238 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 20:25:52,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-11-07 20:25:52,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 524. [2024-11-07 20:25:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 453 states have (on average 1.3421633554083885) internal successors, (608), 501 states have internal predecessors, (608), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 20:25:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 648 transitions. [2024-11-07 20:25:52,888 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 648 transitions. Word has length 88 [2024-11-07 20:25:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:52,888 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 648 transitions. [2024-11-07 20:25:52,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 20:25:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 648 transitions. [2024-11-07 20:25:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-07 20:25:52,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:52,892 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:52,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 20:25:52,892 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:52,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:52,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1359259636, now seen corresponding path program 1 times [2024-11-07 20:25:52,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:52,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794847712] [2024-11-07 20:25:52,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:52,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:53,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:53,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:53,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:53,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:53,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 20:25:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:53,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 20:25:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:53,043 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 20:25:53,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:53,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794847712] [2024-11-07 20:25:53,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794847712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 20:25:53,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 20:25:53,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 20:25:53,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035182463] [2024-11-07 20:25:53,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 20:25:53,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 20:25:53,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:53,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 20:25:53,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 20:25:53,045 INFO L87 Difference]: Start difference. First operand 524 states and 648 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 20:25:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:53,415 INFO L93 Difference]: Finished difference Result 534 states and 654 transitions. [2024-11-07 20:25:53,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 20:25:53,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 89 [2024-11-07 20:25:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:53,418 INFO L225 Difference]: With dead ends: 534 [2024-11-07 20:25:53,418 INFO L226 Difference]: Without dead ends: 533 [2024-11-07 20:25:53,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 20:25:53,419 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 252 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:53,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 229 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 20:25:53,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-07 20:25:53,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 524. [2024-11-07 20:25:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 453 states have (on average 1.3377483443708609) internal successors, (606), 501 states have internal predecessors, (606), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 20:25:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 646 transitions. [2024-11-07 20:25:53,439 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 646 transitions. Word has length 89 [2024-11-07 20:25:53,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:53,440 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 646 transitions. [2024-11-07 20:25:53,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 20:25:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 646 transitions. [2024-11-07 20:25:53,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-07 20:25:53,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:53,441 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:53,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 20:25:53,441 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:53,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:53,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1847120568, now seen corresponding path program 1 times [2024-11-07 20:25:53,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:53,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626828851] [2024-11-07 20:25:53,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:53,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:53,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:53,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:53,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:53,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 20:25:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:53,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 20:25:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 20:25:53,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:53,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626828851] [2024-11-07 20:25:53,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626828851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:25:53,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139591731] [2024-11-07 20:25:53,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:53,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:53,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:53,621 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:25:53,623 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:25:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:53,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 20:25:53,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:25:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 20:25:53,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:25:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 20:25:54,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139591731] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:25:54,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:25:54,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2024-11-07 20:25:54,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481022700] [2024-11-07 20:25:54,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:25:54,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 20:25:54,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:25:54,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 20:25:54,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-07 20:25:54,064 INFO L87 Difference]: Start difference. First operand 524 states and 646 transitions. Second operand has 14 states, 13 states have (on average 14.0) internal successors, (182), 14 states have internal predecessors, (182), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-07 20:25:54,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 20:25:54,988 INFO L93 Difference]: Finished difference Result 1138 states and 1404 transitions. [2024-11-07 20:25:54,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 20:25:54,988 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 14.0) internal successors, (182), 14 states have internal predecessors, (182), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 93 [2024-11-07 20:25:54,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 20:25:54,991 INFO L225 Difference]: With dead ends: 1138 [2024-11-07 20:25:54,991 INFO L226 Difference]: Without dead ends: 639 [2024-11-07 20:25:54,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2024-11-07 20:25:54,993 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1000 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 20:25:54,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 406 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 20:25:54,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-11-07 20:25:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 601. [2024-11-07 20:25:55,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 528 states have (on average 1.3181818181818181) internal successors, (696), 574 states have internal predecessors, (696), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 20:25:55,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 744 transitions. [2024-11-07 20:25:55,020 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 744 transitions. Word has length 93 [2024-11-07 20:25:55,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 20:25:55,020 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 744 transitions. [2024-11-07 20:25:55,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 14.0) internal successors, (182), 14 states have internal predecessors, (182), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-07 20:25:55,021 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 744 transitions. [2024-11-07 20:25:55,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-07 20:25:55,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 20:25:55,021 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 20:25:55,037 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:25:55,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 20:25:55,222 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 89 more)] === [2024-11-07 20:25:55,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 20:25:55,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1426162889, now seen corresponding path program 1 times [2024-11-07 20:25:55,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 20:25:55,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643358977] [2024-11-07 20:25:55,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:55,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 20:25:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:55,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 20:25:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:55,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-07 20:25:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:55,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 20:25:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:55,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-07 20:25:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:55,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 20:25:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:55,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 20:25:55,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 20:25:55,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 20:25:55,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643358977] [2024-11-07 20:25:55,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643358977] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 20:25:55,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470218840] [2024-11-07 20:25:55,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 20:25:55,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 20:25:55,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 20:25:55,338 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:25:55,339 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:25:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 20:25:55,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 20:25:55,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 20:26:10,631 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~R~0#1_46| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~R~0#1_46| |v_ULTIMATE.start_main_~R~0#1_46|))) (and (<= (+ |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~A~0#1| 1) .cse0) (<= .cse0 9223372036854775807)))) is different from true [2024-11-07 20:26:10,653 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 3 not checked. [2024-11-07 20:26:10,653 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 20:26:10,807 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-07 20:26:10,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470218840] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 20:26:10,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 20:26:10,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-07 20:26:10,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372591567] [2024-11-07 20:26:10,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 20:26:10,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 20:26:10,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 20:26:10,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 20:26:10,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=106, Unknown=6, NotChecked=22, Total=182 [2024-11-07 20:26:10,811 INFO L87 Difference]: Start difference. First operand 601 states and 744 transitions. Second operand has 14 states, 13 states have (on average 13.384615384615385) internal successors, (174), 14 states have internal predecessors, (174), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-07 20:26:12,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:14,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:19,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:24,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:28,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:29,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:31,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:33,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:34,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:38,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:50,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:51,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:52,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:26:56,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:00,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:01,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:03,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:04,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:05,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:06,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:10,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:11,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:15,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:17,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:18,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:21,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:22,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-11-07 20:27:26,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]