./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-3.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_1-3.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', '94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911'] 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_1-3.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 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:48:53,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:48:53,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-07 19:48:53,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:48:53,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:48:54,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:48:54,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:48:54,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:48:54,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:48:54,029 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:48:54,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:48:54,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:48:54,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:48:54,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:48:54,030 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:48:54,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:48:54,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 19:48:54,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:48:54,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:48:54,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:48:54,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:48:54,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 19:48:54,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:48:54,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 19:48:54,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:48:54,031 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 19:48:54,031 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:48:54,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:48:54,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 19:48:54,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:48:54,031 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:48:54,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:48:54,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:48:54,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:48:54,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:48:54,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:48:54,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:48:54,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 19:48:54,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:48:54,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:48:54,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:48:54,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:48:54,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:48:54,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:48:54,032 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 -> 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 [2024-11-07 19:48:54,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:48:54,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:48:54,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:48:54,330 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:48:54,330 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:48:54,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2024-11-07 19:48:55,630 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:48:55,833 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:48:55,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2024-11-07 19:48:55,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/685b20eba/14353d893c9f45de99e20dd4ae7f1aa2/FLAG752e5237e [2024-11-07 19:48:55,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/685b20eba/14353d893c9f45de99e20dd4ae7f1aa2 [2024-11-07 19:48:55,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:48:55,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:48:55,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:48:55,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:48:55,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:48:55,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:48:55" (1/1) ... [2024-11-07 19:48:55,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7423359f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:55, skipping insertion in model container [2024-11-07 19:48:55,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:48:55" (1/1) ... [2024-11-07 19:48:55,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:48:56,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:48:56,055 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:48:56,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:48:56,108 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:48:56,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:56 WrapperNode [2024-11-07 19:48:56,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:48:56,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:48:56,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:48:56,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:48:56,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:56" (1/1) ... [2024-11-07 19:48:56,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:56" (1/1) ... [2024-11-07 19:48:56,150 INFO L138 Inliner]: procedures = 17, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 209 [2024-11-07 19:48:56,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:48:56,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:48:56,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:48:56,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:48:56,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:56" (1/1) ... [2024-11-07 19:48:56,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:56" (1/1) ... [2024-11-07 19:48:56,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:56" (1/1) ... [2024-11-07 19:48:56,186 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 19:48:56,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:56" (1/1) ... [2024-11-07 19:48:56,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:56" (1/1) ... [2024-11-07 19:48:56,191 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:56" (1/1) ... [2024-11-07 19:48:56,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:56" (1/1) ... [2024-11-07 19:48:56,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:56" (1/1) ... [2024-11-07 19:48:56,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:56" (1/1) ... [2024-11-07 19:48:56,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:48:56,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:48:56,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:48:56,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:48:56,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:56" (1/1) ... [2024-11-07 19:48:56,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:48:56,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:48:56,238 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 19:48:56,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 19:48:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:48:56,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:48:56,264 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-07 19:48:56,264 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-07 19:48:56,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:48:56,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:48:56,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 19:48:56,264 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 19:48:56,329 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:48:56,331 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:48:56,877 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-11-07 19:48:56,878 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:48:56,889 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:48:56,889 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 19:48:56,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:48:56 BoogieIcfgContainer [2024-11-07 19:48:56,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:48:56,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:48:56,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:48:56,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:48:56,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:48:55" (1/3) ... [2024-11-07 19:48:56,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384d5d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:48:56, skipping insertion in model container [2024-11-07 19:48:56,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:48:56" (2/3) ... [2024-11-07 19:48:56,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384d5d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:48:56, skipping insertion in model container [2024-11-07 19:48:56,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:48:56" (3/3) ... [2024-11-07 19:48:56,901 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3.c.cil.c [2024-11-07 19:48:56,914 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:48:56,914 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-07 19:48:56,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:48:56,971 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;@2e605ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:48:56,971 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-07 19:48:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 105 states have (on average 1.6571428571428573) internal successors, (174), 129 states have internal predecessors, (174), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 19:48:56,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 19:48:56,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:48:56,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:48:56,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:48:56,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:48:56,990 INFO L85 PathProgramCache]: Analyzing trace with hash 920510012, now seen corresponding path program 1 times [2024-11-07 19:48:56,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:48:56,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390699214] [2024-11-07 19:48:56,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:48:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:48:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:48:57,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:48:57,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390699214] [2024-11-07 19:48:57,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390699214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:48:57,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:48:57,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:48:57,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294426177] [2024-11-07 19:48:57,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:48:57,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:48:57,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:48:57,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:48:57,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:48:57,210 INFO L87 Difference]: Start difference. First operand has 139 states, 105 states have (on average 1.6571428571428573) internal successors, (174), 129 states have internal predecessors, (174), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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:48:57,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:48:57,375 INFO L93 Difference]: Finished difference Result 329 states and 478 transitions. [2024-11-07 19:48:57,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:48:57,381 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:48:57,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:48:57,390 INFO L225 Difference]: With dead ends: 329 [2024-11-07 19:48:57,390 INFO L226 Difference]: Without dead ends: 161 [2024-11-07 19:48:57,396 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:48:57,399 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 90 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:48:57,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 495 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:48:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-07 19:48:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 149. [2024-11-07 19:48:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 122 states have (on average 1.4918032786885247) internal successors, (182), 139 states have internal predecessors, (182), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:48:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 194 transitions. [2024-11-07 19:48:57,452 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 194 transitions. Word has length 9 [2024-11-07 19:48:57,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:48:57,453 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 194 transitions. [2024-11-07 19:48:57,453 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:48:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 194 transitions. [2024-11-07 19:48:57,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 19:48:57,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:48:57,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:48:57,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:48:57,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:48:57,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:48:57,459 INFO L85 PathProgramCache]: Analyzing trace with hash -926903484, now seen corresponding path program 1 times [2024-11-07 19:48:57,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:48:57,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300168809] [2024-11-07 19:48:57,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:48:57,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:48:57,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:57,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:48:57,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:48:57,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300168809] [2024-11-07 19:48:57,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300168809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:48:57,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:48:57,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:48:57,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724503463] [2024-11-07 19:48:57,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:48:57,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:48:57,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:48:57,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:48:57,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:48:57,537 INFO L87 Difference]: Start difference. First operand 149 states and 194 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:48:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:48:57,609 INFO L93 Difference]: Finished difference Result 281 states and 364 transitions. [2024-11-07 19:48:57,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:48:57,614 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:48:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:48:57,615 INFO L225 Difference]: With dead ends: 281 [2024-11-07 19:48:57,615 INFO L226 Difference]: Without dead ends: 163 [2024-11-07 19:48:57,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:48:57,617 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 12 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 227 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:48:57,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 227 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:48:57,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-07 19:48:57,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 153. [2024-11-07 19:48:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 126 states have (on average 1.4761904761904763) internal successors, (186), 143 states have internal predecessors, (186), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:48:57,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 198 transitions. [2024-11-07 19:48:57,681 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 198 transitions. Word has length 14 [2024-11-07 19:48:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:48:57,682 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 198 transitions. [2024-11-07 19:48:57,682 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:48:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 198 transitions. [2024-11-07 19:48:57,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 19:48:57,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:48:57,682 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:48:57,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:48:57,683 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:48:57,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:48:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash -927014830, now seen corresponding path program 1 times [2024-11-07 19:48:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:48:57,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101194894] [2024-11-07 19:48:57,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:48:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:48:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:57,741 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:48:57,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:48:57,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101194894] [2024-11-07 19:48:57,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101194894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:48:57,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:48:57,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:48:57,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127880407] [2024-11-07 19:48:57,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:48:57,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:48:57,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:48:57,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:48:57,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:48:57,743 INFO L87 Difference]: Start difference. First operand 153 states and 198 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:48:57,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:48:57,807 INFO L93 Difference]: Finished difference Result 153 states and 198 transitions. [2024-11-07 19:48:57,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:48:57,808 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:48:57,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:48:57,809 INFO L225 Difference]: With dead ends: 153 [2024-11-07 19:48:57,809 INFO L226 Difference]: Without dead ends: 152 [2024-11-07 19:48:57,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:48:57,810 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 220 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:48:57,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 220 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:48:57,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-07 19:48:57,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-07 19:48:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 126 states have (on average 1.4603174603174602) internal successors, (184), 142 states have internal predecessors, (184), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:48:57,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 196 transitions. [2024-11-07 19:48:57,822 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 196 transitions. Word has length 14 [2024-11-07 19:48:57,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:48:57,823 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 196 transitions. [2024-11-07 19:48:57,823 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:48:57,823 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 196 transitions. [2024-11-07 19:48:57,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 19:48:57,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:48:57,824 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:48:57,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:48:57,824 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:48:57,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:48:57,825 INFO L85 PathProgramCache]: Analyzing trace with hash -287960534, now seen corresponding path program 1 times [2024-11-07 19:48:57,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:48:57,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159174409] [2024-11-07 19:48:57,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:48:57,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:48:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:57,925 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:48:57,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:48:57,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159174409] [2024-11-07 19:48:57,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159174409] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:48:57,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042706261] [2024-11-07 19:48:57,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:48:57,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:48:57,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:48:57,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:48:57,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 19:48:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:57,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:48:57,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:48:58,043 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:48:58,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:48:58,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042706261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:48:58,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 19:48:58,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-07 19:48:58,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205929415] [2024-11-07 19:48:58,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:48:58,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:48:58,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:48:58,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:48:58,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:48:58,047 INFO L87 Difference]: Start difference. First operand 152 states and 196 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:48:58,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:48:58,130 INFO L93 Difference]: Finished difference Result 178 states and 236 transitions. [2024-11-07 19:48:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:48:58,131 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:48:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:48:58,132 INFO L225 Difference]: With dead ends: 178 [2024-11-07 19:48:58,132 INFO L226 Difference]: Without dead ends: 176 [2024-11-07 19:48:58,132 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:48:58,133 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 25 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:48:58,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 319 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:48:58,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-07 19:48:58,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 159. [2024-11-07 19:48:58,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 133 states have (on average 1.4360902255639099) internal successors, (191), 149 states have internal predecessors, (191), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:48:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 203 transitions. [2024-11-07 19:48:58,147 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 203 transitions. Word has length 15 [2024-11-07 19:48:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:48:58,147 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 203 transitions. [2024-11-07 19:48:58,148 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:48:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 203 transitions. [2024-11-07 19:48:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 19:48:58,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:48:58,148 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:48:58,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 19:48:58,349 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:48:58,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:48:58,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:48:58,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1327311399, now seen corresponding path program 1 times [2024-11-07 19:48:58,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:48:58,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668348057] [2024-11-07 19:48:58,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:48:58,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:48:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:58,428 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:48:58,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:48:58,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668348057] [2024-11-07 19:48:58,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668348057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:48:58,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423779591] [2024-11-07 19:48:58,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:48:58,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:48:58,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:48:58,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:48:58,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 19:48:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:58,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:48:58,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:48:58,493 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:48:58,493 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:48:58,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423779591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:48:58,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 19:48:58,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-07 19:48:58,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220026676] [2024-11-07 19:48:58,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:48:58,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:48:58,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:48:58,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:48:58,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:48:58,495 INFO L87 Difference]: Start difference. First operand 159 states and 203 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:48:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:48:58,557 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2024-11-07 19:48:58,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:48:58,559 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:48:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:48:58,560 INFO L225 Difference]: With dead ends: 165 [2024-11-07 19:48:58,560 INFO L226 Difference]: Without dead ends: 164 [2024-11-07 19:48:58,561 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:48:58,561 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 17 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 211 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.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:48:58,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 211 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:48:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-07 19:48:58,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2024-11-07 19:48:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 135 states have (on average 1.4296296296296296) internal successors, (193), 151 states have internal predecessors, (193), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:48:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 205 transitions. [2024-11-07 19:48:58,583 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 205 transitions. Word has length 15 [2024-11-07 19:48:58,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:48:58,583 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 205 transitions. [2024-11-07 19:48:58,583 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:48:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 205 transitions. [2024-11-07 19:48:58,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 19:48:58,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:48:58,584 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:48:58,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 19:48:58,784 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:48:58,784 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:48:58,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:48:58,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2127048770, now seen corresponding path program 1 times [2024-11-07 19:48:58,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:48:58,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629219519] [2024-11-07 19:48:58,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:48:58,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:48:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:58,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:48:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:58,869 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:48:58,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:48:58,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629219519] [2024-11-07 19:48:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629219519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:48:58,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:48:58,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:48:58,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889527840] [2024-11-07 19:48:58,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:48:58,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:48:58,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:48:58,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:48:58,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:48:58,873 INFO L87 Difference]: Start difference. First operand 161 states and 205 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:48:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:48:59,003 INFO L93 Difference]: Finished difference Result 230 states and 293 transitions. [2024-11-07 19:48:59,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:48:59,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 17 [2024-11-07 19:48:59,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:48:59,005 INFO L225 Difference]: With dead ends: 230 [2024-11-07 19:48:59,005 INFO L226 Difference]: Without dead ends: 226 [2024-11-07 19:48:59,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:48:59,006 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 143 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:48:59,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 338 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:48:59,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-07 19:48:59,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 209. [2024-11-07 19:48:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 183 states have (on average 1.4207650273224044) internal successors, (260), 198 states have internal predecessors, (260), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:48:59,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 272 transitions. [2024-11-07 19:48:59,027 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 272 transitions. Word has length 17 [2024-11-07 19:48:59,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:48:59,027 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 272 transitions. [2024-11-07 19:48:59,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:48:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 272 transitions. [2024-11-07 19:48:59,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 19:48:59,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:48:59,028 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:48:59,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:48:59,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:48:59,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:48:59,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2098421414, now seen corresponding path program 1 times [2024-11-07 19:48:59,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:48:59,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838937512] [2024-11-07 19:48:59,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:48:59,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:48:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:59,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:48:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:59,098 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:48:59,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:48:59,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838937512] [2024-11-07 19:48:59,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838937512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:48:59,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:48:59,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:48:59,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011429712] [2024-11-07 19:48:59,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:48:59,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:48:59,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:48:59,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:48:59,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:48:59,104 INFO L87 Difference]: Start difference. First operand 209 states and 272 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:48:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:48:59,252 INFO L93 Difference]: Finished difference Result 231 states and 294 transitions. [2024-11-07 19:48:59,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:48:59,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 17 [2024-11-07 19:48:59,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:48:59,254 INFO L225 Difference]: With dead ends: 231 [2024-11-07 19:48:59,256 INFO L226 Difference]: Without dead ends: 228 [2024-11-07 19:48:59,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:48:59,257 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 145 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:48:59,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 338 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:48:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-07 19:48:59,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 207. [2024-11-07 19:48:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 182 states have (on average 1.39010989010989) internal successors, (253), 196 states have internal predecessors, (253), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:48:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 265 transitions. [2024-11-07 19:48:59,269 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 265 transitions. Word has length 17 [2024-11-07 19:48:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:48:59,271 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 265 transitions. [2024-11-07 19:48:59,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:48:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 265 transitions. [2024-11-07 19:48:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 19:48:59,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:48:59,272 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:48:59,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:48:59,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:48:59,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:48:59,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1074804734, now seen corresponding path program 1 times [2024-11-07 19:48:59,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:48:59,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272958786] [2024-11-07 19:48:59,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:48:59,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:48:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:48:59,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:48:59,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272958786] [2024-11-07 19:48:59,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272958786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:48:59,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:48:59,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:48:59,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537503610] [2024-11-07 19:48:59,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:48:59,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:48:59,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:48:59,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:48:59,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:48:59,308 INFO L87 Difference]: Start difference. First operand 207 states and 265 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:48:59,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:48:59,349 INFO L93 Difference]: Finished difference Result 391 states and 498 transitions. [2024-11-07 19:48:59,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:48:59,350 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:48:59,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:48:59,351 INFO L225 Difference]: With dead ends: 391 [2024-11-07 19:48:59,351 INFO L226 Difference]: Without dead ends: 218 [2024-11-07 19:48:59,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:48:59,352 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 223 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:48:59,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 223 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:48:59,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-07 19:48:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 208. [2024-11-07 19:48:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 183 states have (on average 1.360655737704918) internal successors, (249), 197 states have internal predecessors, (249), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:48:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 261 transitions. [2024-11-07 19:48:59,362 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 261 transitions. Word has length 16 [2024-11-07 19:48:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:48:59,362 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 261 transitions. [2024-11-07 19:48:59,363 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:48:59,363 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 261 transitions. [2024-11-07 19:48:59,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 19:48:59,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:48:59,366 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:48:59,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:48:59,366 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:48:59,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:48:59,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1850000426, now seen corresponding path program 1 times [2024-11-07 19:48:59,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:48:59,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703222066] [2024-11-07 19:48:59,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:48:59,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:48:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:59,448 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:48:59,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:48:59,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703222066] [2024-11-07 19:48:59,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703222066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:48:59,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591661680] [2024-11-07 19:48:59,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:48:59,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:48:59,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:48:59,452 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:48:59,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 19:48:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:59,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:48:59,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:48:59,526 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:48:59,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:48:59,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591661680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:48:59,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 19:48:59,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-07 19:48:59,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402147175] [2024-11-07 19:48:59,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:48:59,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:48:59,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:48:59,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:48:59,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:48:59,529 INFO L87 Difference]: Start difference. First operand 208 states and 261 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:48:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:48:59,599 INFO L93 Difference]: Finished difference Result 222 states and 280 transitions. [2024-11-07 19:48:59,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:48:59,601 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:48:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:48:59,602 INFO L225 Difference]: With dead ends: 222 [2024-11-07 19:48:59,603 INFO L226 Difference]: Without dead ends: 221 [2024-11-07 19:48:59,603 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:48:59,604 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 9 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:48:59,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 323 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:48:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-07 19:48:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 207. [2024-11-07 19:48:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 182 states have (on average 1.3516483516483517) internal successors, (246), 196 states have internal predecessors, (246), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:48:59,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 258 transitions. [2024-11-07 19:48:59,620 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 258 transitions. Word has length 17 [2024-11-07 19:48:59,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:48:59,621 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 258 transitions. [2024-11-07 19:48:59,621 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:48:59,621 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 258 transitions. [2024-11-07 19:48:59,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 19:48:59,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:48:59,622 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:48:59,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 19:48:59,823 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:48:59,823 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:48:59,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:48:59,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1602729165, now seen corresponding path program 1 times [2024-11-07 19:48:59,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:48:59,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448997098] [2024-11-07 19:48:59,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:48:59,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:48:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:48:59,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:48:59,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448997098] [2024-11-07 19:48:59,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448997098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:48:59,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:48:59,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:48:59,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075874994] [2024-11-07 19:48:59,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:48:59,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:48:59,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:48:59,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:48:59,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:48:59,875 INFO L87 Difference]: Start difference. First operand 207 states and 258 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:48:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:48:59,927 INFO L93 Difference]: Finished difference Result 364 states and 453 transitions. [2024-11-07 19:48:59,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:48:59,929 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:48:59,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:48:59,930 INFO L225 Difference]: With dead ends: 364 [2024-11-07 19:48:59,930 INFO L226 Difference]: Without dead ends: 162 [2024-11-07 19:48:59,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:48:59,932 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 4 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 339 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:48:59,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 339 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:48:59,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-07 19:48:59,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-07 19:48:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 137 states have (on average 1.3722627737226278) internal successors, (188), 151 states have internal predecessors, (188), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:48:59,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2024-11-07 19:48:59,944 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 200 transitions. Word has length 17 [2024-11-07 19:48:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:48:59,944 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-11-07 19:48:59,944 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:48:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 200 transitions. [2024-11-07 19:48:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 19:48:59,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:48:59,945 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:48:59,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:48:59,946 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:48:59,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:48:59,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1583572215, now seen corresponding path program 1 times [2024-11-07 19:48:59,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:48:59,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028478478] [2024-11-07 19:48:59,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:48:59,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:48:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:59,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:48:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:48:59,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:48:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:00,002 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:00,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:00,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028478478] [2024-11-07 19:49:00,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028478478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:00,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:00,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:00,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903368336] [2024-11-07 19:49:00,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:00,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:49:00,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:00,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:49:00,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:00,004 INFO L87 Difference]: Start difference. First operand 162 states and 200 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:00,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:00,128 INFO L93 Difference]: Finished difference Result 170 states and 207 transitions. [2024-11-07 19:49:00,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:49:00,128 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:00,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:00,129 INFO L225 Difference]: With dead ends: 170 [2024-11-07 19:49:00,129 INFO L226 Difference]: Without dead ends: 167 [2024-11-07 19:49:00,130 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:00,130 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 134 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:00,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 389 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:49:00,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-07 19:49:00,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2024-11-07 19:49:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 137 states have (on average 1.3576642335766422) internal successors, (186), 149 states have internal predecessors, (186), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:49:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 198 transitions. [2024-11-07 19:49:00,138 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 198 transitions. Word has length 24 [2024-11-07 19:49:00,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:00,138 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 198 transitions. [2024-11-07 19:49:00,138 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:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 198 transitions. [2024-11-07 19:49:00,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 19:49:00,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:00,139 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:00,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 19:49:00,140 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:49:00,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:00,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1554944859, now seen corresponding path program 1 times [2024-11-07 19:49:00,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:00,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075771552] [2024-11-07 19:49:00,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:00,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:00,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:00,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:49:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:00,205 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:00,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075771552] [2024-11-07 19:49:00,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075771552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:00,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:00,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:00,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396787272] [2024-11-07 19:49:00,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:00,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:49:00,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:00,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:49:00,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:00,208 INFO L87 Difference]: Start difference. First operand 160 states and 198 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:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:00,311 INFO L93 Difference]: Finished difference Result 169 states and 207 transitions. [2024-11-07 19:49:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:49:00,312 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:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:00,313 INFO L225 Difference]: With dead ends: 169 [2024-11-07 19:49:00,313 INFO L226 Difference]: Without dead ends: 167 [2024-11-07 19:49:00,314 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:00,314 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 138 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:00,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 396 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:49:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-07 19:49:00,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 149. [2024-11-07 19:49:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 128 states have (on average 1.3515625) internal successors, (173), 138 states have internal predecessors, (173), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:49:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 185 transitions. [2024-11-07 19:49:00,324 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 185 transitions. Word has length 24 [2024-11-07 19:49:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:00,324 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 185 transitions. [2024-11-07 19:49:00,324 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:00,325 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 185 transitions. [2024-11-07 19:49:00,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 19:49:00,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:00,325 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:00,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 19:49:00,326 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:49:00,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:00,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1623890454, now seen corresponding path program 1 times [2024-11-07 19:49:00,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:00,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811516654] [2024-11-07 19:49:00,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:00,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:49:00,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:49:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:49:00,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:49:00,349 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:49:00,352 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-07 19:49:00,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-07 19:49:00,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-07 19:49:00,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-07 19:49:00,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-07 19:49:00,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-07 19:49:00,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-07 19:49:00,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-07 19:49:00,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-07 19:49:00,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-07 19:49:00,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-07 19:49:00,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-07 19:49:00,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-07 19:49:00,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-07 19:49:00,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-07 19:49:00,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-07 19:49:00,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-07 19:49:00,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-07 19:49:00,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-07 19:49:00,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-07 19:49:00,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-07 19:49:00,356 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-07 19:49:00,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 19:49:00,359 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:00,381 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:49:00,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:49:00 BoogieIcfgContainer [2024-11-07 19:49:00,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:49:00,384 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:49:00,384 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:49:00,384 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:49:00,385 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:48:56" (3/4) ... [2024-11-07 19:49:00,387 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:49:00,387 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:49:00,388 INFO L158 Benchmark]: Toolchain (without parser) took 4528.73ms. Allocated memory is still 100.7MB. Free memory was 77.3MB in the beginning and 48.3MB in the end (delta: 29.0MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2024-11-07 19:49:00,388 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:00,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.93ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 63.1MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:49:00,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.04ms. Allocated memory is still 100.7MB. Free memory was 63.1MB in the beginning and 61.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:00,389 INFO L158 Benchmark]: Boogie Preprocessor took 52.93ms. Allocated memory is still 100.7MB. Free memory was 61.1MB in the beginning and 59.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:00,389 INFO L158 Benchmark]: RCFGBuilder took 685.04ms. Allocated memory is still 100.7MB. Free memory was 59.0MB in the beginning and 70.8MB in the end (delta: -11.8MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2024-11-07 19:49:00,389 INFO L158 Benchmark]: TraceAbstraction took 3489.56ms. Allocated memory is still 100.7MB. Free memory was 70.3MB in the beginning and 48.3MB in the end (delta: 22.0MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-11-07 19:49:00,389 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 100.7MB. Free memory was 48.3MB in the beginning and 48.3MB in the end (delta: 14.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:00,391 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.93ms. Allocated memory is still 100.7MB. Free memory was 77.1MB in the beginning and 63.1MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.04ms. Allocated memory is still 100.7MB. Free memory was 63.1MB in the beginning and 61.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.93ms. Allocated memory is still 100.7MB. Free memory was 61.1MB in the beginning and 59.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 685.04ms. Allocated memory is still 100.7MB. Free memory was 59.0MB in the beginning and 70.8MB in the end (delta: -11.8MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3489.56ms. Allocated memory is still 100.7MB. Free memory was 70.3MB in the beginning and 48.3MB in the end (delta: 22.0MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 100.7MB. Free memory was 48.3MB in the beginning and 48.3MB in the end (delta: 14.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; VAL [ea=0, eb=0] [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L251] RET, EXPR base2flt(0, 0) VAL [ea=0, eb=0] [L251] zero = base2flt(0, 0) [L252] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0] [L76] m = m & ~ (1U << 24U) [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 748 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 726 mSDsluCounter, 3818 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2355 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 702 IncrementalHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 1463 mSDtfsCounter, 702 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 129 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 270 NumberOfCodeBlocks, 270 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 156 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 35/45 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 19:49:00,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_1-3.c.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.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 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:49:02,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:49:02,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-11-07 19:49:02,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:49:02,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:49:02,701 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:49:02,702 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:49:02,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:49:02,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:49:02,702 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:49:02,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:49:02,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:49:02,704 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:49:02,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:49:02,704 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:49:02,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:49:02,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 19:49:02,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:49:02,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:49:02,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:49:02,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 19:49:02,705 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:49:02,705 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 19:49:02,705 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:49:02,705 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:49:02,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:49:02,706 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 19:49:02,706 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:49:02,706 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:49:02,706 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:49:02,706 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 19:49:02,706 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:49:02,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:49:02,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:49:02,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:49:02,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:49:02,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:49:02,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:49:02,708 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:49:02,708 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 19:49:02,708 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:49:02,708 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:49:02,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:49:02,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:49:02,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:49:02,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:49:02,708 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 -> 94f477eb9e1d39767903bc1f4d97616f290c342b1e9705cced3715d26576f911 [2024-11-07 19:49:03,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:49:03,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:49:03,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:49:03,025 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:49:03,025 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:49:03,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2024-11-07 19:49:04,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:49:04,537 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:49:04,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-3.c.cil.c [2024-11-07 19:49:04,554 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e08b7e86b/0a8090fae0344282bf0ce5a59e05382a/FLAG6e63aed19 [2024-11-07 19:49:04,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e08b7e86b/0a8090fae0344282bf0ce5a59e05382a [2024-11-07 19:49:04,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:49:04,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:49:04,579 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:49:04,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:49:04,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:49:04,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:49:04" (1/1) ... [2024-11-07 19:49:04,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6e770b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:04, skipping insertion in model container [2024-11-07 19:49:04,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:49:04" (1/1) ... [2024-11-07 19:49:04,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:49:04,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:49:04,826 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:49:04,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:49:04,879 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:49:04,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:04 WrapperNode [2024-11-07 19:49:04,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:49:04,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:49:04,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:49:04,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:49:04,886 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:04" (1/1) ... [2024-11-07 19:49:04,898 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:04" (1/1) ... [2024-11-07 19:49:04,921 INFO L138 Inliner]: procedures = 17, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 168 [2024-11-07 19:49:04,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:49:04,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:49:04,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:49:04,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:49:04,932 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:04" (1/1) ... [2024-11-07 19:49:04,933 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:04" (1/1) ... [2024-11-07 19:49:04,937 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:04" (1/1) ... [2024-11-07 19:49:04,964 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:04,964 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:04" (1/1) ... [2024-11-07 19:49:04,964 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:04" (1/1) ... [2024-11-07 19:49:04,974 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:04" (1/1) ... [2024-11-07 19:49:04,982 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:04" (1/1) ... [2024-11-07 19:49:04,985 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:04" (1/1) ... [2024-11-07 19:49:04,989 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:04" (1/1) ... [2024-11-07 19:49:04,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:49:04,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:49:04,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:49:04,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:49:04,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:04" (1/1) ... [2024-11-07 19:49:05,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:49:05,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:05,032 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:05,035 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:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:49:05,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:49:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-07 19:49:05,058 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-07 19:49:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:49:05,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:49:05,058 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 19:49:05,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 19:49:05,134 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:49:05,136 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:49:05,532 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2024-11-07 19:49:05,532 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:49:05,541 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:49:05,542 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 19:49:05,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:49:05 BoogieIcfgContainer [2024-11-07 19:49:05,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:49:05,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:49:05,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:49:05,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:49:05,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:49:04" (1/3) ... [2024-11-07 19:49:05,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2a2fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:49:05, skipping insertion in model container [2024-11-07 19:49:05,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:04" (2/3) ... [2024-11-07 19:49:05,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2a2fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:49:05, skipping insertion in model container [2024-11-07 19:49:05,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:49:05" (3/3) ... [2024-11-07 19:49:05,553 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-3.c.cil.c [2024-11-07 19:49:05,567 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:49:05,567 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-07 19:49:05,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:49:05,626 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;@6d76140b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:49:05,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-07 19:49:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 81 states have (on average 1.691358024691358) internal successors, (137), 105 states have internal predecessors, (137), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 19:49:05,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 19:49:05,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:05,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:05,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:49:05,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1889192987, now seen corresponding path program 1 times [2024-11-07 19:49:05,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:49:05,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366406464] [2024-11-07 19:49:05,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:05,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:49:05,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:49:05,654 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:49:05,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 19:49:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:05,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 19:49:05,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:05,740 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:05,741 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:05,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:49:05,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366406464] [2024-11-07 19:49:05,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366406464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:05,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:05,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:49:05,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482759811] [2024-11-07 19:49:05,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:05,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 19:49:05,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:49:05,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 19:49:05,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 19:49:05,770 INFO L87 Difference]: Start difference. First operand has 115 states, 81 states have (on average 1.691358024691358) internal successors, (137), 105 states have internal predecessors, (137), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 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:05,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:05,802 INFO L93 Difference]: Finished difference Result 217 states and 314 transitions. [2024-11-07 19:49:05,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 19:49:05,804 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 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:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:05,811 INFO L225 Difference]: With dead ends: 217 [2024-11-07 19:49:05,811 INFO L226 Difference]: Without dead ends: 77 [2024-11-07 19:49:05,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 19:49:05,820 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:05,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:05,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-07 19:49:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-07 19:49:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 68 states have internal predecessors, (80), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:49:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2024-11-07 19:49:05,866 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 9 [2024-11-07 19:49:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:05,867 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2024-11-07 19:49:05,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 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:05,867 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2024-11-07 19:49:05,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 19:49:05,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:05,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:05,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 19:49:06,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:49:06,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:49:06,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:06,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1888251721, now seen corresponding path program 1 times [2024-11-07 19:49:06,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:49:06,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936384935] [2024-11-07 19:49:06,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:06,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:49:06,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:49:06,075 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:49:06,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 19:49:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:06,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:49:06,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:06,158 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:06,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:06,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:49:06,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936384935] [2024-11-07 19:49:06,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936384935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:06,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:06,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:06,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021600583] [2024-11-07 19:49:06,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:06,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:49:06,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:49:06,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:49:06,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:49:06,161 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand has 4 states, 4 states have (on average 2.0) 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:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:06,226 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2024-11-07 19:49:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:49:06,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) 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:06,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:06,228 INFO L225 Difference]: With dead ends: 156 [2024-11-07 19:49:06,228 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 19:49:06,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:06,229 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 4 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:06,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 254 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 19:49:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 19:49:06,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.4) internal successors, (84), 72 states have internal predecessors, (84), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:49:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2024-11-07 19:49:06,240 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 9 [2024-11-07 19:49:06,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:06,240 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2024-11-07 19:49:06,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) 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:06,240 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2024-11-07 19:49:06,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 19:49:06,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:06,241 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:06,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 19:49:06,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:49:06,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:49:06,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:06,442 INFO L85 PathProgramCache]: Analyzing trace with hash 387457081, now seen corresponding path program 1 times [2024-11-07 19:49:06,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:49:06,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799268390] [2024-11-07 19:49:06,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:06,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:49:06,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:49:06,445 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:49:06,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 19:49:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:06,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:49:06,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 19:49:06,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:06,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:49:06,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799268390] [2024-11-07 19:49:06,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799268390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:06,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:06,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:49:06,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047139071] [2024-11-07 19:49:06,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:06,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:49:06,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:49:06,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:49:06,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:06,498 INFO L87 Difference]: Start difference. First operand 82 states and 96 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, (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:06,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:06,561 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2024-11-07 19:49:06,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:49:06,562 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, (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 16 [2024-11-07 19:49:06,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:06,563 INFO L225 Difference]: With dead ends: 82 [2024-11-07 19:49:06,563 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 19:49:06,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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:06,564 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:06,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 161 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:06,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 19:49:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-07 19:49:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 71 states have internal predecessors, (83), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:49:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2024-11-07 19:49:06,577 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 16 [2024-11-07 19:49:06,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:06,578 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2024-11-07 19:49:06,578 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, (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:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2024-11-07 19:49:06,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 19:49:06,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:06,580 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:06,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-07 19:49:06,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:49:06,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:49:06,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:06,782 INFO L85 PathProgramCache]: Analyzing trace with hash -428450015, now seen corresponding path program 1 times [2024-11-07 19:49:06,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:49:06,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253848128] [2024-11-07 19:49:06,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:06,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:49:06,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:49:06,785 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:49:06,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 19:49:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:06,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:49:06,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:06,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 19:49:06,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:06,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:49:06,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253848128] [2024-11-07 19:49:06,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253848128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:06,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:06,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:49:06,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267623765] [2024-11-07 19:49:06,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:06,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:49:06,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:49:06,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:49:06,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:06,841 INFO L87 Difference]: Start difference. First operand 81 states and 95 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, (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:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:06,876 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2024-11-07 19:49:06,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:49:06,880 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, (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 18 [2024-11-07 19:49:06,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:06,881 INFO L225 Difference]: With dead ends: 81 [2024-11-07 19:49:06,883 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 19:49:06,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:06,884 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:06,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 19:49:06,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-07 19:49:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 70 states have internal predecessors, (82), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:49:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-11-07 19:49:06,899 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 18 [2024-11-07 19:49:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:06,899 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-07 19:49:06,900 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, (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:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-11-07 19:49:06,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 19:49:06,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:06,900 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:06,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-07 19:49:07,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:49:07,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:49:07,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:07,102 INFO L85 PathProgramCache]: Analyzing trace with hash -428382489, now seen corresponding path program 1 times [2024-11-07 19:49:07,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:49:07,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069689610] [2024-11-07 19:49:07,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:07,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:49:07,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:49:07,104 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:49:07,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 19:49:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:07,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:49:07,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:07,212 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:07,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:07,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:49:07,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069689610] [2024-11-07 19:49:07,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069689610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:07,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:07,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:49:07,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284899966] [2024-11-07 19:49:07,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:07,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:49:07,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:49:07,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:49:07,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:49:07,213 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:07,443 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2024-11-07 19:49:07,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:49:07,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2024-11-07 19:49:07,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:07,446 INFO L225 Difference]: With dead ends: 101 [2024-11-07 19:49:07,446 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 19:49:07,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:07,447 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 65 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:07,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 190 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 19:49:07,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 19:49:07,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2024-11-07 19:49:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 77 states have internal predecessors, (90), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 19:49:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2024-11-07 19:49:07,463 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 18 [2024-11-07 19:49:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:07,466 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2024-11-07 19:49:07,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:07,467 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2024-11-07 19:49:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 19:49:07,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:07,467 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] [2024-11-07 19:49:07,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-07 19:49:07,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:49:07,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-07 19:49:07,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1594791038, now seen corresponding path program 1 times [2024-11-07 19:49:07,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:49:07,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385523215] [2024-11-07 19:49:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:07,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:49:07,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:49:07,671 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 19:49:07,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 19:49:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:49:07,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:49:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:49:07,739 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 19:49:07,739 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:49:07,740 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-07 19:49:07,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-07 19:49:07,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-07 19:49:07,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-07 19:49:07,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-07 19:49:07,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-07 19:49:07,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-07 19:49:07,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-07 19:49:07,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-07 19:49:07,742 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-07 19:49:07,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-07 19:49:07,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-07 19:49:07,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-07 19:49:07,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-07 19:49:07,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-07 19:49:07,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-07 19:49:07,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-07 19:49:07,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-07 19:49:07,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-07 19:49:07,743 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-07 19:49:07,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-07 19:49:07,744 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-07 19:49:07,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-07 19:49:07,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 19:49:07,946 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 19:49:07,969 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:49:07,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:49:07 BoogieIcfgContainer [2024-11-07 19:49:07,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:49:07,974 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:49:07,974 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:49:07,974 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:49:07,975 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:49:05" (3/4) ... [2024-11-07 19:49:07,975 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 19:49:08,012 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 19:49:08,012 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:49:08,013 INFO L158 Benchmark]: Toolchain (without parser) took 3435.50ms. Allocated memory is still 83.9MB. Free memory was 60.6MB in the beginning and 39.2MB in the end (delta: 21.4MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-07 19:49:08,013 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 65.1MB in the beginning and 65.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:08,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.67ms. Allocated memory is still 83.9MB. Free memory was 60.6MB in the beginning and 45.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:49:08,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.67ms. Allocated memory is still 83.9MB. Free memory was 45.9MB in the beginning and 44.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:08,014 INFO L158 Benchmark]: Boogie Preprocessor took 73.62ms. Allocated memory is still 83.9MB. Free memory was 44.2MB in the beginning and 42.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:08,014 INFO L158 Benchmark]: RCFGBuilder took 545.03ms. Allocated memory is still 83.9MB. Free memory was 42.2MB in the beginning and 58.8MB in the end (delta: -16.6MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2024-11-07 19:49:08,014 INFO L158 Benchmark]: TraceAbstraction took 2428.67ms. Allocated memory is still 83.9MB. Free memory was 58.1MB in the beginning and 41.2MB in the end (delta: 16.9MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-11-07 19:49:08,014 INFO L158 Benchmark]: Witness Printer took 38.51ms. Allocated memory is still 83.9MB. Free memory was 41.2MB in the beginning and 39.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:08,018 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory was 65.1MB in the beginning and 65.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.67ms. Allocated memory is still 83.9MB. Free memory was 60.6MB in the beginning and 45.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.67ms. Allocated memory is still 83.9MB. Free memory was 45.9MB in the beginning and 44.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.62ms. Allocated memory is still 83.9MB. Free memory was 44.2MB in the beginning and 42.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 545.03ms. Allocated memory is still 83.9MB. Free memory was 42.2MB in the beginning and 58.8MB in the end (delta: -16.6MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2428.67ms. Allocated memory is still 83.9MB. Free memory was 58.1MB in the beginning and 41.2MB in the end (delta: 16.9MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * Witness Printer took 38.51ms. Allocated memory is still 83.9MB. Free memory was 41.2MB in the beginning and 39.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 77]: integer overflow possible integer overflow possible We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add ; [L233] unsigned int zero ; [L234] int sa ; [L235] int sb ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int tmp___1 ; [L239] int tmp___2 ; [L240] int tmp___3 ; [L241] int tmp___4 ; [L242] int tmp___5 ; [L243] int tmp___6 ; [L244] int tmp___7 ; [L245] int tmp___8 ; [L246] int tmp___9 ; [L247] int __retres23 ; [L251] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L251] RET, EXPR base2flt(0, 0) [L251] zero = base2flt(0, 0) [L252] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=16777216, e=0, m=0] [L77] (e + 128) << 24U VAL [\old(e)=0, \old(m)=16777216, m=0] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 109]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 112]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 115]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 133]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 141]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 115 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 905 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 427 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 478 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 65 ConstructedInterpolants, 8 QuantifiedInterpolants, 110 SizeOfPredicates, 2 NumberOfNonLiveVariables, 160 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-07 19:49:08,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)