./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 da84b0bfdfce2fad5f551c5bc14b33ff3764ad6f4b0c00bd09707e2922ecd646 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 00:46:39,127 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 00:46:39,129 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 00:46:39,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 00:46:39,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 00:46:39,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 00:46:39,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 00:46:39,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 00:46:39,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 00:46:39,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 00:46:39,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 00:46:39,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 00:46:39,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 00:46:39,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 00:46:39,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 00:46:39,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 00:46:39,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 00:46:39,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 00:46:39,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 00:46:39,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 00:46:39,196 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 00:46:39,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 00:46:39,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 00:46:39,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 00:46:39,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 00:46:39,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 00:46:39,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 00:46:39,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 00:46:39,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 00:46:39,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 00:46:39,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 00:46:39,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 00:46:39,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 00:46:39,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 00:46:39,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 00:46:39,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 00:46:39,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 00:46:39,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 00:46:39,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 00:46:39,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 00:46:39,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 00:46:39,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 00:46:39,220 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-22 00:46:39,245 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 00:46:39,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 00:46:39,246 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 00:46:39,246 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 00:46:39,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 00:46:39,247 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 00:46:39,247 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 00:46:39,247 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 00:46:39,247 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 00:46:39,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 00:46:39,248 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 00:46:39,248 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 00:46:39,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 00:46:39,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 00:46:39,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 00:46:39,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 00:46:39,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 00:46:39,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 00:46:39,250 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-22 00:46:39,250 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 00:46:39,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 00:46:39,250 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 00:46:39,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 00:46:39,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 00:46:39,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 00:46:39,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 00:46:39,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 00:46:39,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 00:46:39,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 00:46:39,251 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 00:46:39,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 00:46:39,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 00:46:39,252 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 00:46:39,252 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> da84b0bfdfce2fad5f551c5bc14b33ff3764ad6f4b0c00bd09707e2922ecd646 [2022-07-22 00:46:39,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 00:46:39,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 00:46:39,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 00:46:39,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 00:46:39,557 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 00:46:39,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2022-07-22 00:46:39,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b1837ae/95844be258b54d0fa80ca5e195cce00c/FLAG8389e5ff5 [2022-07-22 00:46:39,976 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 00:46:39,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2022-07-22 00:46:39,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b1837ae/95844be258b54d0fa80ca5e195cce00c/FLAG8389e5ff5 [2022-07-22 00:46:40,389 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b1837ae/95844be258b54d0fa80ca5e195cce00c [2022-07-22 00:46:40,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 00:46:40,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 00:46:40,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 00:46:40,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 00:46:40,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 00:46:40,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:46:40" (1/1) ... [2022-07-22 00:46:40,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebe7392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:40, skipping insertion in model container [2022-07-22 00:46:40,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:46:40" (1/1) ... [2022-07-22 00:46:40,402 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 00:46:40,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 00:46:40,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c[816,829] [2022-07-22 00:46:40,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 00:46:40,595 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 00:46:40,607 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c[816,829] [2022-07-22 00:46:40,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 00:46:40,666 INFO L208 MainTranslator]: Completed translation [2022-07-22 00:46:40,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:40 WrapperNode [2022-07-22 00:46:40,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 00:46:40,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 00:46:40,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 00:46:40,669 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 00:46:40,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:40" (1/1) ... [2022-07-22 00:46:40,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:40" (1/1) ... [2022-07-22 00:46:40,716 INFO L137 Inliner]: procedures = 18, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 182 [2022-07-22 00:46:40,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 00:46:40,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 00:46:40,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 00:46:40,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 00:46:40,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:40" (1/1) ... [2022-07-22 00:46:40,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:40" (1/1) ... [2022-07-22 00:46:40,734 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:40" (1/1) ... [2022-07-22 00:46:40,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:40" (1/1) ... [2022-07-22 00:46:40,741 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:40" (1/1) ... [2022-07-22 00:46:40,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:40" (1/1) ... [2022-07-22 00:46:40,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:40" (1/1) ... [2022-07-22 00:46:40,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 00:46:40,761 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 00:46:40,767 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 00:46:40,767 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 00:46:40,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:40" (1/1) ... [2022-07-22 00:46:40,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 00:46:40,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:40,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 00:46:40,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 00:46:40,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 00:46:40,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 00:46:40,837 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-22 00:46:40,837 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-22 00:46:40,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 00:46:40,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 00:46:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-22 00:46:40,838 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-22 00:46:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 00:46:40,838 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 00:46:40,926 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 00:46:40,937 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 00:46:41,230 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 00:46:41,236 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 00:46:41,251 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 00:46:41,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:41 BoogieIcfgContainer [2022-07-22 00:46:41,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 00:46:41,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 00:46:41,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 00:46:41,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 00:46:41,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 12:46:40" (1/3) ... [2022-07-22 00:46:41,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b44057e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 12:46:41, skipping insertion in model container [2022-07-22 00:46:41,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:46:40" (2/3) ... [2022-07-22 00:46:41,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b44057e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 12:46:41, skipping insertion in model container [2022-07-22 00:46:41,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:41" (3/3) ... [2022-07-22 00:46:41,258 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-2.c.cil.c [2022-07-22 00:46:41,268 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 00:46:41,278 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-22 00:46:41,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 00:46:41,315 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d1b7880, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@35b7f18 [2022-07-22 00:46:41,316 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-22 00:46:41,319 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 100 states have (on average 1.79) internal successors, (179), 128 states have internal predecessors, (179), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-22 00:46:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 00:46:41,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:41,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:41,325 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-22 00:46:41,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:41,332 INFO L85 PathProgramCache]: Analyzing trace with hash 322140097, now seen corresponding path program 1 times [2022-07-22 00:46:41,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:41,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316533211] [2022-07-22 00:46:41,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:41,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:41,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:41,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:41,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316533211] [2022-07-22 00:46:41,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316533211] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:41,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:41,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 00:46:41,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553487664] [2022-07-22 00:46:41,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:41,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 00:46:41,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:41,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 00:46:41,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 00:46:41,482 INFO L87 Difference]: Start difference. First operand has 140 states, 100 states have (on average 1.79) internal successors, (179), 128 states have internal predecessors, (179), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.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) [2022-07-22 00:46:41,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:41,522 INFO L93 Difference]: Finished difference Result 275 states and 394 transitions. [2022-07-22 00:46:41,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 00:46:41,524 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.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 [2022-07-22 00:46:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:41,541 INFO L225 Difference]: With dead ends: 275 [2022-07-22 00:46:41,542 INFO L226 Difference]: Without dead ends: 128 [2022-07-22 00:46:41,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 00:46:41,547 INFO L413 NwaCegarLoop]: 174 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, 174 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 [2022-07-22 00:46:41,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:41,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-22 00:46:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-07-22 00:46:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 92 states have (on average 1.608695652173913) internal successors, (148), 118 states have internal predecessors, (148), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 161 transitions. [2022-07-22 00:46:41,577 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 161 transitions. Word has length 9 [2022-07-22 00:46:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:41,577 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 161 transitions. [2022-07-22 00:46:41,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.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) [2022-07-22 00:46:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 161 transitions. [2022-07-22 00:46:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 00:46:41,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:41,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:41,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 00:46:41,579 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-22 00:46:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:41,580 INFO L85 PathProgramCache]: Analyzing trace with hash 321198749, now seen corresponding path program 1 times [2022-07-22 00:46:41,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:41,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839094850] [2022-07-22 00:46:41,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:41,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:41,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:41,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:41,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839094850] [2022-07-22 00:46:41,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839094850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:41,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:41,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 00:46:41,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892779441] [2022-07-22 00:46:41,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:41,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:46:41,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:41,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:46:41,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:46:41,690 INFO L87 Difference]: Start difference. First operand 128 states and 161 transitions. 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) [2022-07-22 00:46:41,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:41,763 INFO L93 Difference]: Finished difference Result 318 states and 410 transitions. [2022-07-22 00:46:41,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 00:46:41,763 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 [2022-07-22 00:46:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:41,766 INFO L225 Difference]: With dead ends: 318 [2022-07-22 00:46:41,766 INFO L226 Difference]: Without dead ends: 193 [2022-07-22 00:46:41,767 INFO L412 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 [2022-07-22 00:46:41,768 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 100 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:41,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 431 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:41,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-22 00:46:41,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 177. [2022-07-22 00:46:41,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 140 states have (on average 1.6214285714285714) internal successors, (227), 166 states have internal predecessors, (227), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:41,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 240 transitions. [2022-07-22 00:46:41,781 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 240 transitions. Word has length 9 [2022-07-22 00:46:41,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:41,782 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 240 transitions. [2022-07-22 00:46:41,782 INFO L496 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) [2022-07-22 00:46:41,782 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 240 transitions. [2022-07-22 00:46:41,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 00:46:41,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:41,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:41,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 00:46:41,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-22 00:46:41,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:41,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1388111822, now seen corresponding path program 1 times [2022-07-22 00:46:41,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:41,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547088144] [2022-07-22 00:46:41,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:41,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:41,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:41,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547088144] [2022-07-22 00:46:41,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547088144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:41,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 00:46:41,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 00:46:41,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5685085] [2022-07-22 00:46:41,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:41,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 00:46:41,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:41,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 00:46:41,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:46:41,829 INFO L87 Difference]: Start difference. First operand 177 states and 240 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-07-22 00:46:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:41,896 INFO L93 Difference]: Finished difference Result 329 states and 431 transitions. [2022-07-22 00:46:41,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 00:46:41,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2022-07-22 00:46:41,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:41,898 INFO L225 Difference]: With dead ends: 329 [2022-07-22 00:46:41,898 INFO L226 Difference]: Without dead ends: 157 [2022-07-22 00:46:41,899 INFO L412 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 [2022-07-22 00:46:41,903 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 33 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:41,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 441 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-22 00:46:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 142. [2022-07-22 00:46:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 131 states have internal predecessors, (169), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 182 transitions. [2022-07-22 00:46:41,914 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 182 transitions. Word has length 12 [2022-07-22 00:46:41,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:41,914 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 182 transitions. [2022-07-22 00:46:41,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-07-22 00:46:41,914 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 182 transitions. [2022-07-22 00:46:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 00:46:41,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:41,915 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:41,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 00:46:41,915 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-22 00:46:41,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:41,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1925525539, now seen corresponding path program 1 times [2022-07-22 00:46:41,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:41,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257980478] [2022-07-22 00:46:41,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:41,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:41,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:41,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:41,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257980478] [2022-07-22 00:46:41,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257980478] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:41,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182438404] [2022-07-22 00:46:41,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:41,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:41,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:42,011 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 00:46:42,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 00:46:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:42,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 00:46:42,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:42,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:42,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182438404] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:42,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:42,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-22 00:46:42,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620028804] [2022-07-22 00:46:42,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:42,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:42,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:42,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:42,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:46:42,118 INFO L87 Difference]: Start difference. First operand 142 states and 182 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-07-22 00:46:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:42,206 INFO L93 Difference]: Finished difference Result 215 states and 288 transitions. [2022-07-22 00:46:42,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:42,206 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 16 [2022-07-22 00:46:42,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:42,208 INFO L225 Difference]: With dead ends: 215 [2022-07-22 00:46:42,208 INFO L226 Difference]: Without dead ends: 211 [2022-07-22 00:46:42,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:46:42,209 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 145 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:42,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 500 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-22 00:46:42,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 190. [2022-07-22 00:46:42,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 154 states have (on average 1.6233766233766234) internal successors, (250), 178 states have internal predecessors, (250), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:42,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 263 transitions. [2022-07-22 00:46:42,219 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 263 transitions. Word has length 16 [2022-07-22 00:46:42,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:42,219 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 263 transitions. [2022-07-22 00:46:42,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2022-07-22 00:46:42,220 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 263 transitions. [2022-07-22 00:46:42,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 00:46:42,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:42,220 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:42,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:42,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:42,440 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-22 00:46:42,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:42,440 INFO L85 PathProgramCache]: Analyzing trace with hash 438250492, now seen corresponding path program 1 times [2022-07-22 00:46:42,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:42,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459034183] [2022-07-22 00:46:42,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:42,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:42,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-22 00:46:42,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:42,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459034183] [2022-07-22 00:46:42,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459034183] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:42,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544798184] [2022-07-22 00:46:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:42,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:42,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:42,483 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 00:46:42,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 00:46:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:42,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 00:46:42,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 00:46:42,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:42,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544798184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:42,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:42,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2022-07-22 00:46:42,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195668977] [2022-07-22 00:46:42,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:42,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 00:46:42,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:42,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 00:46:42,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:46:42,527 INFO L87 Difference]: Start difference. First operand 190 states and 263 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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) [2022-07-22 00:46:42,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:42,554 INFO L93 Difference]: Finished difference Result 196 states and 269 transitions. [2022-07-22 00:46:42,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 00:46:42,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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 17 [2022-07-22 00:46:42,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:42,556 INFO L225 Difference]: With dead ends: 196 [2022-07-22 00:46:42,556 INFO L226 Difference]: Without dead ends: 195 [2022-07-22 00:46:42,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 00:46:42,557 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 3 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:42,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 285 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 00:46:42,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-22 00:46:42,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 189. [2022-07-22 00:46:42,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 154 states have (on average 1.6103896103896105) internal successors, (248), 177 states have internal predecessors, (248), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:42,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 261 transitions. [2022-07-22 00:46:42,564 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 261 transitions. Word has length 17 [2022-07-22 00:46:42,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:42,565 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 261 transitions. [2022-07-22 00:46:42,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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) [2022-07-22 00:46:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 261 transitions. [2022-07-22 00:46:42,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 00:46:42,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:42,566 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:42,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:42,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:42,782 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-22 00:46:42,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1588311493, now seen corresponding path program 1 times [2022-07-22 00:46:42,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:42,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819958531] [2022-07-22 00:46:42,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:42,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:42,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 00:46:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:42,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:42,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 00:46:42,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819958531] [2022-07-22 00:46:42,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819958531] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 00:46:42,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821766060] [2022-07-22 00:46:42,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:42,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:42,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 00:46:42,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 00:46:42,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-22 00:46:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 00:46:42,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 00:46:42,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 00:46:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 00:46:42,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 00:46:42,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821766060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 00:46:42,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 00:46:42,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-22 00:46:42,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433222827] [2022-07-22 00:46:42,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 00:46:42,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 00:46:42,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 00:46:42,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 00:46:42,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 00:46:42,974 INFO L87 Difference]: Start difference. First operand 189 states and 261 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, (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) [2022-07-22 00:46:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 00:46:43,062 INFO L93 Difference]: Finished difference Result 236 states and 317 transitions. [2022-07-22 00:46:43,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 00:46:43,063 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, (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 [2022-07-22 00:46:43,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 00:46:43,065 INFO L225 Difference]: With dead ends: 236 [2022-07-22 00:46:43,065 INFO L226 Difference]: Without dead ends: 231 [2022-07-22 00:46:43,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 00:46:43,067 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 129 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 00:46:43,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 523 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 00:46:43,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-22 00:46:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 209. [2022-07-22 00:46:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 174 states have (on average 1.5804597701149425) internal successors, (275), 197 states have internal predecessors, (275), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-22 00:46:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2022-07-22 00:46:43,081 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 288 transitions. Word has length 18 [2022-07-22 00:46:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 00:46:43,081 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 288 transitions. [2022-07-22 00:46:43,082 INFO L496 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, (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) [2022-07-22 00:46:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 288 transitions. [2022-07-22 00:46:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 00:46:43,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 00:46:43,084 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:43,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 00:46:43,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 00:46:43,300 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-22 00:46:43,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 00:46:43,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1995188878, now seen corresponding path program 1 times [2022-07-22 00:46:43,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 00:46:43,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422011487] [2022-07-22 00:46:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 00:46:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 00:46:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 00:46:43,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 00:46:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 00:46:43,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 00:46:43,330 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 00:46:43,331 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2022-07-22 00:46:43,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2022-07-22 00:46:43,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2022-07-22 00:46:43,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2022-07-22 00:46:43,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2022-07-22 00:46:43,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2022-07-22 00:46:43,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2022-07-22 00:46:43,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2022-07-22 00:46:43,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2022-07-22 00:46:43,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2022-07-22 00:46:43,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2022-07-22 00:46:43,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2022-07-22 00:46:43,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2022-07-22 00:46:43,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2022-07-22 00:46:43,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2022-07-22 00:46:43,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2022-07-22 00:46:43,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2022-07-22 00:46:43,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2022-07-22 00:46:43,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2022-07-22 00:46:43,335 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2022-07-22 00:46:43,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2022-07-22 00:46:43,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2022-07-22 00:46:43,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2022-07-22 00:46:43,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2022-07-22 00:46:43,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2022-07-22 00:46:43,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2022-07-22 00:46:43,336 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2022-07-22 00:46:43,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2022-07-22 00:46:43,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 00:46:43,339 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-22 00:46:43,342 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 00:46:43,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 12:46:43 BoogieIcfgContainer [2022-07-22 00:46:43,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 00:46:43,362 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 00:46:43,362 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 00:46:43,362 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 00:46:43,363 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:46:41" (3/4) ... [2022-07-22 00:46:43,365 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 00:46:43,365 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 00:46:43,366 INFO L158 Benchmark]: Toolchain (without parser) took 2973.94ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 31.3MB in the beginning and 29.5MB in the end (delta: 1.7MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2022-07-22 00:46:43,366 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 54.5MB. Free memory was 35.7MB in the beginning and 35.7MB in the end (delta: 45.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 00:46:43,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.10ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 31.0MB in the beginning and 52.1MB in the end (delta: -21.1MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2022-07-22 00:46:43,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.77ms. Allocated memory is still 71.3MB. Free memory was 52.1MB in the beginning and 49.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 00:46:43,367 INFO L158 Benchmark]: Boogie Preprocessor took 42.76ms. Allocated memory is still 71.3MB. Free memory was 49.8MB in the beginning and 48.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 00:46:43,367 INFO L158 Benchmark]: RCFGBuilder took 492.48ms. Allocated memory is still 71.3MB. Free memory was 48.1MB in the beginning and 48.8MB in the end (delta: -620.3kB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-07-22 00:46:43,367 INFO L158 Benchmark]: TraceAbstraction took 2107.44ms. Allocated memory is still 71.3MB. Free memory was 48.1MB in the beginning and 30.0MB in the end (delta: 18.1MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2022-07-22 00:46:43,367 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 29.5MB in the end (delta: 486.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 00:46:43,368 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 54.5MB. Free memory was 35.7MB in the beginning and 35.7MB in the end (delta: 45.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.10ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 31.0MB in the beginning and 52.1MB in the end (delta: -21.1MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.77ms. Allocated memory is still 71.3MB. Free memory was 52.1MB in the beginning and 49.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.76ms. Allocated memory is still 71.3MB. Free memory was 49.8MB in the beginning and 48.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 492.48ms. Allocated memory is still 71.3MB. Free memory was 48.1MB in the beginning and 48.8MB in the end (delta: -620.3kB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2107.44ms. Allocated memory is still 71.3MB. Free memory was 48.1MB in the beginning and 30.0MB in the end (delta: 18.1MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 29.5MB in the end (delta: 486.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 80. Possible FailurePath: [L230] unsigned int a ; [L231] unsigned int ma = __VERIFIER_nondet_uint(); [L232] signed char ea = __VERIFIER_nondet_char(); [L233] unsigned int b ; [L234] unsigned int mb = __VERIFIER_nondet_uint(); [L235] signed char eb = __VERIFIER_nondet_char(); [L236] unsigned int r_add1 ; [L237] unsigned int r_add2 ; [L238] unsigned int zero ; [L239] int tmp ; [L240] int tmp___0 ; [L241] int __retres14 ; VAL [ea=0, eb=0] [L245] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=0, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L33] COND TRUE ! m [L34] __retres4 = 0U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L84] return (__retres4); VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=0, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, \result=0, __retres4=0, e=0, m=0, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L245] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=0, eb=0, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L245] zero = base2flt(0, 0) [L246] CALL base2flt(ma, ea) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L29] unsigned int res ; [L30] unsigned int __retres4 ; VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=16777216, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L33] COND FALSE !(! m) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=16777216, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L39] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=16777216, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L61] COND TRUE 1 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=16777216, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L63] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=16777216, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L80] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=0, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L81] EXPR e + 128 VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=0, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] [L81] (e + 128) << 24U VAL [\old(e)=0, \old(m = m & ~ (1U << 24U))=16777218, \old(m)=16777216, \old(res = m | (unsigned int )((e + 128) << 24U))=16777217, e=0, m=0, m = m & ~ (1U << 24U)=16777218, res = m | (unsigned int )((e + 128) << 24U)=16777217] - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 74]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 113]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 116]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 119]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 137]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 145]: 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, 140 locations, 28 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 418 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 410 mSDsluCounter, 2354 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1465 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 331 IncrementalHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 889 mSDtfsCounter, 331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=209occurred in iteration=6, InterpolantAutomatonStates: 26, 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, 6 MinimizatonAttempts, 80 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 299 SizeOfPredicates, 2 NumberOfNonLiveVariables, 234 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 9/12 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 [2022-07-22 00:46:43,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample