./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 791161d1 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-?-791161d [2022-07-23 13:34:16,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 13:34:16,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 13:34:16,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 13:34:16,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 13:34:16,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 13:34:16,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 13:34:16,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 13:34:16,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 13:34:16,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 13:34:16,450 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 13:34:16,452 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 13:34:16,452 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 13:34:16,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 13:34:16,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 13:34:16,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 13:34:16,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 13:34:16,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 13:34:16,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 13:34:16,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 13:34:16,458 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 13:34:16,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 13:34:16,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 13:34:16,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 13:34:16,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 13:34:16,482 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 13:34:16,482 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 13:34:16,482 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 13:34:16,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 13:34:16,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 13:34:16,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 13:34:16,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 13:34:16,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 13:34:16,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 13:34:16,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 13:34:16,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 13:34:16,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 13:34:16,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 13:34:16,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 13:34:16,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 13:34:16,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 13:34:16,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 13:34:16,504 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-23 13:34:16,526 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 13:34:16,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 13:34:16,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 13:34:16,534 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 13:34:16,535 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 13:34:16,535 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 13:34:16,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 13:34:16,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 13:34:16,536 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 13:34:16,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 13:34:16,536 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 13:34:16,536 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 13:34:16,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 13:34:16,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 13:34:16,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 13:34:16,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 13:34:16,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 13:34:16,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 13:34:16,537 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-23 13:34:16,537 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 13:34:16,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 13:34:16,538 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 13:34:16,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 13:34:16,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 13:34:16,540 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 13:34:16,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 13:34:16,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 13:34:16,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 13:34:16,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 13:34:16,541 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 13:34:16,541 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 13:34:16,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 13:34:16,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 13:34:16,541 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-23 13:34:16,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 13:34:16,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 13:34:16,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 13:34:16,773 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 13:34:16,774 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 13:34:16,775 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-23 13:34:16,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e50d3330/8c0b28ae5eab4738840f65130881e3ee/FLAG416476899 [2022-07-23 13:34:17,169 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 13:34:17,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2.c.cil.c [2022-07-23 13:34:17,174 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e50d3330/8c0b28ae5eab4738840f65130881e3ee/FLAG416476899 [2022-07-23 13:34:17,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e50d3330/8c0b28ae5eab4738840f65130881e3ee [2022-07-23 13:34:17,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 13:34:17,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 13:34:17,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 13:34:17,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 13:34:17,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 13:34:17,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:34:17" (1/1) ... [2022-07-23 13:34:17,205 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b8ac514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:17, skipping insertion in model container [2022-07-23 13:34:17,205 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 01:34:17" (1/1) ... [2022-07-23 13:34:17,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 13:34:17,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 13:34:17,341 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-23 13:34:17,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:34:17,383 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 13:34:17,391 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-23 13:34:17,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 13:34:17,424 INFO L208 MainTranslator]: Completed translation [2022-07-23 13:34:17,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:17 WrapperNode [2022-07-23 13:34:17,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 13:34:17,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 13:34:17,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 13:34:17,426 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 13:34:17,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:17" (1/1) ... [2022-07-23 13:34:17,438 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:17" (1/1) ... [2022-07-23 13:34:17,455 INFO L137 Inliner]: procedures = 18, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 182 [2022-07-23 13:34:17,456 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 13:34:17,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 13:34:17,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 13:34:17,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 13:34:17,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:17" (1/1) ... [2022-07-23 13:34:17,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:17" (1/1) ... [2022-07-23 13:34:17,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:17" (1/1) ... [2022-07-23 13:34:17,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:17" (1/1) ... [2022-07-23 13:34:17,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:17" (1/1) ... [2022-07-23 13:34:17,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:17" (1/1) ... [2022-07-23 13:34:17,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:17" (1/1) ... [2022-07-23 13:34:17,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 13:34:17,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 13:34:17,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 13:34:17,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 13:34:17,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:17" (1/1) ... [2022-07-23 13:34:17,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 13:34:17,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:17,539 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-23 13:34:17,549 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-23 13:34:17,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 13:34:17,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 13:34:17,587 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-07-23 13:34:17,587 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-07-23 13:34:17,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 13:34:17,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 13:34:17,589 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2022-07-23 13:34:17,589 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2022-07-23 13:34:17,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-23 13:34:17,590 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-23 13:34:17,658 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 13:34:17,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 13:34:18,025 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 13:34:18,031 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 13:34:18,031 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 13:34:18,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:34:18 BoogieIcfgContainer [2022-07-23 13:34:18,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 13:34:18,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 13:34:18,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 13:34:18,037 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 13:34:18,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 01:34:17" (1/3) ... [2022-07-23 13:34:18,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7289b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:34:18, skipping insertion in model container [2022-07-23 13:34:18,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 01:34:17" (2/3) ... [2022-07-23 13:34:18,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7289b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 01:34:18, skipping insertion in model container [2022-07-23 13:34:18,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:34:18" (3/3) ... [2022-07-23 13:34:18,039 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_4-2.c.cil.c [2022-07-23 13:34:18,048 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 13:34:18,048 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-23 13:34:18,082 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 13:34:18,087 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@405bae9d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@fc38eb8 [2022-07-23 13:34:18,087 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-23 13:34:18,096 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-23 13:34:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 13:34:18,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:18,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:18,104 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-23 13:34:18,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:18,111 INFO L85 PathProgramCache]: Analyzing trace with hash 322140097, now seen corresponding path program 1 times [2022-07-23 13:34:18,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:18,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471167785] [2022-07-23 13:34:18,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:18,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:18,208 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-23 13:34:18,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:18,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471167785] [2022-07-23 13:34:18,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471167785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:18,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:34:18,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 13:34:18,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858532581] [2022-07-23 13:34:18,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:18,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-23 13:34:18,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:18,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-23 13:34:18,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-23 13:34:18,232 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-23 13:34:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:18,259 INFO L93 Difference]: Finished difference Result 275 states and 394 transitions. [2022-07-23 13:34:18,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 13:34:18,261 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-23 13:34:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:18,267 INFO L225 Difference]: With dead ends: 275 [2022-07-23 13:34:18,267 INFO L226 Difference]: Without dead ends: 128 [2022-07-23 13:34:18,270 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-23 13:34:18,272 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-23 13:34:18,273 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-23 13:34:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-23 13:34:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-07-23 13:34:18,301 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-23 13:34:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 161 transitions. [2022-07-23 13:34:18,304 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 161 transitions. Word has length 9 [2022-07-23 13:34:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:18,305 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 161 transitions. [2022-07-23 13:34:18,305 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-23 13:34:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 161 transitions. [2022-07-23 13:34:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 13:34:18,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:18,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:18,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 13:34:18,307 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-23 13:34:18,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:18,308 INFO L85 PathProgramCache]: Analyzing trace with hash 321198749, now seen corresponding path program 1 times [2022-07-23 13:34:18,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:18,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234574866] [2022-07-23 13:34:18,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:18,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:18,371 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-23 13:34:18,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:18,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234574866] [2022-07-23 13:34:18,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234574866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:18,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:34:18,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 13:34:18,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809614657] [2022-07-23 13:34:18,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:18,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:34:18,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:18,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:34:18,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:34:18,385 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-23 13:34:18,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:18,489 INFO L93 Difference]: Finished difference Result 318 states and 410 transitions. [2022-07-23 13:34:18,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 13:34:18,490 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-23 13:34:18,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:18,492 INFO L225 Difference]: With dead ends: 318 [2022-07-23 13:34:18,492 INFO L226 Difference]: Without dead ends: 193 [2022-07-23 13:34:18,493 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-23 13:34:18,494 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.1s IncrementalHoareTripleChecker+Time [2022-07-23 13:34:18,494 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.1s Time] [2022-07-23 13:34:18,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-07-23 13:34:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 177. [2022-07-23 13:34:18,504 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-23 13:34:18,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 240 transitions. [2022-07-23 13:34:18,506 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 240 transitions. Word has length 9 [2022-07-23 13:34:18,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:18,506 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 240 transitions. [2022-07-23 13:34:18,506 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-23 13:34:18,507 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 240 transitions. [2022-07-23 13:34:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-23 13:34:18,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:18,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:18,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 13:34:18,507 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-23 13:34:18,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:18,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1388111822, now seen corresponding path program 1 times [2022-07-23 13:34:18,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:18,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082304341] [2022-07-23 13:34:18,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:18,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:18,548 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-23 13:34:18,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:18,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082304341] [2022-07-23 13:34:18,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082304341] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:18,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 13:34:18,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 13:34:18,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301862268] [2022-07-23 13:34:18,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:18,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 13:34:18,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:18,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 13:34:18,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:34:18,550 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-23 13:34:18,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:18,606 INFO L93 Difference]: Finished difference Result 329 states and 431 transitions. [2022-07-23 13:34:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 13:34:18,607 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-23 13:34:18,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:18,608 INFO L225 Difference]: With dead ends: 329 [2022-07-23 13:34:18,608 INFO L226 Difference]: Without dead ends: 157 [2022-07-23 13:34:18,609 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-23 13:34:18,610 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-23 13:34:18,610 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-23 13:34:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-23 13:34:18,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 142. [2022-07-23 13:34:18,617 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-23 13:34:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 182 transitions. [2022-07-23 13:34:18,618 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 182 transitions. Word has length 12 [2022-07-23 13:34:18,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:18,618 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 182 transitions. [2022-07-23 13:34:18,618 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-23 13:34:18,618 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 182 transitions. [2022-07-23 13:34:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-23 13:34:18,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:18,619 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:18,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 13:34:18,619 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-23 13:34:18,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:18,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1925525539, now seen corresponding path program 1 times [2022-07-23 13:34:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:18,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291100399] [2022-07-23 13:34:18,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:18,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:18,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:18,667 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-23 13:34:18,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:18,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291100399] [2022-07-23 13:34:18,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291100399] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:18,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309853409] [2022-07-23 13:34:18,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:18,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:18,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:18,672 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-23 13:34:18,677 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-23 13:34:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:18,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:34:18,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:18,749 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-23 13:34:18,749 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:34:18,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309853409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:18,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 13:34:18,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-23 13:34:18,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68513740] [2022-07-23 13:34:18,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:18,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 13:34:18,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:18,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 13:34:18,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 13:34:18,752 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-23 13:34:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:18,837 INFO L93 Difference]: Finished difference Result 215 states and 288 transitions. [2022-07-23 13:34:18,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 13:34:18,838 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-23 13:34:18,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:18,839 INFO L225 Difference]: With dead ends: 215 [2022-07-23 13:34:18,839 INFO L226 Difference]: Without dead ends: 211 [2022-07-23 13:34:18,840 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-23 13:34:18,841 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-23 13:34:18,841 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-23 13:34:18,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-23 13:34:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 190. [2022-07-23 13:34:18,849 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-23 13:34:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 263 transitions. [2022-07-23 13:34:18,851 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 263 transitions. Word has length 16 [2022-07-23 13:34:18,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:18,851 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 263 transitions. [2022-07-23 13:34:18,851 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-23 13:34:18,851 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 263 transitions. [2022-07-23 13:34:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-23 13:34:18,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:18,852 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:18,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-23 13:34:19,087 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-23 13:34:19,088 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-23 13:34:19,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:19,089 INFO L85 PathProgramCache]: Analyzing trace with hash 438250492, now seen corresponding path program 1 times [2022-07-23 13:34:19,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:19,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121543002] [2022-07-23 13:34:19,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:19,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:19,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:19,134 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-23 13:34:19,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:19,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121543002] [2022-07-23 13:34:19,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121543002] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:19,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283110330] [2022-07-23 13:34:19,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:19,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:19,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:19,137 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-23 13:34:19,159 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-23 13:34:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:19,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 13:34:19,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:19,197 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-23 13:34:19,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:34:19,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283110330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:19,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 13:34:19,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2022-07-23 13:34:19,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834874192] [2022-07-23 13:34:19,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:19,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 13:34:19,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:19,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 13:34:19,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 13:34:19,199 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-23 13:34:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:19,226 INFO L93 Difference]: Finished difference Result 196 states and 269 transitions. [2022-07-23 13:34:19,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 13:34:19,227 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-23 13:34:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:19,228 INFO L225 Difference]: With dead ends: 196 [2022-07-23 13:34:19,228 INFO L226 Difference]: Without dead ends: 195 [2022-07-23 13:34:19,228 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-23 13:34:19,229 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-23 13:34:19,229 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-23 13:34:19,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-23 13:34:19,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 189. [2022-07-23 13:34:19,236 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-23 13:34:19,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 261 transitions. [2022-07-23 13:34:19,237 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 261 transitions. Word has length 17 [2022-07-23 13:34:19,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:19,237 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 261 transitions. [2022-07-23 13:34:19,238 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-23 13:34:19,238 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 261 transitions. [2022-07-23 13:34:19,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 13:34:19,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:19,238 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:19,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-23 13:34:19,455 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-23 13:34:19,455 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-23 13:34:19,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:19,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1588311493, now seen corresponding path program 1 times [2022-07-23 13:34:19,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:19,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064508779] [2022-07-23 13:34:19,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:19,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:19,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 13:34:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:19,530 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-23 13:34:19,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 13:34:19,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064508779] [2022-07-23 13:34:19,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064508779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 13:34:19,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672431077] [2022-07-23 13:34:19,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:19,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 13:34:19,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 13:34:19,548 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-23 13:34:19,549 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-23 13:34:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 13:34:19,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 13:34:19,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 13:34:19,622 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-23 13:34:19,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 13:34:19,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672431077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 13:34:19,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 13:34:19,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-23 13:34:19,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322377332] [2022-07-23 13:34:19,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 13:34:19,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 13:34:19,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 13:34:19,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 13:34:19,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 13:34:19,623 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-23 13:34:19,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 13:34:19,713 INFO L93 Difference]: Finished difference Result 236 states and 317 transitions. [2022-07-23 13:34:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 13:34:19,713 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-23 13:34:19,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 13:34:19,716 INFO L225 Difference]: With dead ends: 236 [2022-07-23 13:34:19,716 INFO L226 Difference]: Without dead ends: 231 [2022-07-23 13:34:19,716 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-23 13:34:19,718 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-23 13:34:19,720 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-23 13:34:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-23 13:34:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 209. [2022-07-23 13:34:19,740 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-23 13:34:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 288 transitions. [2022-07-23 13:34:19,741 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 288 transitions. Word has length 18 [2022-07-23 13:34:19,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 13:34:19,742 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 288 transitions. [2022-07-23 13:34:19,742 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-23 13:34:19,742 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 288 transitions. [2022-07-23 13:34:19,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 13:34:19,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 13:34:19,743 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-23 13:34:19,777 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-23 13:34:19,955 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-23 13:34:19,956 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2022-07-23 13:34:19,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 13:34:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1995188878, now seen corresponding path program 1 times [2022-07-23 13:34:19,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 13:34:19,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012957398] [2022-07-23 13:34:19,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 13:34:19,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 13:34:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 13:34:19,965 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 13:34:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 13:34:19,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 13:34:19,983 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-23 13:34:19,988 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2022-07-23 13:34:19,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2022-07-23 13:34:19,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2022-07-23 13:34:19,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2022-07-23 13:34:19,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2022-07-23 13:34:19,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2022-07-23 13:34:19,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2022-07-23 13:34:19,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2022-07-23 13:34:19,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2022-07-23 13:34:19,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2022-07-23 13:34:19,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2022-07-23 13:34:19,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2022-07-23 13:34:19,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2022-07-23 13:34:19,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2022-07-23 13:34:19,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2022-07-23 13:34:19,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2022-07-23 13:34:19,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2022-07-23 13:34:19,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2022-07-23 13:34:19,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2022-07-23 13:34:19,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2022-07-23 13:34:19,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2022-07-23 13:34:19,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2022-07-23 13:34:19,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2022-07-23 13:34:19,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2022-07-23 13:34:19,991 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2022-07-23 13:34:19,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2022-07-23 13:34:19,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2022-07-23 13:34:19,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2022-07-23 13:34:19,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 13:34:19,994 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-07-23 13:34:19,996 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-23 13:34:20,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.07 01:34:20 BoogieIcfgContainer [2022-07-23 13:34:20,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-23 13:34:20,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 13:34:20,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 13:34:20,015 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 13:34:20,015 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 01:34:18" (3/4) ... [2022-07-23 13:34:20,017 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 13:34:20,017 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 13:34:20,018 INFO L158 Benchmark]: Toolchain (without parser) took 2828.98ms. Allocated memory was 102.8MB in the beginning and 144.7MB in the end (delta: 41.9MB). Free memory was 70.2MB in the beginning and 90.2MB in the end (delta: -20.0MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2022-07-23 13:34:20,018 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory was 59.1MB in the beginning and 59.0MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 13:34:20,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.60ms. Allocated memory was 102.8MB in the beginning and 144.7MB in the end (delta: 41.9MB). Free memory was 69.9MB in the beginning and 114.5MB in the end (delta: -44.6MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-07-23 13:34:20,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.18ms. Allocated memory is still 144.7MB. Free memory was 114.5MB in the beginning and 112.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 13:34:20,018 INFO L158 Benchmark]: Boogie Preprocessor took 28.45ms. Allocated memory is still 144.7MB. Free memory was 112.4MB in the beginning and 111.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 13:34:20,019 INFO L158 Benchmark]: RCFGBuilder took 547.74ms. Allocated memory is still 144.7MB. Free memory was 110.4MB in the beginning and 90.1MB in the end (delta: 20.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-23 13:34:20,019 INFO L158 Benchmark]: TraceAbstraction took 1980.78ms. Allocated memory is still 144.7MB. Free memory was 90.1MB in the beginning and 90.2MB in the end (delta: -73.9kB). Peak memory consumption was 235.6kB. Max. memory is 16.1GB. [2022-07-23 13:34:20,019 INFO L158 Benchmark]: Witness Printer took 2.28ms. Allocated memory is still 144.7MB. Free memory is still 90.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 13:34:20,020 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.17ms. Allocated memory is still 102.8MB. Free memory was 59.1MB in the beginning and 59.0MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.60ms. Allocated memory was 102.8MB in the beginning and 144.7MB in the end (delta: 41.9MB). Free memory was 69.9MB in the beginning and 114.5MB in the end (delta: -44.6MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.18ms. Allocated memory is still 144.7MB. Free memory was 114.5MB in the beginning and 112.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.45ms. Allocated memory is still 144.7MB. Free memory was 112.4MB in the beginning and 111.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 547.74ms. Allocated memory is still 144.7MB. Free memory was 110.4MB in the beginning and 90.1MB in the end (delta: 20.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1980.78ms. Allocated memory is still 144.7MB. Free memory was 90.1MB in the beginning and 90.2MB in the end (delta: -73.9kB). Peak memory consumption was 235.6kB. Max. memory is 16.1GB. * Witness Printer took 2.28ms. Allocated memory is still 144.7MB. Free memory is still 90.2MB. 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: 1.9s, 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-23 13:34:20,057 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