./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-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_4-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', 'bd1e20a7a2bac41d4f53b8467ce4dcd444e356387bd290a75ef99d78cf8ebeb3'] 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_4-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 bd1e20a7a2bac41d4f53b8467ce4dcd444e356387bd290a75ef99d78cf8ebeb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:48:59,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:48:59,792 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:59,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:48:59,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:48:59,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:48:59,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:48:59,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:48:59,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:48:59,828 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:48:59,828 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:48:59,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:48:59,829 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:48:59,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:48:59,830 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:48:59,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:48:59,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 19:48:59,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:48:59,830 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 19:48:59,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:48:59,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:48:59,830 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 19:48:59,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:48:59,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 19:48:59,831 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:48:59,831 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 19:48:59,831 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:48:59,831 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:48:59,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 19:48:59,831 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:48:59,831 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:48:59,831 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:48:59,831 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:48:59,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:48:59,831 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:48:59,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:48:59,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:48:59,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 19:48:59,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 19:48:59,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 19:48:59,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:48:59,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:48:59,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:48:59,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:48:59,832 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 -> bd1e20a7a2bac41d4f53b8467ce4dcd444e356387bd290a75ef99d78cf8ebeb3 [2024-11-07 19:49:00,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:49:00,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:49:00,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:49:00,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:49:00,126 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:49:00,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3.c.cil.c [2024-11-07 19:49:01,433 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:49:01,646 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:49:01,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3.c.cil.c [2024-11-07 19:49:01,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63c03d208/f234efd5ad7d451a84f38a1fcf9b58a4/FLAG6aedc7869 [2024-11-07 19:49:02,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/63c03d208/f234efd5ad7d451a84f38a1fcf9b58a4 [2024-11-07 19:49:02,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:49:02,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:49:02,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:49:02,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:49:02,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:49:02,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:49:02" (1/1) ... [2024-11-07 19:49:02,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@399868c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:02, skipping insertion in model container [2024-11-07 19:49:02,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:49:02" (1/1) ... [2024-11-07 19:49:02,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:49:02,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:49:02,190 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:49:02,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:49:02,240 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:49:02,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:02 WrapperNode [2024-11-07 19:49:02,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:49:02,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:49:02,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:49:02,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:49:02,250 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:02" (1/1) ... [2024-11-07 19:49:02,262 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:02" (1/1) ... [2024-11-07 19:49:02,288 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2024-11-07 19:49:02,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:49:02,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:49:02,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:49:02,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:49:02,299 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:02" (1/1) ... [2024-11-07 19:49:02,300 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:02" (1/1) ... [2024-11-07 19:49:02,303 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:02" (1/1) ... [2024-11-07 19:49:02,327 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:02,327 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:02" (1/1) ... [2024-11-07 19:49:02,327 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:02" (1/1) ... [2024-11-07 19:49:02,332 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:02" (1/1) ... [2024-11-07 19:49:02,341 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:02" (1/1) ... [2024-11-07 19:49:02,343 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:02" (1/1) ... [2024-11-07 19:49:02,347 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:02" (1/1) ... [2024-11-07 19:49:02,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:49:02,349 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:49:02,350 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:49:02,350 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:49:02,351 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:02" (1/1) ... [2024-11-07 19:49:02,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:49:02,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:02,387 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:02,392 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:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:49:02,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 19:49:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-07 19:49:02,420 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-07 19:49:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:49:02,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:49:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-07 19:49:02,421 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-07 19:49:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 19:49:02,421 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 19:49:02,495 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:49:02,497 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:49:02,880 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-11-07 19:49:02,880 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:49:02,893 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:49:02,894 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 19:49:02,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:49:02 BoogieIcfgContainer [2024-11-07 19:49:02,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:49:02,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:49:02,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:49:02,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:49:02,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:49:02" (1/3) ... [2024-11-07 19:49:02,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea5b745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:49:02, skipping insertion in model container [2024-11-07 19:49:02,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:02" (2/3) ... [2024-11-07 19:49:02,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea5b745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:49:02, skipping insertion in model container [2024-11-07 19:49:02,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:49:02" (3/3) ... [2024-11-07 19:49:02,904 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3.c.cil.c [2024-11-07 19:49:02,917 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:49:02,917 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-07 19:49:02,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:49:02,985 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;@38f6797f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:49:02,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-07 19:49:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 86 states have (on average 1.6162790697674418) internal successors, (139), 108 states have internal predecessors, (139), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 19:49:02,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 19:49:02,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:03,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:03,000 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:49:03,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:03,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1043008487, now seen corresponding path program 1 times [2024-11-07 19:49:03,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:03,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201288324] [2024-11-07 19:49:03,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:03,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:03,228 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:03,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:03,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201288324] [2024-11-07 19:49:03,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201288324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:03,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:03,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:49:03,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640756135] [2024-11-07 19:49:03,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:03,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:49:03,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:03,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:49:03,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:49:03,254 INFO L87 Difference]: Start difference. First operand has 121 states, 86 states have (on average 1.6162790697674418) internal successors, (139), 108 states have internal predecessors, (139), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 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:49:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:03,394 INFO L93 Difference]: Finished difference Result 293 states and 408 transitions. [2024-11-07 19:49:03,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:49:03,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-07 19:49:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:03,406 INFO L225 Difference]: With dead ends: 293 [2024-11-07 19:49:03,407 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 19:49:03,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:03,413 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 90 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 390 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:49:03,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 390 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:49:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 19:49:03,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 153. [2024-11-07 19:49:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 123 states have (on average 1.5040650406504066) internal successors, (185), 141 states have internal predecessors, (185), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 200 transitions. [2024-11-07 19:49:03,466 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 200 transitions. Word has length 9 [2024-11-07 19:49:03,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:03,466 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 200 transitions. [2024-11-07 19:49:03,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:03,466 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 200 transitions. [2024-11-07 19:49:03,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 19:49:03,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:03,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:03,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 19:49:03,468 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:49:03,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:03,468 INFO L85 PathProgramCache]: Analyzing trace with hash -821190777, now seen corresponding path program 1 times [2024-11-07 19:49:03,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:03,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973238794] [2024-11-07 19:49:03,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:03,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:03,547 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:03,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:03,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973238794] [2024-11-07 19:49:03,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973238794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:03,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:03,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:49:03,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425581714] [2024-11-07 19:49:03,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:03,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:49:03,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:03,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:49:03,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:03,550 INFO L87 Difference]: Start difference. First operand 153 states and 200 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:03,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:03,617 INFO L93 Difference]: Finished difference Result 289 states and 376 transitions. [2024-11-07 19:49:03,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:49:03,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-07 19:49:03,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:03,620 INFO L225 Difference]: With dead ends: 289 [2024-11-07 19:49:03,620 INFO L226 Difference]: Without dead ends: 167 [2024-11-07 19:49:03,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:03,621 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 12 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:03,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 239 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:03,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-07 19:49:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 157. [2024-11-07 19:49:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 127 states have (on average 1.4881889763779528) internal successors, (189), 145 states have internal predecessors, (189), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 204 transitions. [2024-11-07 19:49:03,646 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 204 transitions. Word has length 14 [2024-11-07 19:49:03,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:03,646 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 204 transitions. [2024-11-07 19:49:03,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 204 transitions. [2024-11-07 19:49:03,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 19:49:03,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:03,647 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:03,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 19:49:03,647 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:03,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:03,648 INFO L85 PathProgramCache]: Analyzing trace with hash -821302123, now seen corresponding path program 1 times [2024-11-07 19:49:03,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:03,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734821301] [2024-11-07 19:49:03,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:03,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-07 19:49:03,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:03,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734821301] [2024-11-07 19:49:03,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734821301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:03,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:03,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:49:03,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092678433] [2024-11-07 19:49:03,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:03,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:49:03,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:03,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:49:03,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:03,715 INFO L87 Difference]: Start difference. First operand 157 states and 204 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:03,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:03,763 INFO L93 Difference]: Finished difference Result 157 states and 204 transitions. [2024-11-07 19:49:03,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:49:03,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-07 19:49:03,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:03,767 INFO L225 Difference]: With dead ends: 157 [2024-11-07 19:49:03,767 INFO L226 Difference]: Without dead ends: 156 [2024-11-07 19:49:03,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:03,769 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:03,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 232 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:03,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-07 19:49:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-07 19:49:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 127 states have (on average 1.4724409448818898) internal successors, (187), 144 states have internal predecessors, (187), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:03,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 202 transitions. [2024-11-07 19:49:03,789 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 202 transitions. Word has length 14 [2024-11-07 19:49:03,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:03,789 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 202 transitions. [2024-11-07 19:49:03,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:03,789 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 202 transitions. [2024-11-07 19:49:03,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 19:49:03,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:03,790 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:03,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 19:49:03,790 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:49:03,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1305833913, now seen corresponding path program 1 times [2024-11-07 19:49:03,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:03,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308462549] [2024-11-07 19:49:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:03,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:03,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:03,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308462549] [2024-11-07 19:49:03,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308462549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:49:03,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752301324] [2024-11-07 19:49:03,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:03,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:03,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:03,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:49:03,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 19:49:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:03,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:49:03,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:03,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:03,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752301324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:03,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 19:49:03,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-07 19:49:03,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871429280] [2024-11-07 19:49:03,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:03,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:49:03,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:03,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:49:03,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:49:03,997 INFO L87 Difference]: Start difference. First operand 156 states and 202 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:04,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:04,100 INFO L93 Difference]: Finished difference Result 182 states and 242 transitions. [2024-11-07 19:49:04,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:49:04,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-07 19:49:04,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:04,102 INFO L225 Difference]: With dead ends: 182 [2024-11-07 19:49:04,102 INFO L226 Difference]: Without dead ends: 180 [2024-11-07 19:49:04,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:49:04,104 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 25 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 337 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:49:04,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 337 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:49:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-07 19:49:04,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 163. [2024-11-07 19:49:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 134 states have (on average 1.4477611940298507) internal successors, (194), 151 states have internal predecessors, (194), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:04,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 209 transitions. [2024-11-07 19:49:04,123 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 209 transitions. Word has length 15 [2024-11-07 19:49:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:04,124 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 209 transitions. [2024-11-07 19:49:04,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:04,124 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 209 transitions. [2024-11-07 19:49:04,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-07 19:49:04,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:04,124 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:04,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 19:49:04,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:04,325 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:49:04,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:04,326 INFO L85 PathProgramCache]: Analyzing trace with hash 309438020, now seen corresponding path program 1 times [2024-11-07 19:49:04,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:04,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346661334] [2024-11-07 19:49:04,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:04,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:04,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:04,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346661334] [2024-11-07 19:49:04,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346661334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:49:04,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201893792] [2024-11-07 19:49:04,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:04,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:04,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:04,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:49:04,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 19:49:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:04,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:49:04,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:04,477 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:04,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201893792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:04,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 19:49:04,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-07 19:49:04,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421207329] [2024-11-07 19:49:04,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:04,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:49:04,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:04,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:49:04,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:49:04,479 INFO L87 Difference]: Start difference. First operand 163 states and 209 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:04,537 INFO L93 Difference]: Finished difference Result 169 states and 217 transitions. [2024-11-07 19:49:04,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:49:04,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-07 19:49:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:04,540 INFO L225 Difference]: With dead ends: 169 [2024-11-07 19:49:04,540 INFO L226 Difference]: Without dead ends: 168 [2024-11-07 19:49:04,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 19:49:04,541 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 17 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:04,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 223 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-07 19:49:04,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 165. [2024-11-07 19:49:04,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 136 states have (on average 1.4411764705882353) internal successors, (196), 153 states have internal predecessors, (196), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:04,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 211 transitions. [2024-11-07 19:49:04,559 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 211 transitions. Word has length 15 [2024-11-07 19:49:04,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:04,560 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 211 transitions. [2024-11-07 19:49:04,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:04,560 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 211 transitions. [2024-11-07 19:49:04,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 19:49:04,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:04,563 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:04,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 19:49:04,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:04,763 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:49:04,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:04,764 INFO L85 PathProgramCache]: Analyzing trace with hash 443744229, now seen corresponding path program 1 times [2024-11-07 19:49:04,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:04,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340295490] [2024-11-07 19:49:04,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:04,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:04,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:04,838 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:04,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:04,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340295490] [2024-11-07 19:49:04,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340295490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:04,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:04,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:04,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578828100] [2024-11-07 19:49:04,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:04,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:49:04,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:04,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:49:04,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:04,840 INFO L87 Difference]: Start difference. First operand 165 states and 211 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:49:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:04,965 INFO L93 Difference]: Finished difference Result 234 states and 299 transitions. [2024-11-07 19:49:04,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:49:04,965 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:49:04,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:04,968 INFO L225 Difference]: With dead ends: 234 [2024-11-07 19:49:04,969 INFO L226 Difference]: Without dead ends: 230 [2024-11-07 19:49:04,969 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:49:04,970 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 85 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 422 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:49:04,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 422 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:49:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-07 19:49:04,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 213. [2024-11-07 19:49:04,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 184 states have (on average 1.4293478260869565) internal successors, (263), 200 states have internal predecessors, (263), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:04,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 278 transitions. [2024-11-07 19:49:04,986 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 278 transitions. Word has length 17 [2024-11-07 19:49:04,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:04,986 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 278 transitions. [2024-11-07 19:49:04,986 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:49:04,986 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 278 transitions. [2024-11-07 19:49:04,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 19:49:04,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:04,990 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:04,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 19:49:04,990 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:49:04,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:04,991 INFO L85 PathProgramCache]: Analyzing trace with hash 415116873, now seen corresponding path program 1 times [2024-11-07 19:49:04,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:04,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563377753] [2024-11-07 19:49:04,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:04,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:05,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:05,058 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:05,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:05,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563377753] [2024-11-07 19:49:05,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563377753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:05,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:05,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:05,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787910861] [2024-11-07 19:49:05,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:05,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:49:05,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:05,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:49:05,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:05,060 INFO L87 Difference]: Start difference. First operand 213 states and 278 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:49:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:05,157 INFO L93 Difference]: Finished difference Result 235 states and 300 transitions. [2024-11-07 19:49:05,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:49:05,158 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:49:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:05,160 INFO L225 Difference]: With dead ends: 235 [2024-11-07 19:49:05,160 INFO L226 Difference]: Without dead ends: 232 [2024-11-07 19:49:05,160 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:49:05,161 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 87 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 422 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:49:05,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 422 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 19:49:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-07 19:49:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 211. [2024-11-07 19:49:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 183 states have (on average 1.3989071038251366) internal successors, (256), 198 states have internal predecessors, (256), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:05,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 271 transitions. [2024-11-07 19:49:05,172 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 271 transitions. Word has length 17 [2024-11-07 19:49:05,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:05,172 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 271 transitions. [2024-11-07 19:49:05,172 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:49:05,172 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 271 transitions. [2024-11-07 19:49:05,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 19:49:05,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:05,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:05,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 19:49:05,174 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:49:05,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1730858885, now seen corresponding path program 1 times [2024-11-07 19:49:05,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:05,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327559643] [2024-11-07 19:49:05,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:05,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:05,201 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,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:05,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327559643] [2024-11-07 19:49:05,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327559643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:05,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:05,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:49:05,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208978685] [2024-11-07 19:49:05,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:05,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:49:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:05,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:49:05,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:05,203 INFO L87 Difference]: Start difference. First operand 211 states and 271 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:05,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:05,259 INFO L93 Difference]: Finished difference Result 399 states and 510 transitions. [2024-11-07 19:49:05,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:49:05,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-07 19:49:05,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:05,261 INFO L225 Difference]: With dead ends: 399 [2024-11-07 19:49:05,261 INFO L226 Difference]: Without dead ends: 222 [2024-11-07 19:49:05,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:05,262 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:05,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 235 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:05,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-07 19:49:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 212. [2024-11-07 19:49:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 184 states have (on average 1.3695652173913044) internal successors, (252), 199 states have internal predecessors, (252), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 267 transitions. [2024-11-07 19:49:05,273 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 267 transitions. Word has length 16 [2024-11-07 19:49:05,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:05,273 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 267 transitions. [2024-11-07 19:49:05,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:05,274 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 267 transitions. [2024-11-07 19:49:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 19:49:05,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:05,275 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:05,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 19:49:05,275 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:49:05,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:05,275 INFO L85 PathProgramCache]: Analyzing trace with hash -773774157, now seen corresponding path program 1 times [2024-11-07 19:49:05,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:05,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479920162] [2024-11-07 19:49:05,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:05,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:05,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:05,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479920162] [2024-11-07 19:49:05,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479920162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 19:49:05,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425928198] [2024-11-07 19:49:05,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:05,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:05,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:05,333 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 19:49:05,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 19:49:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:05,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:49:05,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:05,404 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:05,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:05,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425928198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:05,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 19:49:05,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-07 19:49:05,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425603318] [2024-11-07 19:49:05,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:05,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:49:05,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:05,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:49:05,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:49:05,406 INFO L87 Difference]: Start difference. First operand 212 states and 267 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:05,462 INFO L93 Difference]: Finished difference Result 226 states and 286 transitions. [2024-11-07 19:49:05,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:49:05,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-07 19:49:05,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:05,464 INFO L225 Difference]: With dead ends: 226 [2024-11-07 19:49:05,464 INFO L226 Difference]: Without dead ends: 225 [2024-11-07 19:49:05,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 19:49:05,465 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 11 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:05,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 238 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:05,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-07 19:49:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 211. [2024-11-07 19:49:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 183 states have (on average 1.360655737704918) internal successors, (249), 198 states have internal predecessors, (249), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 264 transitions. [2024-11-07 19:49:05,477 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 264 transitions. Word has length 17 [2024-11-07 19:49:05,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:05,477 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 264 transitions. [2024-11-07 19:49:05,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:05,477 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 264 transitions. [2024-11-07 19:49:05,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 19:49:05,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:05,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:05,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 19:49:05,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 19:49:05,679 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:49:05,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:05,679 INFO L85 PathProgramCache]: Analyzing trace with hash -526502896, now seen corresponding path program 1 times [2024-11-07 19:49:05,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:05,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537264916] [2024-11-07 19:49:05,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:05,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:05,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:05,761 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,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:05,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537264916] [2024-11-07 19:49:05,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537264916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:05,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:05,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:05,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585725487] [2024-11-07 19:49:05,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:05,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:49:05,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:05,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:49:05,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:49:05,763 INFO L87 Difference]: Start difference. First operand 211 states and 264 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:05,817 INFO L93 Difference]: Finished difference Result 372 states and 465 transitions. [2024-11-07 19:49:05,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:49:05,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-07 19:49:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:05,819 INFO L225 Difference]: With dead ends: 372 [2024-11-07 19:49:05,819 INFO L226 Difference]: Without dead ends: 166 [2024-11-07 19:49:05,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:05,820 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:05,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 357 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 19:49:05,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-07 19:49:05,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-11-07 19:49:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 138 states have (on average 1.3840579710144927) internal successors, (191), 153 states have internal predecessors, (191), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 206 transitions. [2024-11-07 19:49:05,830 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 206 transitions. Word has length 17 [2024-11-07 19:49:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:05,830 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 206 transitions. [2024-11-07 19:49:05,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 19:49:05,830 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 206 transitions. [2024-11-07 19:49:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 19:49:05,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:05,830 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:05,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 19:49:05,831 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:49:05,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:05,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1029296454, now seen corresponding path program 1 times [2024-11-07 19:49:05,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:05,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315933136] [2024-11-07 19:49:05,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:05,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:05,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:05,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:49:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:05,901 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:05,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:05,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315933136] [2024-11-07 19:49:05,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315933136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:05,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:05,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:05,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770548339] [2024-11-07 19:49:05,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:05,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:49:05,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:05,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:49:05,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:05,903 INFO L87 Difference]: Start difference. First operand 166 states and 206 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:06,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:06,019 INFO L93 Difference]: Finished difference Result 174 states and 213 transitions. [2024-11-07 19:49:06,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:49:06,020 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:06,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:06,021 INFO L225 Difference]: With dead ends: 174 [2024-11-07 19:49:06,022 INFO L226 Difference]: Without dead ends: 171 [2024-11-07 19:49:06,022 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:06,022 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 76 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 473 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:06,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 473 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:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-07 19:49:06,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2024-11-07 19:49:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 138 states have (on average 1.3695652173913044) internal successors, (189), 151 states have internal predecessors, (189), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:06,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 204 transitions. [2024-11-07 19:49:06,032 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 204 transitions. Word has length 24 [2024-11-07 19:49:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:06,032 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 204 transitions. [2024-11-07 19:49:06,032 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:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2024-11-07 19:49:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 19:49:06,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:06,033 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:06,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 19:49:06,034 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:06,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:06,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1057923810, now seen corresponding path program 1 times [2024-11-07 19:49:06,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:06,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791737356] [2024-11-07 19:49:06,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:06,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:06,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-07 19:49:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:06,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-07 19:49:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:06,084 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:06,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 19:49:06,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791737356] [2024-11-07 19:49:06,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791737356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:06,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:06,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:06,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414505624] [2024-11-07 19:49:06,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:06,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 19:49:06,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 19:49:06,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 19:49:06,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 19:49:06,086 INFO L87 Difference]: Start difference. First operand 164 states and 204 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:06,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:06,182 INFO L93 Difference]: Finished difference Result 173 states and 213 transitions. [2024-11-07 19:49:06,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 19:49:06,183 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:06,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:06,184 INFO L225 Difference]: With dead ends: 173 [2024-11-07 19:49:06,184 INFO L226 Difference]: Without dead ends: 171 [2024-11-07 19:49:06,184 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:06,184 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 80 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 480 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:06,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 480 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:06,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-07 19:49:06,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 153. [2024-11-07 19:49:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 129 states have (on average 1.3643410852713178) internal successors, (176), 140 states have internal predecessors, (176), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 191 transitions. [2024-11-07 19:49:06,194 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 191 transitions. Word has length 24 [2024-11-07 19:49:06,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:06,194 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 191 transitions. [2024-11-07 19:49:06,194 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:06,194 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 191 transitions. [2024-11-07 19:49:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-07 19:49:06,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:06,194 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:06,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 19:49:06,195 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:06,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:06,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1477228313, now seen corresponding path program 1 times [2024-11-07 19:49:06,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 19:49:06,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538656493] [2024-11-07 19:49:06,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:06,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 19:49:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:49:06,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:49:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:49:06,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 19:49:06,233 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:49:06,234 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-07 19:49:06,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-07 19:49:06,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-07 19:49:06,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-07 19:49:06,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-07 19:49:06,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-07 19:49:06,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-07 19:49:06,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-07 19:49:06,236 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-07 19:49:06,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-07 19:49:06,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-07 19:49:06,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-07 19:49:06,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-07 19:49:06,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-07 19:49:06,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-07 19:49:06,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-07 19:49:06,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-07 19:49:06,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-07 19:49:06,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-07 19:49:06,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-07 19:49:06,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-07 19:49:06,238 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-07 19:49:06,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 19:49:06,241 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:06,261 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:49:06,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:49:06 BoogieIcfgContainer [2024-11-07 19:49:06,267 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:49:06,267 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:49:06,267 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:49:06,268 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:49:06,268 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:02" (3/4) ... [2024-11-07 19:49:06,270 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 19:49:06,271 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:49:06,272 INFO L158 Benchmark]: Toolchain (without parser) took 4263.75ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.8MB in the beginning and 49.5MB in the end (delta: 42.2MB). Peak memory consumption was 80.8MB. Max. memory is 16.1GB. [2024-11-07 19:49:06,273 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:06,273 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.62ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 78.5MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:49:06,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.81ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 77.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:06,274 INFO L158 Benchmark]: Boogie Preprocessor took 59.64ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 75.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:06,274 INFO L158 Benchmark]: RCFGBuilder took 544.81ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 53.7MB in the end (delta: 21.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:49:06,275 INFO L158 Benchmark]: TraceAbstraction took 3370.81ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 53.2MB in the beginning and 49.6MB in the end (delta: 3.7MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. [2024-11-07 19:49:06,275 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 159.4MB. Free memory was 49.6MB in the beginning and 49.5MB in the end (delta: 32.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:06,276 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.21ms. Allocated memory is still 117.4MB. Free memory is still 81.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.62ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 78.5MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.81ms. Allocated memory is still 117.4MB. Free memory was 78.5MB in the beginning and 77.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.64ms. Allocated memory is still 117.4MB. Free memory was 77.2MB in the beginning and 75.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 544.81ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 53.7MB in the end (delta: 21.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3370.81ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 53.2MB in the beginning and 49.6MB in the end (delta: 3.7MB). Peak memory consumption was 38.9MB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 159.4MB. Free memory was 49.6MB in the beginning and 49.5MB in the end (delta: 32.4kB). 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_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=0, eb=0] [L241] 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] [L241] RET, EXPR base2flt(0, 0) VAL [ea=0, eb=0] [L241] zero = base2flt(0, 0) [L242] 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 4 procedures, 121 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 510 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 4048 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2554 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 681 IncrementalHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 1494 mSDtfsCounter, 681 mSolverCounterSat, 0.0s 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=213occurred 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:06,306 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_4-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 bd1e20a7a2bac41d4f53b8467ce4dcd444e356387bd290a75ef99d78cf8ebeb3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 19:49:08,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 19:49:08,654 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:08,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 19:49:08,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 19:49:08,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 19:49:08,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 19:49:08,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 19:49:08,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 19:49:08,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 19:49:08,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 19:49:08,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 19:49:08,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 19:49:08,691 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 19:49:08,691 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 19:49:08,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 19:49:08,692 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 19:49:08,692 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 19:49:08,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 19:49:08,692 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 19:49:08,692 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 19:49:08,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 19:49:08,693 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 19:49:08,693 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 19:49:08,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 19:49:08,693 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-07 19:49:08,693 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 19:49:08,693 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-07 19:49:08,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 19:49:08,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 19:49:08,694 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 19:49:08,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 19:49:08,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 19:49:08,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 19:49:08,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 19:49:08,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:49:08,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 19:49:08,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 19:49:08,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 19:49:08,695 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 19:49:08,696 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 19:49:08,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 19:49:08,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 19:49:08,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 19:49:08,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 19:49:08,696 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 -> bd1e20a7a2bac41d4f53b8467ce4dcd444e356387bd290a75ef99d78cf8ebeb3 [2024-11-07 19:49:09,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 19:49:09,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 19:49:09,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 19:49:09,190 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 19:49:09,190 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 19:49:09,192 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3.c.cil.c [2024-11-07 19:49:10,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 19:49:10,745 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 19:49:10,746 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3.c.cil.c [2024-11-07 19:49:10,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c960b900/82d31d0fad7f4a36828117ae2ea399c0/FLAG6aad7b0db [2024-11-07 19:49:11,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5c960b900/82d31d0fad7f4a36828117ae2ea399c0 [2024-11-07 19:49:11,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 19:49:11,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 19:49:11,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 19:49:11,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 19:49:11,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 19:49:11,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cd8d7ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11, skipping insertion in model container [2024-11-07 19:49:11,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 19:49:11,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:49:11,306 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 19:49:11,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 19:49:11,350 INFO L204 MainTranslator]: Completed translation [2024-11-07 19:49:11,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11 WrapperNode [2024-11-07 19:49:11,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 19:49:11,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 19:49:11,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 19:49:11,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 19:49:11,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,392 INFO L138 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-07 19:49:11,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 19:49:11,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 19:49:11,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 19:49:11,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 19:49:11,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,419 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 19:49:11,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 19:49:11,439 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 19:49:11,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 19:49:11,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 19:49:11,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (1/1) ... [2024-11-07 19:49:11,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 19:49:11,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 19:49:11,472 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 19:49:11,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 19:49:11,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 19:49:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 19:49:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-07 19:49:11,499 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-07 19:49:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 19:49:11,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 19:49:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-07 19:49:11,499 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-07 19:49:11,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-07 19:49:11,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-07 19:49:11,555 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 19:49:11,557 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 19:49:11,846 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-11-07 19:49:11,846 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 19:49:11,862 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 19:49:11,862 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-07 19:49:11,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:49:11 BoogieIcfgContainer [2024-11-07 19:49:11,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 19:49:11,865 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 19:49:11,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 19:49:11,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 19:49:11,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:49:11" (1/3) ... [2024-11-07 19:49:11,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b11772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:49:11, skipping insertion in model container [2024-11-07 19:49:11,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:49:11" (2/3) ... [2024-11-07 19:49:11,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b11772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:49:11, skipping insertion in model container [2024-11-07 19:49:11,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:49:11" (3/3) ... [2024-11-07 19:49:11,873 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3.c.cil.c [2024-11-07 19:49:11,886 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 19:49:11,886 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-07 19:49:11,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 19:49:11,939 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;@1f738c61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 19:49:11,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-07 19:49:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 84 states have internal predecessors, (102), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 19:49:11,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 19:49:11,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:11,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:11,950 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:11,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:11,954 INFO L85 PathProgramCache]: Analyzing trace with hash -74325512, now seen corresponding path program 1 times [2024-11-07 19:49:11,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:49:11,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048531157] [2024-11-07 19:49:11,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:11,962 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:11,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:49:11,964 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:11,965 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:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:12,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 19:49:12,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:12,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:12,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:49:12,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048531157] [2024-11-07 19:49:12,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048531157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:12,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:12,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-07 19:49:12,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540495610] [2024-11-07 19:49:12,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:12,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 19:49:12,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:49:12,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 19:49:12,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 19:49:12,070 INFO L87 Difference]: Start difference. First operand has 97 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 84 states have internal predecessors, (102), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 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:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:12,112 INFO L93 Difference]: Finished difference Result 181 states and 244 transitions. [2024-11-07 19:49:12,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 19:49:12,117 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:12,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:12,126 INFO L225 Difference]: With dead ends: 181 [2024-11-07 19:49:12,127 INFO L226 Difference]: Without dead ends: 77 [2024-11-07 19:49:12,131 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:12,136 INFO L432 NwaCegarLoop]: 105 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, 105 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:12,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 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:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-07 19:49:12,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-07 19:49:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 66 states have internal predecessors, (77), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:12,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2024-11-07 19:49:12,185 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 9 [2024-11-07 19:49:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:12,186 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2024-11-07 19:49:12,186 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:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2024-11-07 19:49:12,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-07 19:49:12,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:12,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 19:49:12,191 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:12,387 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:12,388 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:12,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash -75266778, now seen corresponding path program 1 times [2024-11-07 19:49:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:49:12,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857893909] [2024-11-07 19:49:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:12,389 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:12,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:49:12,391 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:12,392 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:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:12,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:49:12,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:12,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:12,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:49:12,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857893909] [2024-11-07 19:49:12,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857893909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:12,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:12,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 19:49:12,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636750592] [2024-11-07 19:49:12,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:12,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:49:12,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:49:12,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:49:12,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:49:12,507 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:12,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:12,588 INFO L93 Difference]: Finished difference Result 156 states and 186 transitions. [2024-11-07 19:49:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:49:12,590 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:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:12,593 INFO L225 Difference]: With dead ends: 156 [2024-11-07 19:49:12,593 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 19:49:12,593 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:12,595 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:12,596 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:12,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 19:49:12,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 19:49:12,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 70 states have internal predecessors, (81), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:12,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 96 transitions. [2024-11-07 19:49:12,611 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 96 transitions. Word has length 9 [2024-11-07 19:49:12,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:12,612 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 96 transitions. [2024-11-07 19:49:12,612 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:12,612 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 96 transitions. [2024-11-07 19:49:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-07 19:49:12,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:12,614 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:12,617 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 (3)] Forceful destruction successful, exit code 0 [2024-11-07 19:49:12,816 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:12,816 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:12,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:12,817 INFO L85 PathProgramCache]: Analyzing trace with hash -221032394, now seen corresponding path program 1 times [2024-11-07 19:49:12,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:49:12,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721298785] [2024-11-07 19:49:12,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:12,817 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:12,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:49:12,820 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:12,821 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:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:12,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:49:12,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:12,878 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:12,879 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:12,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:49:12,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721298785] [2024-11-07 19:49:12,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721298785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:12,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:12,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:49:12,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458300647] [2024-11-07 19:49:12,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:12,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:49:12,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:49:12,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:49:12,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:12,881 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:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:12,927 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2024-11-07 19:49:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:49:12,927 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:12,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:12,928 INFO L225 Difference]: With dead ends: 82 [2024-11-07 19:49:12,929 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 19:49:12,929 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:12,930 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:12,930 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:12,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 19:49:12,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-07 19:49:12,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 69 states have internal predecessors, (80), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 95 transitions. [2024-11-07 19:49:12,938 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 95 transitions. Word has length 16 [2024-11-07 19:49:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:12,938 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 95 transitions. [2024-11-07 19:49:12,938 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:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 95 transitions. [2024-11-07 19:49:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 19:49:12,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:12,939 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:12,944 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 (4)] Ended with exit code 0 [2024-11-07 19:49:13,143 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:13,144 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:13,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:13,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1071283234, now seen corresponding path program 1 times [2024-11-07 19:49:13,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:49:13,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610909349] [2024-11-07 19:49:13,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:13,145 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:13,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:49:13,148 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:13,149 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:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:13,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 19:49:13,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:13,201 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:13,201 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:13,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:49:13,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610909349] [2024-11-07 19:49:13,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610909349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:13,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:13,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 19:49:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685597135] [2024-11-07 19:49:13,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:13,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 19:49:13,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:49:13,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 19:49:13,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 19:49:13,202 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:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:13,243 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2024-11-07 19:49:13,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 19:49:13,244 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:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:13,245 INFO L225 Difference]: With dead ends: 81 [2024-11-07 19:49:13,245 INFO L226 Difference]: Without dead ends: 80 [2024-11-07 19:49:13,245 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:13,246 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:13,246 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:13,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-07 19:49:13,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-07 19:49:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 68 states have internal predecessors, (79), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-11-07 19:49:13,252 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 18 [2024-11-07 19:49:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:13,253 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-07 19:49:13,253 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:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-11-07 19:49:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-07 19:49:13,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:13,253 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:13,256 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 (5)] Ended with exit code 0 [2024-11-07 19:49:13,455 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:13,456 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:13,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:13,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1071215708, now seen corresponding path program 1 times [2024-11-07 19:49:13,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:49:13,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174431415] [2024-11-07 19:49:13,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:13,457 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:13,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:49:13,459 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:13,460 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:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 19:49:13,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 19:49:13,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 19:49:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 19:49:13,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 19:49:13,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 19:49:13,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174431415] [2024-11-07 19:49:13,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174431415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 19:49:13,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 19:49:13,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 19:49:13,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704048562] [2024-11-07 19:49:13,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 19:49:13,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 19:49:13,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 19:49:13,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 19:49:13,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 19:49:13,560 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:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 19:49:13,843 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2024-11-07 19:49:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 19:49:13,844 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:13,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 19:49:13,846 INFO L225 Difference]: With dead ends: 101 [2024-11-07 19:49:13,846 INFO L226 Difference]: Without dead ends: 98 [2024-11-07 19:49:13,847 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:13,850 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.3s IncrementalHoareTripleChecker+Time [2024-11-07 19:49:13,850 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.3s Time] [2024-11-07 19:49:13,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-07 19:49:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2024-11-07 19:49:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.359375) internal successors, (87), 75 states have internal predecessors, (87), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-07 19:49:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2024-11-07 19:49:13,867 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 18 [2024-11-07 19:49:13,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 19:49:13,868 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2024-11-07 19:49:13,871 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:13,871 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2024-11-07 19:49:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-07 19:49:13,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 19:49:13,872 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:13,875 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:14,072 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:14,073 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:14,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 19:49:14,073 INFO L85 PathProgramCache]: Analyzing trace with hash -980045403, now seen corresponding path program 1 times [2024-11-07 19:49:14,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 19:49:14,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941463196] [2024-11-07 19:49:14,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 19:49:14,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:14,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 19:49:14,075 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:14,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 (7)] Waiting until timeout for monitored process [2024-11-07 19:49:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:49:14,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 19:49:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 19:49:14,139 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-07 19:49:14,141 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 19:49:14,142 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2024-11-07 19:49:14,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2024-11-07 19:49:14,144 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2024-11-07 19:49:14,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2024-11-07 19:49:14,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2024-11-07 19:49:14,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2024-11-07 19:49:14,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2024-11-07 19:49:14,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2024-11-07 19:49:14,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2024-11-07 19:49:14,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2024-11-07 19:49:14,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2024-11-07 19:49:14,145 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2024-11-07 19:49:14,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2024-11-07 19:49:14,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2024-11-07 19:49:14,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2024-11-07 19:49:14,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2024-11-07 19:49:14,146 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2024-11-07 19:49:14,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2024-11-07 19:49:14,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2024-11-07 19:49:14,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2024-11-07 19:49:14,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2024-11-07 19:49:14,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2024-11-07 19:49:14,151 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:14,351 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:14,353 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 19:49:14,374 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 19:49:14,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:49:14 BoogieIcfgContainer [2024-11-07 19:49:14,377 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 19:49:14,378 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 19:49:14,378 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 19:49:14,378 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 19:49:14,379 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:11" (3/4) ... [2024-11-07 19:49:14,380 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-07 19:49:14,414 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 19:49:14,414 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 19:49:14,418 INFO L158 Benchmark]: Toolchain (without parser) took 3328.82ms. Allocated memory is still 117.4MB. Free memory was 93.7MB in the beginning and 51.6MB in the end (delta: 42.1MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2024-11-07 19:49:14,418 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 83.9MB. Free memory is still 65.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:14,418 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.39ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 79.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:49:14,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.60ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:14,418 INFO L158 Benchmark]: Boogie Preprocessor took 45.06ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:14,418 INFO L158 Benchmark]: RCFGBuilder took 423.54ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 58.6MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 19:49:14,419 INFO L158 Benchmark]: TraceAbstraction took 2511.93ms. Allocated memory is still 117.4MB. Free memory was 58.2MB in the beginning and 54.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-11-07 19:49:14,419 INFO L158 Benchmark]: Witness Printer took 36.31ms. Allocated memory is still 117.4MB. Free memory was 53.3MB in the beginning and 51.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 19:49:14,420 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.26ms. Allocated memory is still 83.9MB. Free memory is still 65.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.39ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 79.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.60ms. Allocated memory is still 117.4MB. Free memory was 79.6MB in the beginning and 78.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.06ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 76.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 423.54ms. Allocated memory is still 117.4MB. Free memory was 76.6MB in the beginning and 58.6MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2511.93ms. Allocated memory is still 117.4MB. Free memory was 58.2MB in the beginning and 54.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 36.31ms. Allocated memory is still 117.4MB. Free memory was 53.3MB in the beginning and 51.6MB in the end (delta: 1.7MB). 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_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; [L241] 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] [L241] RET, EXPR base2flt(0, 0) [L241] zero = base2flt(0, 0) [L242] 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 4 procedures, 97 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 870 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, 443 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=97occurred 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:14,451 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)