./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_5.c.cil.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/bitvector/soft_float_5.c.cil.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', 'dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_5.c.cil.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 dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:49:08,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:49:08,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-07 19:49:08,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:49:08,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:49:08,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:49:08,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:49:08,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:49:08,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:49:08,689 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:49:08,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:49:08,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:49:08,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:49:08,689 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:49:08,689 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:49:08,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:49:08,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 19:49:08,689 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:49:08,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:49:08,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:49:08,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:49:08,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 19:49:08,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:49:08,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:49:08,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:49:08,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:49:08,694 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:49:08,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:49:08,694 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 -> dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 [2024-11-07 19:49:09,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:49:09,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:49:09,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:49:09,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:49:09,116 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:49:09,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2024-11-07 19:49:10,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:49:10,464 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:49:10,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2024-11-07 19:49:10,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8574ab197/06d42a1b94cb47cb9d1d2180b2f97166/FLAGdbf558547 [2024-11-07 19:49:10,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8574ab197/06d42a1b94cb47cb9d1d2180b2f97166 [2024-11-07 19:49:10,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:49:10,839 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:49:10,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:49:10,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:49:10,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:49:10,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:49:10" (1/1) ... [2024-11-07 19:49:10,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed24098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:10, skipping insertion in model container [2024-11-07 19:49:10,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:49:10" (1/1) ... [2024-11-07 19:49:10,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:49:11,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:49:11,045 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:49:11,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:49:11,084 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:49:11,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11 WrapperNode [2024-11-07 19:49:11,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:49:11,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:49:11,086 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:49:11,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:49:11,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,097 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,122 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2024-11-07 19:49:11,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:49:11,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:49:11,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:49:11,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:49:11,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,147 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 19:49:11,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,153 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:49:11,156 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:49:11,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:49:11,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:49:11,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:49:11,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:11,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 19:49:11,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 19:49:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:49:11,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:49:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-07 19:49:11,207 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-07 19:49:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:49:11,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:49:11,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 19:49:11,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 19:49:11,259 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:49:11,260 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:49:11,592 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-07 19:49:11,593 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:49:11,604 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:49:11,605 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 19:49:11,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:49:11 BoogieIcfgContainer [2024-11-07 19:49:11,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:49:11,607 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:49:11,607 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:49:11,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:49:11,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:49:10" (1/3) ... [2024-11-07 19:49:11,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4f00a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:49:11, skipping insertion in model container [2024-11-07 19:49:11,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (2/3) ... [2024-11-07 19:49:11,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4f00a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:49:11, skipping insertion in model container [2024-11-07 19:49:11,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:49:11" (3/3) ... [2024-11-07 19:49:11,612 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5.c.cil.c [2024-11-07 19:49:11,622 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:49:11,622 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-07 19:49:11,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:49:11,679 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;@2460dc03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:49:11,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2024-11-07 19:49:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 116 states have internal predecessors, (150), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-07 19:49:11,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 19:49:11,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:11,688 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:11,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:11,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1302203311, now seen corresponding path program 1 times [2024-11-07 19:49:11,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:11,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522380261] [2024-11-07 19:49:11,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:11,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:11,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:11,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522380261] [2024-11-07 19:49:11,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522380261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:11,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:11,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:49:11,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835188532] [2024-11-07 19:49:11,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:11,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:49:11,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:11,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:49:11,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:49:11,852 INFO L87 Difference]: Start difference. First operand has 123 states, 91 states have (on average 1.6483516483516483) internal successors, (150), 116 states have internal predecessors, (150), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:11,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:11,952 INFO L93 Difference]: Finished difference Result 297 states and 411 transitions. [2024-11-07 19:49:11,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:49:11,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-07 19:49:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:11,961 INFO L225 Difference]: With dead ends: 297 [2024-11-07 19:49:11,961 INFO L226 Difference]: Without dead ends: 157 [2024-11-07 19:49:11,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:11,967 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 90 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:11,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 393 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:49:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-07 19:49:11,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2024-11-07 19:49:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.495798319327731) internal successors, (178), 138 states have internal predecessors, (178), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 186 transitions. [2024-11-07 19:49:12,000 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 186 transitions. Word has length 9 [2024-11-07 19:49:12,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:12,000 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 186 transitions. [2024-11-07 19:49:12,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:12,001 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 186 transitions. [2024-11-07 19:49:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 19:49:12,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:12,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:12,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:49:12,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:12,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:12,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2018629041, now seen corresponding path program 1 times [2024-11-07 19:49:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:12,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613552045] [2024-11-07 19:49:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:12,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:12,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:12,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613552045] [2024-11-07 19:49:12,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613552045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:12,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:12,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:49:12,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191027910] [2024-11-07 19:49:12,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:12,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:49:12,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:12,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:49:12,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:12,060 INFO L87 Difference]: Start difference. First operand 145 states and 186 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:12,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:12,097 INFO L93 Difference]: Finished difference Result 301 states and 393 transitions. [2024-11-07 19:49:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:49:12,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-07 19:49:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:12,098 INFO L225 Difference]: With dead ends: 301 [2024-11-07 19:49:12,098 INFO L226 Difference]: Without dead ends: 159 [2024-11-07 19:49:12,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:12,099 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:12,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 213 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:12,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-07 19:49:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 149. [2024-11-07 19:49:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 123 states have (on average 1.4796747967479675) internal successors, (182), 142 states have internal predecessors, (182), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 190 transitions. [2024-11-07 19:49:12,110 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 190 transitions. Word has length 14 [2024-11-07 19:49:12,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:12,110 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 190 transitions. [2024-11-07 19:49:12,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 190 transitions. [2024-11-07 19:49:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 19:49:12,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:12,111 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:12,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:49:12,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:12,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:12,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2018517695, now seen corresponding path program 1 times [2024-11-07 19:49:12,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:12,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229656751] [2024-11-07 19:49:12,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:12,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:12,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 19:49:12,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:12,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229656751] [2024-11-07 19:49:12,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229656751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:12,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:12,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:49:12,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914319878] [2024-11-07 19:49:12,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:12,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:49:12,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:12,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:49:12,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:12,139 INFO L87 Difference]: Start difference. First operand 149 states and 190 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:12,170 INFO L93 Difference]: Finished difference Result 149 states and 190 transitions. [2024-11-07 19:49:12,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:49:12,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-07 19:49:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:12,171 INFO L225 Difference]: With dead ends: 149 [2024-11-07 19:49:12,171 INFO L226 Difference]: Without dead ends: 148 [2024-11-07 19:49:12,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:12,172 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:12,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 204 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-07 19:49:12,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-07 19:49:12,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 123 states have (on average 1.4634146341463414) internal successors, (180), 141 states have internal predecessors, (180), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:12,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 188 transitions. [2024-11-07 19:49:12,179 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 188 transitions. Word has length 14 [2024-11-07 19:49:12,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:12,179 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 188 transitions. [2024-11-07 19:49:12,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:12,179 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions. [2024-11-07 19:49:12,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 19:49:12,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:12,180 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:12,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:49:12,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:12,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:12,180 INFO L85 PathProgramCache]: Analyzing trace with hash 829234525, now seen corresponding path program 1 times [2024-11-07 19:49:12,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:12,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878726015] [2024-11-07 19:49:12,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:12,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:12,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:12,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878726015] [2024-11-07 19:49:12,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878726015] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:49:12,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478212706] [2024-11-07 19:49:12,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:12,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:12,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:12,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:49:12,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 19:49:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:12,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:49:12,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:12,311 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:12,311 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:12,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478212706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:12,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 19:49:12,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-07 19:49:12,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602296930] [2024-11-07 19:49:12,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:12,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:49:12,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:12,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:49:12,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:49:12,312 INFO L87 Difference]: Start difference. First operand 148 states and 188 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:12,370 INFO L93 Difference]: Finished difference Result 174 states and 228 transitions. [2024-11-07 19:49:12,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:49:12,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-07 19:49:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:12,371 INFO L225 Difference]: With dead ends: 174 [2024-11-07 19:49:12,371 INFO L226 Difference]: Without dead ends: 172 [2024-11-07 19:49:12,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:49:12,372 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 32 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:12,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 208 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-07 19:49:12,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2024-11-07 19:49:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 130 states have (on average 1.4384615384615385) internal successors, (187), 148 states have internal predecessors, (187), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:12,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 195 transitions. [2024-11-07 19:49:12,389 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 195 transitions. Word has length 15 [2024-11-07 19:49:12,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:12,389 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 195 transitions. [2024-11-07 19:49:12,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:12,389 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 195 transitions. [2024-11-07 19:49:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 19:49:12,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:12,390 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:12,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 19:49:12,590 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 19:49:12,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:12,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:12,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1850460838, now seen corresponding path program 1 times [2024-11-07 19:49:12,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:12,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776188933] [2024-11-07 19:49:12,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:12,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:12,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776188933] [2024-11-07 19:49:12,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776188933] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:49:12,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477126283] [2024-11-07 19:49:12,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:12,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:12,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:12,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:49:12,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 19:49:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:12,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:49:12,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:12,732 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:12,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477126283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:12,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 19:49:12,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-07 19:49:12,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626163878] [2024-11-07 19:49:12,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:12,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:49:12,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:12,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:49:12,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:49:12,734 INFO L87 Difference]: Start difference. First operand 155 states and 195 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:12,773 INFO L93 Difference]: Finished difference Result 161 states and 203 transitions. [2024-11-07 19:49:12,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:49:12,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-07 19:49:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:12,774 INFO L225 Difference]: With dead ends: 161 [2024-11-07 19:49:12,774 INFO L226 Difference]: Without dead ends: 160 [2024-11-07 19:49:12,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:49:12,775 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:12,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 195 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:12,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-07 19:49:12,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2024-11-07 19:49:12,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 132 states have (on average 1.4318181818181819) internal successors, (189), 150 states have internal predecessors, (189), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 197 transitions. [2024-11-07 19:49:12,792 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 197 transitions. Word has length 15 [2024-11-07 19:49:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:12,792 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 197 transitions. [2024-11-07 19:49:12,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 197 transitions. [2024-11-07 19:49:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 19:49:12,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:12,793 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:12,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 19:49:12,993 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 19:49:12,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:12,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:12,995 INFO L85 PathProgramCache]: Analyzing trace with hash -63533408, now seen corresponding path program 1 times [2024-11-07 19:49:12,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:12,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795733062] [2024-11-07 19:49:12,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:12,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 19:49:13,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:13,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795733062] [2024-11-07 19:49:13,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795733062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:13,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:13,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:49:13,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235600778] [2024-11-07 19:49:13,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:13,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:49:13,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:13,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:49:13,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:13,021 INFO L87 Difference]: Start difference. First operand 157 states and 197 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:13,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:13,050 INFO L93 Difference]: Finished difference Result 157 states and 197 transitions. [2024-11-07 19:49:13,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:49:13,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-07 19:49:13,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:13,051 INFO L225 Difference]: With dead ends: 157 [2024-11-07 19:49:13,051 INFO L226 Difference]: Without dead ends: 156 [2024-11-07 19:49:13,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:13,052 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:13,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 198 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:13,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-07 19:49:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2024-11-07 19:49:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 130 states have (on average 1.4230769230769231) internal successors, (185), 147 states have internal predecessors, (185), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 193 transitions. [2024-11-07 19:49:13,059 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 193 transitions. Word has length 16 [2024-11-07 19:49:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:13,059 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 193 transitions. [2024-11-07 19:49:13,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 193 transitions. [2024-11-07 19:49:13,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 19:49:13,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:13,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:13,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:49:13,060 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:13,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:13,060 INFO L85 PathProgramCache]: Analyzing trace with hash -801496273, now seen corresponding path program 1 times [2024-11-07 19:49:13,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:13,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840949632] [2024-11-07 19:49:13,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:13,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:13,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:13,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840949632] [2024-11-07 19:49:13,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840949632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:13,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:13,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:49:13,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044423892] [2024-11-07 19:49:13,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:13,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:49:13,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:13,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:49:13,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:13,081 INFO L87 Difference]: Start difference. First operand 154 states and 193 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:13,111 INFO L93 Difference]: Finished difference Result 315 states and 400 transitions. [2024-11-07 19:49:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:49:13,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-07 19:49:13,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:13,113 INFO L225 Difference]: With dead ends: 315 [2024-11-07 19:49:13,113 INFO L226 Difference]: Without dead ends: 164 [2024-11-07 19:49:13,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:13,114 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 8 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:13,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 211 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:13,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-07 19:49:13,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2024-11-07 19:49:13,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 132 states have (on average 1.4015151515151516) internal successors, (185), 149 states have internal predecessors, (185), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2024-11-07 19:49:13,120 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 16 [2024-11-07 19:49:13,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:13,121 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2024-11-07 19:49:13,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:13,121 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2024-11-07 19:49:13,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 19:49:13,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:13,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:13,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:49:13,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:13,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:13,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1421009672, now seen corresponding path program 1 times [2024-11-07 19:49:13,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:13,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951000255] [2024-11-07 19:49:13,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:13,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:13,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:13,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951000255] [2024-11-07 19:49:13,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951000255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:13,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:13,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:13,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286627939] [2024-11-07 19:49:13,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:13,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:49:13,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:13,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:49:13,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:13,178 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:13,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:13,262 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2024-11-07 19:49:13,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:49:13,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-07 19:49:13,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:13,263 INFO L225 Difference]: With dead ends: 176 [2024-11-07 19:49:13,263 INFO L226 Difference]: Without dead ends: 174 [2024-11-07 19:49:13,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:49:13,264 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 105 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:13,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 378 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:49:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-07 19:49:13,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2024-11-07 19:49:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 139 states have (on average 1.39568345323741) internal successors, (194), 156 states have internal predecessors, (194), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 202 transitions. [2024-11-07 19:49:13,270 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 202 transitions. Word has length 16 [2024-11-07 19:49:13,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:13,270 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 202 transitions. [2024-11-07 19:49:13,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 202 transitions. [2024-11-07 19:49:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 19:49:13,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:13,271 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:13,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:49:13,271 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:13,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:13,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1967372727, now seen corresponding path program 1 times [2024-11-07 19:49:13,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:13,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446607787] [2024-11-07 19:49:13,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:13,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:13,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:13,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:13,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446607787] [2024-11-07 19:49:13,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446607787] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:49:13,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905995408] [2024-11-07 19:49:13,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:13,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:13,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:13,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:49:13,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 19:49:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:13,368 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:49:13,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:13,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:13,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:13,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905995408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:13,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 19:49:13,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-07 19:49:13,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630162590] [2024-11-07 19:49:13,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:13,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:49:13,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:13,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:49:13,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:49:13,391 INFO L87 Difference]: Start difference. First operand 163 states and 202 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:13,444 INFO L93 Difference]: Finished difference Result 171 states and 213 transitions. [2024-11-07 19:49:13,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:49:13,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-07 19:49:13,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:13,446 INFO L225 Difference]: With dead ends: 171 [2024-11-07 19:49:13,446 INFO L226 Difference]: Without dead ends: 170 [2024-11-07 19:49:13,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:49:13,446 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 9 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:13,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 300 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-07 19:49:13,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2024-11-07 19:49:13,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 143 states have (on average 1.3776223776223777) internal successors, (197), 160 states have internal predecessors, (197), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:13,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 205 transitions. [2024-11-07 19:49:13,455 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 205 transitions. Word has length 17 [2024-11-07 19:49:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:13,456 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 205 transitions. [2024-11-07 19:49:13,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 205 transitions. [2024-11-07 19:49:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 19:49:13,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:13,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:13,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 19:49:13,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:13,663 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:13,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:13,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1720101466, now seen corresponding path program 1 times [2024-11-07 19:49:13,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:13,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968786156] [2024-11-07 19:49:13,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:13,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:13,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:13,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968786156] [2024-11-07 19:49:13,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968786156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:13,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:13,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:13,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483545829] [2024-11-07 19:49:13,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:13,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:49:13,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:13,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:49:13,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:49:13,708 INFO L87 Difference]: Start difference. First operand 167 states and 205 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:13,742 INFO L93 Difference]: Finished difference Result 336 states and 412 transitions. [2024-11-07 19:49:13,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:49:13,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-07 19:49:13,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:13,743 INFO L225 Difference]: With dead ends: 336 [2024-11-07 19:49:13,743 INFO L226 Difference]: Without dead ends: 172 [2024-11-07 19:49:13,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:13,744 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:13,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 317 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:13,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-07 19:49:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-11-07 19:49:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 147 states have (on average 1.3673469387755102) internal successors, (201), 164 states have internal predecessors, (201), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2024-11-07 19:49:13,750 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 17 [2024-11-07 19:49:13,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:13,750 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2024-11-07 19:49:13,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2024-11-07 19:49:13,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 19:49:13,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:13,750 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:13,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:49:13,750 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:13,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:13,751 INFO L85 PathProgramCache]: Analyzing trace with hash -448658972, now seen corresponding path program 1 times [2024-11-07 19:49:13,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:13,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613045367] [2024-11-07 19:49:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:13,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:13,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:13,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:49:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:13,791 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 19:49:13,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:13,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613045367] [2024-11-07 19:49:13,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613045367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:13,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:13,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:13,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230115616] [2024-11-07 19:49:13,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:13,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:49:13,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:13,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:49:13,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:13,793 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 19:49:13,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:13,871 INFO L93 Difference]: Finished difference Result 235 states and 286 transitions. [2024-11-07 19:49:13,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:49:13,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-07 19:49:13,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:13,877 INFO L225 Difference]: With dead ends: 235 [2024-11-07 19:49:13,877 INFO L226 Difference]: Without dead ends: 231 [2024-11-07 19:49:13,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:49:13,878 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 139 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:13,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 302 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:49:13,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-07 19:49:13,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 219. [2024-11-07 19:49:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 194 states have (on average 1.3453608247422681) internal successors, (261), 210 states have internal predecessors, (261), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 269 transitions. [2024-11-07 19:49:13,886 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 269 transitions. Word has length 24 [2024-11-07 19:49:13,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:13,886 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 269 transitions. [2024-11-07 19:49:13,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 19:49:13,886 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 269 transitions. [2024-11-07 19:49:13,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 19:49:13,887 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:13,887 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:13,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 19:49:13,887 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:13,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:13,887 INFO L85 PathProgramCache]: Analyzing trace with hash -477286328, now seen corresponding path program 1 times [2024-11-07 19:49:13,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:13,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181056702] [2024-11-07 19:49:13,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:13,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:13,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:13,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:49:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-07 19:49:13,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:13,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181056702] [2024-11-07 19:49:13,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181056702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:13,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:13,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:13,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692821744] [2024-11-07 19:49:13,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:13,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:49:13,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:13,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:49:13,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:13,950 INFO L87 Difference]: Start difference. First operand 219 states and 269 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 19:49:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:14,034 INFO L93 Difference]: Finished difference Result 233 states and 281 transitions. [2024-11-07 19:49:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:49:14,034 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-07 19:49:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:14,035 INFO L225 Difference]: With dead ends: 233 [2024-11-07 19:49:14,036 INFO L226 Difference]: Without dead ends: 231 [2024-11-07 19:49:14,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:49:14,037 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 141 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:14,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 305 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:49:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-07 19:49:14,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 210. [2024-11-07 19:49:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 185 states have (on average 1.3405405405405406) internal successors, (248), 201 states have internal predecessors, (248), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:14,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 256 transitions. [2024-11-07 19:49:14,045 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 256 transitions. Word has length 24 [2024-11-07 19:49:14,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:14,045 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 256 transitions. [2024-11-07 19:49:14,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 19:49:14,045 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 256 transitions. [2024-11-07 19:49:14,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 19:49:14,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:14,046 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:14,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 19:49:14,047 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:14,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:14,047 INFO L85 PathProgramCache]: Analyzing trace with hash -555382723, now seen corresponding path program 1 times [2024-11-07 19:49:14,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:14,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980486049] [2024-11-07 19:49:14,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:14,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:14,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:14,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:14,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980486049] [2024-11-07 19:49:14,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980486049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:14,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:14,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:14,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127349643] [2024-11-07 19:49:14,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:14,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:49:14,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:14,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:49:14,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:49:14,083 INFO L87 Difference]: Start difference. First operand 210 states and 256 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 19:49:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:14,123 INFO L93 Difference]: Finished difference Result 368 states and 448 transitions. [2024-11-07 19:49:14,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:49:14,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-07 19:49:14,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:14,124 INFO L225 Difference]: With dead ends: 368 [2024-11-07 19:49:14,124 INFO L226 Difference]: Without dead ends: 187 [2024-11-07 19:49:14,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:14,125 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 37 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:14,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 317 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:14,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-07 19:49:14,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2024-11-07 19:49:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 159 states have (on average 1.3522012578616351) internal successors, (215), 175 states have internal predecessors, (215), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 223 transitions. [2024-11-07 19:49:14,130 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 223 transitions. Word has length 24 [2024-11-07 19:49:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:14,131 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 223 transitions. [2024-11-07 19:49:14,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 19:49:14,131 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 223 transitions. [2024-11-07 19:49:14,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 19:49:14,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:14,131 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:14,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 19:49:14,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:14,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:14,132 INFO L85 PathProgramCache]: Analyzing trace with hash 63091986, now seen corresponding path program 1 times [2024-11-07 19:49:14,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:14,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087799870] [2024-11-07 19:49:14,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:14,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:14,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:14,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:14,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:14,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087799870] [2024-11-07 19:49:14,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087799870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:14,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:14,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:14,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466926870] [2024-11-07 19:49:14,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:14,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:49:14,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:14,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:49:14,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:14,174 INFO L87 Difference]: Start difference. First operand 184 states and 223 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 19:49:14,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:14,241 INFO L93 Difference]: Finished difference Result 355 states and 432 transitions. [2024-11-07 19:49:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:49:14,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-07 19:49:14,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:14,242 INFO L225 Difference]: With dead ends: 355 [2024-11-07 19:49:14,242 INFO L226 Difference]: Without dead ends: 204 [2024-11-07 19:49:14,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:49:14,243 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 71 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:14,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 383 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:49:14,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-07 19:49:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 196. [2024-11-07 19:49:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 187 states have internal predecessors, (229), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 237 transitions. [2024-11-07 19:49:14,249 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 237 transitions. Word has length 24 [2024-11-07 19:49:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:14,249 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 237 transitions. [2024-11-07 19:49:14,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 19:49:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 237 transitions. [2024-11-07 19:49:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 19:49:14,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:14,250 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:14,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 19:49:14,250 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:14,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:14,250 INFO L85 PathProgramCache]: Analyzing trace with hash 324492628, now seen corresponding path program 1 times [2024-11-07 19:49:14,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:14,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962651335] [2024-11-07 19:49:14,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:14,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:14,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:14,276 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 19:49:14,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:14,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962651335] [2024-11-07 19:49:14,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962651335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:14,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:14,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:49:14,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790311935] [2024-11-07 19:49:14,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:14,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:49:14,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:14,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:49:14,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:49:14,277 INFO L87 Difference]: Start difference. First operand 196 states and 237 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 19:49:14,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:14,318 INFO L93 Difference]: Finished difference Result 201 states and 244 transitions. [2024-11-07 19:49:14,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:49:14,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2024-11-07 19:49:14,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:14,319 INFO L225 Difference]: With dead ends: 201 [2024-11-07 19:49:14,319 INFO L226 Difference]: Without dead ends: 200 [2024-11-07 19:49:14,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:49:14,319 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 8 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:14,320 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 279 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-07 19:49:14,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 186. [2024-11-07 19:49:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.3478260869565217) internal successors, (217), 177 states have internal predecessors, (217), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:14,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 225 transitions. [2024-11-07 19:49:14,326 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 225 transitions. Word has length 29 [2024-11-07 19:49:14,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:14,326 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 225 transitions. [2024-11-07 19:49:14,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-07 19:49:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 225 transitions. [2024-11-07 19:49:14,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-07 19:49:14,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:14,326 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:14,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 19:49:14,327 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:14,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:14,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1973004361, now seen corresponding path program 1 times [2024-11-07 19:49:14,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:14,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929278019] [2024-11-07 19:49:14,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:14,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:14,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:14,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:49:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:14,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 19:49:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-07 19:49:14,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:14,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929278019] [2024-11-07 19:49:14,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929278019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:49:14,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643566215] [2024-11-07 19:49:14,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:14,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:14,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:14,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:49:14,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 19:49:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:14,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 19:49:14,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 19:49:14,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:49:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-07 19:49:14,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643566215] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:49:14,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:49:14,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-11-07 19:49:14,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511853515] [2024-11-07 19:49:14,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:49:14,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 19:49:14,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:14,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 19:49:14,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-07 19:49:14,629 INFO L87 Difference]: Start difference. First operand 186 states and 225 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 19:49:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:14,850 INFO L93 Difference]: Finished difference Result 652 states and 826 transitions. [2024-11-07 19:49:14,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 19:49:14,851 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2024-11-07 19:49:14,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:14,853 INFO L225 Difference]: With dead ends: 652 [2024-11-07 19:49:14,853 INFO L226 Difference]: Without dead ends: 501 [2024-11-07 19:49:14,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2024-11-07 19:49:14,854 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 220 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:14,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 503 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 19:49:14,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-07 19:49:14,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 206. [2024-11-07 19:49:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 181 states have (on average 1.3314917127071824) internal successors, (241), 197 states have internal predecessors, (241), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:14,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 249 transitions. [2024-11-07 19:49:14,864 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 249 transitions. Word has length 44 [2024-11-07 19:49:14,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:14,864 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 249 transitions. [2024-11-07 19:49:14,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 14 states have internal predecessors, (70), 2 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 19:49:14,865 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 249 transitions. [2024-11-07 19:49:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 19:49:14,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:14,865 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:14,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 19:49:15,065 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,SelfDestructingSolverStorable15 [2024-11-07 19:49:15,066 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:15,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:15,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1869642328, now seen corresponding path program 1 times [2024-11-07 19:49:15,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:15,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841721737] [2024-11-07 19:49:15,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:15,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:49:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 19:49:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 19:49:15,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:15,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841721737] [2024-11-07 19:49:15,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841721737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:15,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:15,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989518248] [2024-11-07 19:49:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:15,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:49:15,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:15,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:49:15,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:15,131 INFO L87 Difference]: Start difference. First operand 206 states and 249 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 19:49:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:15,203 INFO L93 Difference]: Finished difference Result 210 states and 252 transitions. [2024-11-07 19:49:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:49:15,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-07 19:49:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:15,204 INFO L225 Difference]: With dead ends: 210 [2024-11-07 19:49:15,204 INFO L226 Difference]: Without dead ends: 207 [2024-11-07 19:49:15,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:49:15,205 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 130 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:15,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 324 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:49:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-07 19:49:15,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 196. [2024-11-07 19:49:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 174 states have (on average 1.3160919540229885) internal successors, (229), 187 states have internal predecessors, (229), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 237 transitions. [2024-11-07 19:49:15,213 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 237 transitions. Word has length 47 [2024-11-07 19:49:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:15,214 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 237 transitions. [2024-11-07 19:49:15,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 19:49:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 237 transitions. [2024-11-07 19:49:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 19:49:15,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:15,214 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:15,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 19:49:15,215 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:15,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:15,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1898269684, now seen corresponding path program 1 times [2024-11-07 19:49:15,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:15,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414430868] [2024-11-07 19:49:15,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:15,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:49:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 19:49:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-07 19:49:15,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:15,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414430868] [2024-11-07 19:49:15,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414430868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:15,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:15,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:15,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352164992] [2024-11-07 19:49:15,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:15,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:49:15,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:15,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:49:15,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:15,266 INFO L87 Difference]: Start difference. First operand 196 states and 237 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 19:49:15,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:15,344 INFO L93 Difference]: Finished difference Result 204 states and 246 transitions. [2024-11-07 19:49:15,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:49:15,347 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2024-11-07 19:49:15,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:15,348 INFO L225 Difference]: With dead ends: 204 [2024-11-07 19:49:15,348 INFO L226 Difference]: Without dead ends: 202 [2024-11-07 19:49:15,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:49:15,349 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 138 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:15,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 319 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:49:15,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-07 19:49:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 185. [2024-11-07 19:49:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 165 states have (on average 1.3151515151515152) internal successors, (217), 176 states have internal predecessors, (217), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:15,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 225 transitions. [2024-11-07 19:49:15,364 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 225 transitions. Word has length 47 [2024-11-07 19:49:15,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:15,365 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 225 transitions. [2024-11-07 19:49:15,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 19:49:15,365 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 225 transitions. [2024-11-07 19:49:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-07 19:49:15,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:15,369 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:15,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 19:49:15,369 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:15,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:15,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1454050813, now seen corresponding path program 1 times [2024-11-07 19:49:15,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:15,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856427149] [2024-11-07 19:49:15,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:15,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:49:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,502 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-07 19:49:15,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:15,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856427149] [2024-11-07 19:49:15,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856427149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:15,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:15,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:15,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513530722] [2024-11-07 19:49:15,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:15,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:49:15,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:15,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:49:15,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:49:15,504 INFO L87 Difference]: Start difference. First operand 185 states and 225 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 19:49:15,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:15,579 INFO L93 Difference]: Finished difference Result 347 states and 423 transitions. [2024-11-07 19:49:15,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 19:49:15,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2024-11-07 19:49:15,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:15,581 INFO L225 Difference]: With dead ends: 347 [2024-11-07 19:49:15,581 INFO L226 Difference]: Without dead ends: 210 [2024-11-07 19:49:15,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:15,581 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 11 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:15,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 302 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:49:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-07 19:49:15,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 181. [2024-11-07 19:49:15,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.3043478260869565) internal successors, (210), 172 states have internal predecessors, (210), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 218 transitions. [2024-11-07 19:49:15,590 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 218 transitions. Word has length 47 [2024-11-07 19:49:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:15,590 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 218 transitions. [2024-11-07 19:49:15,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 19:49:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 218 transitions. [2024-11-07 19:49:15,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-07 19:49:15,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:15,591 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:15,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 19:49:15,591 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:15,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:15,591 INFO L85 PathProgramCache]: Analyzing trace with hash -338960106, now seen corresponding path program 1 times [2024-11-07 19:49:15,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:15,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039924404] [2024-11-07 19:49:15,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:15,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:15,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:49:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,690 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:15,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:15,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039924404] [2024-11-07 19:49:15,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039924404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:15,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:15,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 19:49:15,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7382343] [2024-11-07 19:49:15,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:15,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:49:15,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:15,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:49:15,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:15,692 INFO L87 Difference]: Start difference. First operand 181 states and 218 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 19:49:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:15,774 INFO L93 Difference]: Finished difference Result 398 states and 478 transitions. [2024-11-07 19:49:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:49:15,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2024-11-07 19:49:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:15,775 INFO L225 Difference]: With dead ends: 398 [2024-11-07 19:49:15,775 INFO L226 Difference]: Without dead ends: 262 [2024-11-07 19:49:15,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:49:15,776 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 64 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:15,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 201 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:49:15,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-07 19:49:15,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 181. [2024-11-07 19:49:15,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.2981366459627328) internal successors, (209), 172 states have internal predecessors, (209), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 217 transitions. [2024-11-07 19:49:15,786 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 217 transitions. Word has length 48 [2024-11-07 19:49:15,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:15,786 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 217 transitions. [2024-11-07 19:49:15,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 19:49:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 217 transitions. [2024-11-07 19:49:15,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-07 19:49:15,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:15,786 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:15,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 19:49:15,786 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:15,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:15,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1180459864, now seen corresponding path program 1 times [2024-11-07 19:49:15,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:15,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731939752] [2024-11-07 19:49:15,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:15,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:49:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:15,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:15,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731939752] [2024-11-07 19:49:15,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731939752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:49:15,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499258628] [2024-11-07 19:49:15,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:15,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:15,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:15,943 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:49:15,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 19:49:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:15,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 19:49:15,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:16,233 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:49:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:16,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499258628] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:49:16,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:49:16,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8] total 18 [2024-11-07 19:49:16,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186857231] [2024-11-07 19:49:16,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:49:16,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-07 19:49:16,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:16,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-07 19:49:16,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2024-11-07 19:49:16,637 INFO L87 Difference]: Start difference. First operand 181 states and 217 transitions. Second operand has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 19:49:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:17,947 INFO L93 Difference]: Finished difference Result 512 states and 612 transitions. [2024-11-07 19:49:17,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 19:49:17,948 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2024-11-07 19:49:17,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:17,949 INFO L225 Difference]: With dead ends: 512 [2024-11-07 19:49:17,949 INFO L226 Difference]: Without dead ends: 360 [2024-11-07 19:49:17,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=373, Unknown=0, NotChecked=0, Total=600 [2024-11-07 19:49:17,950 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 119 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:17,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 794 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 19:49:17,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-07 19:49:17,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 181. [2024-11-07 19:49:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 161 states have (on average 1.2732919254658386) internal successors, (205), 172 states have internal predecessors, (205), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2024-11-07 19:49:17,959 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 53 [2024-11-07 19:49:17,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:17,959 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2024-11-07 19:49:17,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 19:49:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2024-11-07 19:49:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-07 19:49:17,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:17,960 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:17,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-07 19:49:18,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:18,161 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:18,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:18,162 INFO L85 PathProgramCache]: Analyzing trace with hash 302294674, now seen corresponding path program 1 times [2024-11-07 19:49:18,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:18,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465961336] [2024-11-07 19:49:18,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:18,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:18,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:18,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:49:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:18,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:18,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465961336] [2024-11-07 19:49:18,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465961336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:49:18,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831933605] [2024-11-07 19:49:18,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:18,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:18,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:18,308 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:49:18,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-07 19:49:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:18,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 19:49:18,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:18,467 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:49:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:18,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831933605] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:49:18,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:49:18,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-11-07 19:49:18,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603175600] [2024-11-07 19:49:18,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:49:18,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 19:49:18,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:18,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 19:49:18,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2024-11-07 19:49:18,687 INFO L87 Difference]: Start difference. First operand 181 states and 213 transitions. Second operand has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 19:49:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:19,049 INFO L93 Difference]: Finished difference Result 969 states and 1207 transitions. [2024-11-07 19:49:19,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-07 19:49:19,049 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 64 [2024-11-07 19:49:19,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:19,052 INFO L225 Difference]: With dead ends: 969 [2024-11-07 19:49:19,052 INFO L226 Difference]: Without dead ends: 843 [2024-11-07 19:49:19,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=304, Invalid=508, Unknown=0, NotChecked=0, Total=812 [2024-11-07 19:49:19,054 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 471 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:19,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 698 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 19:49:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-11-07 19:49:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 221. [2024-11-07 19:49:19,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 201 states have (on average 1.2587064676616915) internal successors, (253), 212 states have internal predecessors, (253), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:19,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 261 transitions. [2024-11-07 19:49:19,067 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 261 transitions. Word has length 64 [2024-11-07 19:49:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:19,067 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 261 transitions. [2024-11-07 19:49:19,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 26 states have internal predecessors, (133), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 19:49:19,067 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 261 transitions. [2024-11-07 19:49:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-07 19:49:19,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:19,068 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:19,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-07 19:49:19,268 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,SelfDestructingSolverStorable21 [2024-11-07 19:49:19,269 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:19,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:19,269 INFO L85 PathProgramCache]: Analyzing trace with hash 85610712, now seen corresponding path program 2 times [2024-11-07 19:49:19,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:19,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378403287] [2024-11-07 19:49:19,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:19,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:19,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:19,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:49:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:19,590 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:19,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:19,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378403287] [2024-11-07 19:49:19,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378403287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:49:19,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467896763] [2024-11-07 19:49:19,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:49:19,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:19,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:19,592 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:49:19,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-07 19:49:19,676 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 19:49:19,676 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:49:19,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-07 19:49:19,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:20,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:49:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:22,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467896763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:49:22,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:49:22,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 17] total 41 [2024-11-07 19:49:22,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461707756] [2024-11-07 19:49:22,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:49:22,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-07 19:49:22,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:22,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-07 19:49:22,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1149, Unknown=0, NotChecked=0, Total=1640 [2024-11-07 19:49:22,082 INFO L87 Difference]: Start difference. First operand 221 states and 261 transitions. Second operand has 41 states, 41 states have (on average 3.658536585365854) internal successors, (150), 41 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 19:49:26,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:26,204 INFO L93 Difference]: Finished difference Result 720 states and 856 transitions. [2024-11-07 19:49:26,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-07 19:49:26,206 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.658536585365854) internal successors, (150), 41 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 73 [2024-11-07 19:49:26,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:26,208 INFO L225 Difference]: With dead ends: 720 [2024-11-07 19:49:26,208 INFO L226 Difference]: Without dead ends: 566 [2024-11-07 19:49:26,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1069 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=951, Invalid=2019, Unknown=0, NotChecked=0, Total=2970 [2024-11-07 19:49:26,210 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 375 mSDsluCounter, 1578 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:26,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1718 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 19:49:26,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-07 19:49:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 221. [2024-11-07 19:49:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 201 states have (on average 1.2189054726368158) internal successors, (245), 212 states have internal predecessors, (245), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 253 transitions. [2024-11-07 19:49:26,227 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 253 transitions. Word has length 73 [2024-11-07 19:49:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:26,227 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 253 transitions. [2024-11-07 19:49:26,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.658536585365854) internal successors, (150), 41 states have internal predecessors, (150), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 19:49:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 253 transitions. [2024-11-07 19:49:26,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 19:49:26,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:26,230 INFO L215 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:26,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-07 19:49:26,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:26,435 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:26,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:26,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1727507346, now seen corresponding path program 2 times [2024-11-07 19:49:26,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:26,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676014714] [2024-11-07 19:49:26,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:26,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:26,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:49:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:26,920 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:26,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:26,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676014714] [2024-11-07 19:49:26,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676014714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:49:26,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875215034] [2024-11-07 19:49:26,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 19:49:26,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:26,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:26,925 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:49:26,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-07 19:49:26,980 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 19:49:26,980 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:49:26,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 19:49:26,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:27,361 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:27,361 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:49:27,953 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:27,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875215034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:49:27,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:49:27,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2024-11-07 19:49:27,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061146606] [2024-11-07 19:49:27,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:49:27,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-07 19:49:27,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:27,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-07 19:49:27,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2024-11-07 19:49:27,955 INFO L87 Difference]: Start difference. First operand 221 states and 253 transitions. Second operand has 50 states, 50 states have (on average 5.06) internal successors, (253), 50 states have internal predecessors, (253), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 19:49:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:28,664 INFO L93 Difference]: Finished difference Result 1689 states and 2119 transitions. [2024-11-07 19:49:28,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-07 19:49:28,665 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.06) internal successors, (253), 50 states have internal predecessors, (253), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2024-11-07 19:49:28,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:28,669 INFO L225 Difference]: With dead ends: 1689 [2024-11-07 19:49:28,669 INFO L226 Difference]: Without dead ends: 1563 [2024-11-07 19:49:28,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=992, Invalid=1764, Unknown=0, NotChecked=0, Total=2756 [2024-11-07 19:49:28,670 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 1168 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:28,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 779 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 19:49:28,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2024-11-07 19:49:28,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 301. [2024-11-07 19:49:28,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 281 states have (on average 1.2135231316725978) internal successors, (341), 292 states have internal predecessors, (341), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 19:49:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 349 transitions. [2024-11-07 19:49:28,689 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 349 transitions. Word has length 104 [2024-11-07 19:49:28,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:28,690 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 349 transitions. [2024-11-07 19:49:28,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.06) internal successors, (253), 50 states have internal predecessors, (253), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-07 19:49:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 349 transitions. [2024-11-07 19:49:28,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 19:49:28,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:28,691 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:28,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-07 19:49:28,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:28,895 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2024-11-07 19:49:28,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:28,895 INFO L85 PathProgramCache]: Analyzing trace with hash 12381144, now seen corresponding path program 3 times [2024-11-07 19:49:28,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:28,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480391253] [2024-11-07 19:49:28,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:28,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:29,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:29,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:49:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 18 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:29,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:29,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480391253] [2024-11-07 19:49:29,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480391253] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:49:29,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403054349] [2024-11-07 19:49:29,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 19:49:29,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:29,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:29,567 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:49:29,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-07 19:49:29,864 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2024-11-07 19:49:29,864 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 19:49:29,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-07 19:49:29,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 18 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:33,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 19:49:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 18 proven. 455 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-07 19:49:41,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403054349] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 19:49:41,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 19:49:41,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 34, 33] total 80 [2024-11-07 19:49:41,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409107623] [2024-11-07 19:49:41,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 19:49:41,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-11-07 19:49:41,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:41,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-11-07 19:49:41,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1663, Invalid=4657, Unknown=0, NotChecked=0, Total=6320 [2024-11-07 19:49:41,229 INFO L87 Difference]: Start difference. First operand 301 states and 349 transitions. Second operand has 80 states, 80 states have (on average 3.3625) internal successors, (269), 80 states have internal predecessors, (269), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)