./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e8d55036 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-2a.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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:45:26,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:45:26,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:45:26,797 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:45:26,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:45:26,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:45:26,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:45:26,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:45:26,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:45:26,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:45:26,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:45:26,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:45:26,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:45:26,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:45:26,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:45:26,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:45:26,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:45:26,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:45:26,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:45:26,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:45:26,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:45:26,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:45:26,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:45:26,829 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:45:26,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:45:26,833 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:45:26,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:45:26,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:45:26,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:45:26,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:45:26,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:45:26,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:45:26,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:45:26,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:45:26,839 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:45:26,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:45:26,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:45:26,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:45:26,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:45:26,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:45:26,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:45:26,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-15 22:45:26,872 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:45:26,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:45:26,873 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:45:26,873 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:45:26,874 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:45:26,874 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:45:26,874 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:45:26,874 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:45:26,875 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:45:26,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:45:26,875 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:45:26,876 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:45:26,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:45:26,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:45:26,876 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:45:26,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 22:45:26,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:45:26,876 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 22:45:26,877 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 22:45:26,877 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:45:26,877 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 22:45:26,877 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:45:26,877 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 22:45:26,877 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:45:26,877 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:45:26,877 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:45:26,878 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:45:26,878 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:45:26,878 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:45:26,878 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 22:45:26,879 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:45:26,879 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:45:26,879 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:45:26,879 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 22:45:26,879 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:45:26,879 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:45:26,879 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:45:26,880 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2023-02-15 22:45:27,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:45:27,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:45:27,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:45:27,105 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:45:27,105 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:45:27,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2023-02-15 22:45:28,148 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:45:28,275 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:45:28,276 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2023-02-15 22:45:28,280 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab8ddf777/92583773940943e98a04efef7ffcb592/FLAG095f1d1a9 [2023-02-15 22:45:28,302 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab8ddf777/92583773940943e98a04efef7ffcb592 [2023-02-15 22:45:28,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:45:28,304 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:45:28,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:45:28,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:45:28,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:45:28,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:45:28" (1/1) ... [2023-02-15 22:45:28,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b0a477b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:28, skipping insertion in model container [2023-02-15 22:45:28,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:45:28" (1/1) ... [2023-02-15 22:45:28,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:45:28,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:45:28,436 WARN L237 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-2a.c.cil.c[755,768] [2023-02-15 22:45:28,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:45:28,470 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:45:28,481 WARN L237 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-2a.c.cil.c[755,768] [2023-02-15 22:45:28,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:45:28,518 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:45:28,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:28 WrapperNode [2023-02-15 22:45:28,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:45:28,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:45:28,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:45:28,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:45:28,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:28" (1/1) ... [2023-02-15 22:45:28,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:28" (1/1) ... [2023-02-15 22:45:28,563 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53 [2023-02-15 22:45:28,563 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:45:28,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:45:28,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:45:28,564 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:45:28,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:28" (1/1) ... [2023-02-15 22:45:28,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:28" (1/1) ... [2023-02-15 22:45:28,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:28" (1/1) ... [2023-02-15 22:45:28,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:28" (1/1) ... [2023-02-15 22:45:28,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:28" (1/1) ... [2023-02-15 22:45:28,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:28" (1/1) ... [2023-02-15 22:45:28,585 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:28" (1/1) ... [2023-02-15 22:45:28,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:28" (1/1) ... [2023-02-15 22:45:28,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:45:28,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:45:28,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:45:28,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:45:28,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:28" (1/1) ... [2023-02-15 22:45:28,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:45:28,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:28,621 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) [2023-02-15 22:45:28,655 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 [2023-02-15 22:45:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:45:28,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:45:28,670 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 22:45:28,670 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 22:45:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:45:28,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:45:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2023-02-15 22:45:28,671 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2023-02-15 22:45:28,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 22:45:28,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 22:45:28,738 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:45:28,739 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:45:29,068 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:45:29,073 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:45:29,073 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 22:45:29,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:29 BoogieIcfgContainer [2023-02-15 22:45:29,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:45:29,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:45:29,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:45:29,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:45:29,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:45:28" (1/3) ... [2023-02-15 22:45:29,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea41d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:45:29, skipping insertion in model container [2023-02-15 22:45:29,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:28" (2/3) ... [2023-02-15 22:45:29,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea41d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:45:29, skipping insertion in model container [2023-02-15 22:45:29,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:29" (3/3) ... [2023-02-15 22:45:29,080 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2023-02-15 22:45:29,104 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:45:29,104 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-15 22:45:29,134 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:45:29,138 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@14ab2c54, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:45:29,138 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-15 22:45:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 78 states have (on average 1.6538461538461537) internal successors, (129), 94 states have internal predecessors, (129), 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) [2023-02-15 22:45:29,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 22:45:29,146 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:29,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:29,146 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:29,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1249151899, now seen corresponding path program 1 times [2023-02-15 22:45:29,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:29,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635165609] [2023-02-15 22:45:29,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:29,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:29,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:29,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635165609] [2023-02-15 22:45:29,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635165609] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:29,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:29,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:45:29,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380832999] [2023-02-15 22:45:29,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:29,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:29,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:29,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:29,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:45:29,312 INFO L87 Difference]: Start difference. First operand has 106 states, 78 states have (on average 1.6538461538461537) internal successors, (129), 94 states have internal predecessors, (129), 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 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) [2023-02-15 22:45:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:29,394 INFO L93 Difference]: Finished difference Result 257 states and 374 transitions. [2023-02-15 22:45:29,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:45:29,409 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 [2023-02-15 22:45:29,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:29,418 INFO L225 Difference]: With dead ends: 257 [2023-02-15 22:45:29,418 INFO L226 Difference]: Without dead ends: 144 [2023-02-15 22:45:29,423 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 [2023-02-15 22:45:29,425 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 83 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:29,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 367 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-15 22:45:29,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 134. [2023-02-15 22:45:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.5412844036697249) internal successors, (168), 123 states have internal predecessors, (168), 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) [2023-02-15 22:45:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 181 transitions. [2023-02-15 22:45:29,492 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 181 transitions. Word has length 9 [2023-02-15 22:45:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:29,492 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 181 transitions. [2023-02-15 22:45:29,493 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) [2023-02-15 22:45:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 181 transitions. [2023-02-15 22:45:29,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 22:45:29,494 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:29,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:29,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:45:29,495 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:29,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:29,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1533700389, now seen corresponding path program 1 times [2023-02-15 22:45:29,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:29,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607022079] [2023-02-15 22:45:29,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:29,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:29,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:29,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607022079] [2023-02-15 22:45:29,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607022079] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:29,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:29,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:29,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340505417] [2023-02-15 22:45:29,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:29,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:29,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:29,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:29,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:29,563 INFO L87 Difference]: Start difference. First operand 134 states and 181 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, (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) [2023-02-15 22:45:29,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:29,647 INFO L93 Difference]: Finished difference Result 257 states and 337 transitions. [2023-02-15 22:45:29,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:29,648 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, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-15 22:45:29,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:29,649 INFO L225 Difference]: With dead ends: 257 [2023-02-15 22:45:29,649 INFO L226 Difference]: Without dead ends: 162 [2023-02-15 22:45:29,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:45:29,651 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 128 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:29,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 447 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:29,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-02-15 22:45:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 143. [2023-02-15 22:45:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 118 states have (on average 1.5254237288135593) internal successors, (180), 132 states have internal predecessors, (180), 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) [2023-02-15 22:45:29,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 193 transitions. [2023-02-15 22:45:29,661 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 193 transitions. Word has length 14 [2023-02-15 22:45:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:29,661 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 193 transitions. [2023-02-15 22:45:29,661 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, (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) [2023-02-15 22:45:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 193 transitions. [2023-02-15 22:45:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:45:29,662 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:29,662 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:29,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:45:29,663 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:29,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:29,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1326976838, now seen corresponding path program 1 times [2023-02-15 22:45:29,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:29,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449122792] [2023-02-15 22:45:29,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:29,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:45:29,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:29,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449122792] [2023-02-15 22:45:29,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449122792] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:29,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:29,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:45:29,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232926867] [2023-02-15 22:45:29,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:29,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:45:29,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:29,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:45:29,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:45:29,696 INFO L87 Difference]: Start difference. First operand 143 states and 193 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:45:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:29,721 INFO L93 Difference]: Finished difference Result 149 states and 200 transitions. [2023-02-15 22:45:29,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:45:29,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-15 22:45:29,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:29,722 INFO L225 Difference]: With dead ends: 149 [2023-02-15 22:45:29,722 INFO L226 Difference]: Without dead ends: 148 [2023-02-15 22:45:29,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:45:29,724 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 4 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:29,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-15 22:45:29,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 141. [2023-02-15 22:45:29,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.5128205128205128) internal successors, (177), 130 states have internal predecessors, (177), 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) [2023-02-15 22:45:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 190 transitions. [2023-02-15 22:45:29,733 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 190 transitions. Word has length 16 [2023-02-15 22:45:29,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:29,734 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 190 transitions. [2023-02-15 22:45:29,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:45:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 190 transitions. [2023-02-15 22:45:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:45:29,735 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:29,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:29,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:45:29,735 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:29,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:29,736 INFO L85 PathProgramCache]: Analyzing trace with hash 300071915, now seen corresponding path program 1 times [2023-02-15 22:45:29,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:29,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845695605] [2023-02-15 22:45:29,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:29,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:29,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:29,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845695605] [2023-02-15 22:45:29,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845695605] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:29,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:29,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:29,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562031879] [2023-02-15 22:45:29,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:29,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:29,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:29,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:29,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:29,803 INFO L87 Difference]: Start difference. First operand 141 states and 190 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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) [2023-02-15 22:45:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:29,871 INFO L93 Difference]: Finished difference Result 167 states and 217 transitions. [2023-02-15 22:45:29,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:29,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-15 22:45:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:29,872 INFO L225 Difference]: With dead ends: 167 [2023-02-15 22:45:29,872 INFO L226 Difference]: Without dead ends: 165 [2023-02-15 22:45:29,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:45:29,873 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 105 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:29,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 452 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:29,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-15 22:45:29,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 141. [2023-02-15 22:45:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 117 states have (on average 1.4957264957264957) internal successors, (175), 130 states have internal predecessors, (175), 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) [2023-02-15 22:45:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 188 transitions. [2023-02-15 22:45:29,882 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 188 transitions. Word has length 15 [2023-02-15 22:45:29,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:29,882 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 188 transitions. [2023-02-15 22:45:29,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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) [2023-02-15 22:45:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 188 transitions. [2023-02-15 22:45:29,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:45:29,883 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:29,883 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:29,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:45:29,884 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:29,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:29,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1842018395, now seen corresponding path program 1 times [2023-02-15 22:45:29,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:29,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338256240] [2023-02-15 22:45:29,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:29,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:29,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:29,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:29,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338256240] [2023-02-15 22:45:29,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338256240] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:29,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:29,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:29,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204772253] [2023-02-15 22:45:29,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:29,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:29,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:29,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:29,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:29,926 INFO L87 Difference]: Start difference. First operand 141 states and 188 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:45:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:29,980 INFO L93 Difference]: Finished difference Result 199 states and 264 transitions. [2023-02-15 22:45:29,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:29,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-15 22:45:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:29,982 INFO L225 Difference]: With dead ends: 199 [2023-02-15 22:45:29,982 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 22:45:29,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:45:29,983 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 89 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:29,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 410 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:29,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 22:45:29,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 169. [2023-02-15 22:45:29,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 144 states have (on average 1.5138888888888888) internal successors, (218), 157 states have internal predecessors, (218), 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) [2023-02-15 22:45:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 231 transitions. [2023-02-15 22:45:29,991 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 231 transitions. Word has length 17 [2023-02-15 22:45:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:29,992 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 231 transitions. [2023-02-15 22:45:29,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:45:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 231 transitions. [2023-02-15 22:45:30,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:45:30,005 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:30,005 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:30,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:45:30,005 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:30,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:30,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1813391039, now seen corresponding path program 1 times [2023-02-15 22:45:30,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:30,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216141754] [2023-02-15 22:45:30,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:30,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:30,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:30,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216141754] [2023-02-15 22:45:30,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216141754] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:30,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:30,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:30,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564844645] [2023-02-15 22:45:30,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:30,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:30,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:30,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:30,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:30,042 INFO L87 Difference]: Start difference. First operand 169 states and 231 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:45:30,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:30,096 INFO L93 Difference]: Finished difference Result 197 states and 263 transitions. [2023-02-15 22:45:30,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:30,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-02-15 22:45:30,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:30,097 INFO L225 Difference]: With dead ends: 197 [2023-02-15 22:45:30,097 INFO L226 Difference]: Without dead ends: 194 [2023-02-15 22:45:30,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:45:30,098 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 87 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:30,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 411 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:30,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-15 22:45:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 173. [2023-02-15 22:45:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 161 states have internal predecessors, (222), 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) [2023-02-15 22:45:30,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 235 transitions. [2023-02-15 22:45:30,106 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 235 transitions. Word has length 17 [2023-02-15 22:45:30,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:30,106 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 235 transitions. [2023-02-15 22:45:30,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:45:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 235 transitions. [2023-02-15 22:45:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:45:30,107 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:30,107 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:30,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 22:45:30,108 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:30,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:30,108 INFO L85 PathProgramCache]: Analyzing trace with hash -205908396, now seen corresponding path program 1 times [2023-02-15 22:45:30,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:30,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649422777] [2023-02-15 22:45:30,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:30,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:30,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:30,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649422777] [2023-02-15 22:45:30,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649422777] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:30,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21287690] [2023-02-15 22:45:30,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:30,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:30,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:30,185 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) [2023-02-15 22:45:30,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 22:45:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:45:30,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:30,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:30,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21287690] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:30,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:45:30,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-02-15 22:45:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300348610] [2023-02-15 22:45:30,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:30,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:30,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:30,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:30,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:45:30,304 INFO L87 Difference]: Start difference. First operand 173 states and 235 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:30,339 INFO L93 Difference]: Finished difference Result 213 states and 286 transitions. [2023-02-15 22:45:30,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:45:30,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 22:45:30,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:30,341 INFO L225 Difference]: With dead ends: 213 [2023-02-15 22:45:30,341 INFO L226 Difference]: Without dead ends: 212 [2023-02-15 22:45:30,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:45:30,342 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 16 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:30,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 355 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:30,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-02-15 22:45:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 168. [2023-02-15 22:45:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 144 states have (on average 1.4861111111111112) internal successors, (214), 156 states have internal predecessors, (214), 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) [2023-02-15 22:45:30,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 227 transitions. [2023-02-15 22:45:30,354 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 227 transitions. Word has length 17 [2023-02-15 22:45:30,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:30,355 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 227 transitions. [2023-02-15 22:45:30,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 227 transitions. [2023-02-15 22:45:30,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 22:45:30,357 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:30,357 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:30,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:30,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:30,562 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:30,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1468255891, now seen corresponding path program 1 times [2023-02-15 22:45:30,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:30,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346544724] [2023-02-15 22:45:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:30,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:45:30,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:30,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346544724] [2023-02-15 22:45:30,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346544724] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:30,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:30,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:45:30,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665730021] [2023-02-15 22:45:30,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:30,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:30,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:30,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:30,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:45:30,623 INFO L87 Difference]: Start difference. First operand 168 states and 227 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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) [2023-02-15 22:45:30,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:30,660 INFO L93 Difference]: Finished difference Result 214 states and 285 transitions. [2023-02-15 22:45:30,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:45:30,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 19 [2023-02-15 22:45:30,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:30,661 INFO L225 Difference]: With dead ends: 214 [2023-02-15 22:45:30,662 INFO L226 Difference]: Without dead ends: 213 [2023-02-15 22:45:30,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:45:30,664 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 17 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:30,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 345 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:30,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-02-15 22:45:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 168. [2023-02-15 22:45:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 144 states have (on average 1.4722222222222223) internal successors, (212), 156 states have internal predecessors, (212), 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) [2023-02-15 22:45:30,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 225 transitions. [2023-02-15 22:45:30,675 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 225 transitions. Word has length 19 [2023-02-15 22:45:30,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:30,675 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 225 transitions. [2023-02-15 22:45:30,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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) [2023-02-15 22:45:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 225 transitions. [2023-02-15 22:45:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 22:45:30,678 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:30,679 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:30,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 22:45:30,679 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:30,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:30,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2043615112, now seen corresponding path program 1 times [2023-02-15 22:45:30,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:30,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728436492] [2023-02-15 22:45:30,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:30,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:45:30,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:30,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728436492] [2023-02-15 22:45:30,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728436492] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:30,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:30,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:30,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411180041] [2023-02-15 22:45:30,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:30,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:30,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:30,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:30,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:30,742 INFO L87 Difference]: Start difference. First operand 168 states and 225 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:45:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:30,799 INFO L93 Difference]: Finished difference Result 192 states and 256 transitions. [2023-02-15 22:45:30,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:30,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-15 22:45:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:30,801 INFO L225 Difference]: With dead ends: 192 [2023-02-15 22:45:30,801 INFO L226 Difference]: Without dead ends: 190 [2023-02-15 22:45:30,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:45:30,803 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 81 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:30,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 412 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:30,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-15 22:45:30,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 162. [2023-02-15 22:45:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.45) internal successors, (203), 150 states have internal predecessors, (203), 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) [2023-02-15 22:45:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 216 transitions. [2023-02-15 22:45:30,813 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 216 transitions. Word has length 24 [2023-02-15 22:45:30,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:30,814 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 216 transitions. [2023-02-15 22:45:30,814 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:45:30,814 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 216 transitions. [2023-02-15 22:45:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 22:45:30,815 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:30,815 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:30,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 22:45:30,815 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:30,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:30,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2072242468, now seen corresponding path program 1 times [2023-02-15 22:45:30,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:30,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643770524] [2023-02-15 22:45:30,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:30,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 22:45:30,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:30,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643770524] [2023-02-15 22:45:30,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643770524] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:30,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:30,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:30,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273343285] [2023-02-15 22:45:30,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:30,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:30,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:30,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:30,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:30,873 INFO L87 Difference]: Start difference. First operand 162 states and 216 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:45:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:30,920 INFO L93 Difference]: Finished difference Result 184 states and 244 transitions. [2023-02-15 22:45:30,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:45:30,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-15 22:45:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:30,922 INFO L225 Difference]: With dead ends: 184 [2023-02-15 22:45:30,922 INFO L226 Difference]: Without dead ends: 182 [2023-02-15 22:45:30,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:45:30,922 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 80 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:30,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 410 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:30,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-15 22:45:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 153. [2023-02-15 22:45:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 133 states have (on average 1.4360902255639099) internal successors, (191), 141 states have internal predecessors, (191), 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) [2023-02-15 22:45:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 204 transitions. [2023-02-15 22:45:30,931 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 204 transitions. Word has length 24 [2023-02-15 22:45:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:30,931 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 204 transitions. [2023-02-15 22:45:30,931 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, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:45:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 204 transitions. [2023-02-15 22:45:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 22:45:30,932 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:30,932 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:30,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 22:45:30,932 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:30,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:30,933 INFO L85 PathProgramCache]: Analyzing trace with hash 333453524, now seen corresponding path program 1 times [2023-02-15 22:45:30,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:30,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672583653] [2023-02-15 22:45:30,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:30,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:30,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:31,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:45:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:31,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:31,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672583653] [2023-02-15 22:45:31,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672583653] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:31,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922801001] [2023-02-15 22:45:31,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:31,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:31,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:31,028 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) [2023-02-15 22:45:31,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 22:45:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:31,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 22:45:31,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:31,123 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 22:45:31,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:31,243 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:31,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922801001] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:31,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:31,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 18 [2023-02-15 22:45:31,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388057018] [2023-02-15 22:45:31,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:31,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 22:45:31,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:31,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 22:45:31,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:45:31,246 INFO L87 Difference]: Start difference. First operand 153 states and 204 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 22:45:31,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:31,596 INFO L93 Difference]: Finished difference Result 443 states and 585 transitions. [2023-02-15 22:45:31,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 22:45:31,598 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2023-02-15 22:45:31,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:31,599 INFO L225 Difference]: With dead ends: 443 [2023-02-15 22:45:31,599 INFO L226 Difference]: Without dead ends: 295 [2023-02-15 22:45:31,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2023-02-15 22:45:31,600 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 205 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1618 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:31,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1618 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:45:31,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-02-15 22:45:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 134. [2023-02-15 22:45:31,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 110 states have (on average 1.4) internal successors, (154), 119 states have internal predecessors, (154), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-15 22:45:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 172 transitions. [2023-02-15 22:45:31,608 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 172 transitions. Word has length 30 [2023-02-15 22:45:31,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:31,608 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 172 transitions. [2023-02-15 22:45:31,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 14 states have internal predecessors, (30), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 22:45:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 172 transitions. [2023-02-15 22:45:31,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 22:45:31,609 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:31,609 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:31,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 22:45:31,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-15 22:45:31,814 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:31,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:31,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1702901583, now seen corresponding path program 1 times [2023-02-15 22:45:31,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:31,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078475032] [2023-02-15 22:45:31,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:31,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:31,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:31,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:31,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:45:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:31,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:31,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078475032] [2023-02-15 22:45:31,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078475032] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:31,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:31,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 22:45:31,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657759646] [2023-02-15 22:45:31,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:31,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:45:31,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:31,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:45:31,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:45:31,887 INFO L87 Difference]: Start difference. First operand 134 states and 172 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:31,972 INFO L93 Difference]: Finished difference Result 325 states and 416 transitions. [2023-02-15 22:45:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:45:31,972 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2023-02-15 22:45:31,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:31,973 INFO L225 Difference]: With dead ends: 325 [2023-02-15 22:45:31,974 INFO L226 Difference]: Without dead ends: 262 [2023-02-15 22:45:31,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:45:31,974 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 180 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:31,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 875 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-02-15 22:45:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 145. [2023-02-15 22:45:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 118 states have (on average 1.3728813559322033) internal successors, (162), 128 states have internal predecessors, (162), 10 states have call successors, (10), 7 states have call predecessors, (10), 9 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 22:45:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 184 transitions. [2023-02-15 22:45:31,981 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 184 transitions. Word has length 35 [2023-02-15 22:45:31,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:31,982 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 184 transitions. [2023-02-15 22:45:31,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:31,982 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 184 transitions. [2023-02-15 22:45:31,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:45:31,983 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:31,983 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:31,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 22:45:31,983 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:31,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:31,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1201405093, now seen corresponding path program 1 times [2023-02-15 22:45:31,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:31,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477905419] [2023-02-15 22:45:31,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:31,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-15 22:45:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-15 22:45:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:32,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:32,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477905419] [2023-02-15 22:45:32,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477905419] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:32,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200918461] [2023-02-15 22:45:32,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:32,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:32,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:32,057 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) [2023-02-15 22:45:32,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 22:45:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 22:45:32,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:32,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:32,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200918461] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:32,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:32,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2023-02-15 22:45:32,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938265822] [2023-02-15 22:45:32,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:32,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 22:45:32,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:32,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 22:45:32,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2023-02-15 22:45:32,324 INFO L87 Difference]: Start difference. First operand 145 states and 184 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-15 22:45:32,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:32,473 INFO L93 Difference]: Finished difference Result 317 states and 405 transitions. [2023-02-15 22:45:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:45:32,474 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Word has length 39 [2023-02-15 22:45:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:32,475 INFO L225 Difference]: With dead ends: 317 [2023-02-15 22:45:32,475 INFO L226 Difference]: Without dead ends: 239 [2023-02-15 22:45:32,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2023-02-15 22:45:32,476 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 433 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1723 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:32,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1723 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:32,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-02-15 22:45:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 132. [2023-02-15 22:45:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.3761467889908257) internal successors, (150), 118 states have internal predecessors, (150), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:45:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2023-02-15 22:45:32,484 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 39 [2023-02-15 22:45:32,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:32,484 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2023-02-15 22:45:32,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 17 states have internal predecessors, (47), 4 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-15 22:45:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2023-02-15 22:45:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:45:32,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:32,485 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:32,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:32,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:32,690 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:32,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:32,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1429626432, now seen corresponding path program 2 times [2023-02-15 22:45:32,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:32,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397540] [2023-02-15 22:45:32,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:32,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:45:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 22:45:32,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:32,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397540] [2023-02-15 22:45:32,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397540] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:32,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:32,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 22:45:32,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483951241] [2023-02-15 22:45:32,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:32,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:45:32,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:32,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:45:32,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:45:32,800 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:32,903 INFO L93 Difference]: Finished difference Result 301 states and 384 transitions. [2023-02-15 22:45:32,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:45:32,904 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-02-15 22:45:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:32,905 INFO L225 Difference]: With dead ends: 301 [2023-02-15 22:45:32,905 INFO L226 Difference]: Without dead ends: 242 [2023-02-15 22:45:32,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:45:32,906 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 229 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:32,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1150 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:32,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-02-15 22:45:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 193. [2023-02-15 22:45:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 165 states have (on average 1.406060606060606) internal successors, (232), 175 states have internal predecessors, (232), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-02-15 22:45:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 255 transitions. [2023-02-15 22:45:32,915 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 255 transitions. Word has length 39 [2023-02-15 22:45:32,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:32,915 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 255 transitions. [2023-02-15 22:45:32,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 255 transitions. [2023-02-15 22:45:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:45:32,915 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:32,916 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:32,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 22:45:32,916 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:32,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:32,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1429624510, now seen corresponding path program 1 times [2023-02-15 22:45:32,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:32,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693031869] [2023-02-15 22:45:32,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:32,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:33,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:33,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:33,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:45:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 22:45:33,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:33,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693031869] [2023-02-15 22:45:33,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693031869] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:33,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:33,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:45:33,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691653637] [2023-02-15 22:45:33,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:33,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:45:33,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:33,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:45:33,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:45:33,068 INFO L87 Difference]: Start difference. First operand 193 states and 255 transitions. Second operand has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:33,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:33,220 INFO L93 Difference]: Finished difference Result 389 states and 496 transitions. [2023-02-15 22:45:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:45:33,220 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-02-15 22:45:33,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:33,221 INFO L225 Difference]: With dead ends: 389 [2023-02-15 22:45:33,221 INFO L226 Difference]: Without dead ends: 327 [2023-02-15 22:45:33,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:45:33,223 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 336 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:33,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 1164 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:33,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-02-15 22:45:33,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 193. [2023-02-15 22:45:33,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 165 states have (on average 1.393939393939394) internal successors, (230), 175 states have internal predecessors, (230), 11 states have call successors, (11), 7 states have call predecessors, (11), 9 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-02-15 22:45:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 253 transitions. [2023-02-15 22:45:33,244 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 253 transitions. Word has length 39 [2023-02-15 22:45:33,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:33,244 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 253 transitions. [2023-02-15 22:45:33,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:33,245 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 253 transitions. [2023-02-15 22:45:33,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:45:33,245 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:33,245 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:33,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 22:45:33,245 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:33,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:33,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1372366208, now seen corresponding path program 1 times [2023-02-15 22:45:33,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:33,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505102300] [2023-02-15 22:45:33,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:33,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:33,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:33,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:33,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:45:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 22:45:33,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:33,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505102300] [2023-02-15 22:45:33,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505102300] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:33,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18665169] [2023-02-15 22:45:33,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:33,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:33,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:33,419 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:33,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 22:45:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:33,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:45:33,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 22:45:33,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 22:45:33,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18665169] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:33,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:33,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-02-15 22:45:33,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618614379] [2023-02-15 22:45:33,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:33,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 22:45:33,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:33,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 22:45:33,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:45:33,689 INFO L87 Difference]: Start difference. First operand 193 states and 253 transitions. Second operand has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:45:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:33,834 INFO L93 Difference]: Finished difference Result 494 states and 664 transitions. [2023-02-15 22:45:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:45:33,834 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2023-02-15 22:45:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:33,835 INFO L225 Difference]: With dead ends: 494 [2023-02-15 22:45:33,836 INFO L226 Difference]: Without dead ends: 386 [2023-02-15 22:45:33,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:45:33,836 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 297 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:33,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1114 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:33,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-02-15 22:45:33,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 286. [2023-02-15 22:45:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 248 states have (on average 1.3991935483870968) internal successors, (347), 259 states have internal predecessors, (347), 18 states have call successors, (18), 9 states have call predecessors, (18), 12 states have return successors, (22), 17 states have call predecessors, (22), 17 states have call successors, (22) [2023-02-15 22:45:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 387 transitions. [2023-02-15 22:45:33,847 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 387 transitions. Word has length 39 [2023-02-15 22:45:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:33,847 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 387 transitions. [2023-02-15 22:45:33,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:45:33,848 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 387 transitions. [2023-02-15 22:45:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 22:45:33,848 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:33,848 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:33,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:34,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-15 22:45:34,053 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:34,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:34,054 INFO L85 PathProgramCache]: Analyzing trace with hash -971407210, now seen corresponding path program 1 times [2023-02-15 22:45:34,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:34,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166139998] [2023-02-15 22:45:34,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:34,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:34,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:34,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:45:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:34,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:45:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:34,130 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:34,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:34,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166139998] [2023-02-15 22:45:34,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166139998] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:34,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:34,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 22:45:34,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873191378] [2023-02-15 22:45:34,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:34,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:45:34,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:34,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:45:34,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:45:34,131 INFO L87 Difference]: Start difference. First operand 286 states and 387 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:34,247 INFO L93 Difference]: Finished difference Result 626 states and 846 transitions. [2023-02-15 22:45:34,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 22:45:34,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2023-02-15 22:45:34,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:34,249 INFO L225 Difference]: With dead ends: 626 [2023-02-15 22:45:34,249 INFO L226 Difference]: Without dead ends: 556 [2023-02-15 22:45:34,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:45:34,250 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 332 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:34,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1446 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:34,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2023-02-15 22:45:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 324. [2023-02-15 22:45:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 283 states have (on average 1.3957597173144876) internal successors, (395), 293 states have internal predecessors, (395), 21 states have call successors, (21), 10 states have call predecessors, (21), 12 states have return successors, (24), 20 states have call predecessors, (24), 19 states have call successors, (24) [2023-02-15 22:45:34,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 440 transitions. [2023-02-15 22:45:34,262 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 440 transitions. Word has length 43 [2023-02-15 22:45:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:34,262 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 440 transitions. [2023-02-15 22:45:34,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 7 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 440 transitions. [2023-02-15 22:45:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 22:45:34,263 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:34,263 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:34,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 22:45:34,263 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:34,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:34,264 INFO L85 PathProgramCache]: Analyzing trace with hash -611040113, now seen corresponding path program 1 times [2023-02-15 22:45:34,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:34,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272698638] [2023-02-15 22:45:34,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:34,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:34,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:34,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:34,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 22:45:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:45:34,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:34,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272698638] [2023-02-15 22:45:34,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272698638] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:34,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:34,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 22:45:34,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826672271] [2023-02-15 22:45:34,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:34,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:45:34,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:34,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:45:34,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:45:34,443 INFO L87 Difference]: Start difference. First operand 324 states and 440 transitions. Second operand has 10 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:34,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:34,969 INFO L93 Difference]: Finished difference Result 411 states and 542 transitions. [2023-02-15 22:45:34,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:45:34,970 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2023-02-15 22:45:34,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:34,971 INFO L225 Difference]: With dead ends: 411 [2023-02-15 22:45:34,971 INFO L226 Difference]: Without dead ends: 410 [2023-02-15 22:45:34,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:45:34,971 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 273 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:34,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 1122 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:45:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2023-02-15 22:45:34,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 322. [2023-02-15 22:45:34,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 281 states have (on average 1.395017793594306) internal successors, (392), 291 states have internal predecessors, (392), 21 states have call successors, (21), 10 states have call predecessors, (21), 12 states have return successors, (24), 20 states have call predecessors, (24), 19 states have call successors, (24) [2023-02-15 22:45:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 437 transitions. [2023-02-15 22:45:34,985 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 437 transitions. Word has length 44 [2023-02-15 22:45:34,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:34,985 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 437 transitions. [2023-02-15 22:45:34,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:34,985 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 437 transitions. [2023-02-15 22:45:34,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 22:45:34,986 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:34,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:34,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 22:45:34,986 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:34,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:34,987 INFO L85 PathProgramCache]: Analyzing trace with hash 43110630, now seen corresponding path program 1 times [2023-02-15 22:45:34,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:34,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899520677] [2023-02-15 22:45:34,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:34,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:35,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:35,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:35,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:45:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:35,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:45:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:35,048 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:35,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:35,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899520677] [2023-02-15 22:45:35,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899520677] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:35,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116902321] [2023-02-15 22:45:35,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:35,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:35,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:35,066 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:35,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 22:45:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:35,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:45:35,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:35,139 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:35,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:35,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116902321] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:35,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:35,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2023-02-15 22:45:35,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126133556] [2023-02-15 22:45:35,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:35,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:45:35,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:35,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:45:35,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:45:35,211 INFO L87 Difference]: Start difference. First operand 322 states and 437 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-15 22:45:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:35,313 INFO L93 Difference]: Finished difference Result 529 states and 711 transitions. [2023-02-15 22:45:35,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:45:35,314 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 49 [2023-02-15 22:45:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:35,315 INFO L225 Difference]: With dead ends: 529 [2023-02-15 22:45:35,315 INFO L226 Difference]: Without dead ends: 452 [2023-02-15 22:45:35,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:45:35,316 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 258 mSDsluCounter, 1907 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:35,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 2117 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2023-02-15 22:45:35,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 352. [2023-02-15 22:45:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 308 states have (on average 1.3863636363636365) internal successors, (427), 316 states have internal predecessors, (427), 24 states have call successors, (24), 12 states have call predecessors, (24), 12 states have return successors, (25), 23 states have call predecessors, (25), 20 states have call successors, (25) [2023-02-15 22:45:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 476 transitions. [2023-02-15 22:45:35,333 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 476 transitions. Word has length 49 [2023-02-15 22:45:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:35,334 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 476 transitions. [2023-02-15 22:45:35,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 10 states have internal predecessors, (52), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2023-02-15 22:45:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 476 transitions. [2023-02-15 22:45:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 22:45:35,335 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:35,335 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:35,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 22:45:35,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:35,540 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:35,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:35,541 INFO L85 PathProgramCache]: Analyzing trace with hash 43112552, now seen corresponding path program 1 times [2023-02-15 22:45:35,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:35,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573612073] [2023-02-15 22:45:35,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:35,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:35,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:35,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:35,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:45:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:35,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:45:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:35,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:35,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573612073] [2023-02-15 22:45:35,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573612073] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:35,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902543834] [2023-02-15 22:45:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:35,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:35,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:35,721 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:35,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 22:45:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:35,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:45:35,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:35,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 22:45:35,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902543834] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:35,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:45:35,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 14 [2023-02-15 22:45:35,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891608105] [2023-02-15 22:45:35,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:35,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:35,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:35,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:35,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:45:35,887 INFO L87 Difference]: Start difference. First operand 352 states and 476 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:35,911 INFO L93 Difference]: Finished difference Result 494 states and 668 transitions. [2023-02-15 22:45:35,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:45:35,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2023-02-15 22:45:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:35,913 INFO L225 Difference]: With dead ends: 494 [2023-02-15 22:45:35,913 INFO L226 Difference]: Without dead ends: 334 [2023-02-15 22:45:35,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:45:35,914 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 59 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:35,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 220 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-02-15 22:45:35,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 327. [2023-02-15 22:45:35,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 289 states have (on average 1.3910034602076125) internal successors, (402), 298 states have internal predecessors, (402), 20 states have call successors, (20), 9 states have call predecessors, (20), 10 states have return successors, (21), 19 states have call predecessors, (21), 18 states have call successors, (21) [2023-02-15 22:45:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 443 transitions. [2023-02-15 22:45:35,931 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 443 transitions. Word has length 49 [2023-02-15 22:45:35,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:35,931 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 443 transitions. [2023-02-15 22:45:35,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 443 transitions. [2023-02-15 22:45:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 22:45:35,932 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:35,932 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:35,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 22:45:36,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:36,137 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:36,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:36,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1531983424, now seen corresponding path program 1 times [2023-02-15 22:45:36,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:36,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766533381] [2023-02-15 22:45:36,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:36,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:36,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:36,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:36,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 22:45:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:36,316 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:45:36,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:36,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766533381] [2023-02-15 22:45:36,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766533381] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:36,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:36,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 22:45:36,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625516821] [2023-02-15 22:45:36,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:36,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:45:36,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:36,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:45:36,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:45:36,318 INFO L87 Difference]: Start difference. First operand 327 states and 443 transitions. Second operand has 12 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:36,724 INFO L93 Difference]: Finished difference Result 861 states and 1184 transitions. [2023-02-15 22:45:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 22:45:36,725 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2023-02-15 22:45:36,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:36,727 INFO L225 Difference]: With dead ends: 861 [2023-02-15 22:45:36,727 INFO L226 Difference]: Without dead ends: 859 [2023-02-15 22:45:36,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2023-02-15 22:45:36,728 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 315 mSDsluCounter, 2600 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 2905 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:36,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 2905 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:45:36,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2023-02-15 22:45:36,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 440. [2023-02-15 22:45:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 393 states have (on average 1.4122137404580153) internal successors, (555), 403 states have internal predecessors, (555), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (29), 25 states have call predecessors, (29), 24 states have call successors, (29) [2023-02-15 22:45:36,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 610 transitions. [2023-02-15 22:45:36,745 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 610 transitions. Word has length 49 [2023-02-15 22:45:36,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:36,746 INFO L495 AbstractCegarLoop]: Abstraction has 440 states and 610 transitions. [2023-02-15 22:45:36,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:36,746 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 610 transitions. [2023-02-15 22:45:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 22:45:36,747 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:36,747 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:36,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 22:45:36,747 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:36,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:36,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1474725122, now seen corresponding path program 1 times [2023-02-15 22:45:36,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:36,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373684886] [2023-02-15 22:45:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:36,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:36,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:36,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 22:45:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:36,889 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:45:36,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:36,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373684886] [2023-02-15 22:45:36,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373684886] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:36,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111134241] [2023-02-15 22:45:36,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:36,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:36,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:36,891 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:36,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 22:45:36,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:36,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 22:45:36,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:45:37,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:45:37,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111134241] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:37,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:37,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 24 [2023-02-15 22:45:37,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358892808] [2023-02-15 22:45:37,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:37,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 22:45:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:37,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 22:45:37,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2023-02-15 22:45:37,506 INFO L87 Difference]: Start difference. First operand 440 states and 610 transitions. Second operand has 25 states, 24 states have (on average 3.0) internal successors, (72), 19 states have internal predecessors, (72), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 22:45:38,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:38,280 INFO L93 Difference]: Finished difference Result 1167 states and 1617 transitions. [2023-02-15 22:45:38,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 22:45:38,281 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 19 states have internal predecessors, (72), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 49 [2023-02-15 22:45:38,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:38,290 INFO L225 Difference]: With dead ends: 1167 [2023-02-15 22:45:38,290 INFO L226 Difference]: Without dead ends: 1036 [2023-02-15 22:45:38,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 22:45:38,292 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 440 mSDsluCounter, 3928 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 4196 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:38,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 4196 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:45:38,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2023-02-15 22:45:38,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 616. [2023-02-15 22:45:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 555 states have (on average 1.4234234234234233) internal successors, (790), 566 states have internal predecessors, (790), 36 states have call successors, (36), 14 states have call predecessors, (36), 17 states have return successors, (42), 35 states have call predecessors, (42), 34 states have call successors, (42) [2023-02-15 22:45:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 868 transitions. [2023-02-15 22:45:38,330 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 868 transitions. Word has length 49 [2023-02-15 22:45:38,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:38,331 INFO L495 AbstractCegarLoop]: Abstraction has 616 states and 868 transitions. [2023-02-15 22:45:38,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0) internal successors, (72), 19 states have internal predecessors, (72), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 22:45:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 868 transitions. [2023-02-15 22:45:38,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 22:45:38,332 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:38,332 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:38,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:38,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:38,545 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:38,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:38,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1383916122, now seen corresponding path program 1 times [2023-02-15 22:45:38,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:38,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628103510] [2023-02-15 22:45:38,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:38,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:38,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:38,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:38,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 22:45:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 22:45:38,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:38,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628103510] [2023-02-15 22:45:38,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628103510] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:38,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:38,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:38,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61280528] [2023-02-15 22:45:38,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:38,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:38,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:38,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:38,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:45:38,594 INFO L87 Difference]: Start difference. First operand 616 states and 868 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:38,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:38,638 INFO L93 Difference]: Finished difference Result 1018 states and 1429 transitions. [2023-02-15 22:45:38,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:45:38,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2023-02-15 22:45:38,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:38,640 INFO L225 Difference]: With dead ends: 1018 [2023-02-15 22:45:38,640 INFO L226 Difference]: Without dead ends: 648 [2023-02-15 22:45:38,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:45:38,641 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:38,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 325 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:38,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2023-02-15 22:45:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 632. [2023-02-15 22:45:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 571 states have (on average 1.4115586690017514) internal successors, (806), 582 states have internal predecessors, (806), 36 states have call successors, (36), 14 states have call predecessors, (36), 17 states have return successors, (42), 35 states have call predecessors, (42), 34 states have call successors, (42) [2023-02-15 22:45:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 884 transitions. [2023-02-15 22:45:38,669 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 884 transitions. Word has length 50 [2023-02-15 22:45:38,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:38,669 INFO L495 AbstractCegarLoop]: Abstraction has 632 states and 884 transitions. [2023-02-15 22:45:38,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 22:45:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 884 transitions. [2023-02-15 22:45:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 22:45:38,670 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:38,671 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:38,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 22:45:38,671 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:38,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:38,671 INFO L85 PathProgramCache]: Analyzing trace with hash 823690804, now seen corresponding path program 1 times [2023-02-15 22:45:38,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:38,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732829010] [2023-02-15 22:45:38,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:38,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:38,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:38,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:38,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:45:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:38,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:45:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:45:38,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:38,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732829010] [2023-02-15 22:45:38,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732829010] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:38,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342929231] [2023-02-15 22:45:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:38,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:38,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:38,771 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:38,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 22:45:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:38,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:45:38,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:38,899 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:45:38,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:45:38,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342929231] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:38,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:38,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2023-02-15 22:45:38,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286773914] [2023-02-15 22:45:38,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:38,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 22:45:38,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:38,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 22:45:38,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:45:38,962 INFO L87 Difference]: Start difference. First operand 632 states and 884 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 22:45:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:39,676 INFO L93 Difference]: Finished difference Result 1837 states and 2613 transitions. [2023-02-15 22:45:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 22:45:39,677 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 52 [2023-02-15 22:45:39,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:39,681 INFO L225 Difference]: With dead ends: 1837 [2023-02-15 22:45:39,681 INFO L226 Difference]: Without dead ends: 1609 [2023-02-15 22:45:39,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=965, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 22:45:39,683 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 702 mSDsluCounter, 3405 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:39,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 3726 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:45:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2023-02-15 22:45:39,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 631. [2023-02-15 22:45:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 570 states have (on average 1.4) internal successors, (798), 581 states have internal predecessors, (798), 36 states have call successors, (36), 14 states have call predecessors, (36), 17 states have return successors, (42), 35 states have call predecessors, (42), 34 states have call successors, (42) [2023-02-15 22:45:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 876 transitions. [2023-02-15 22:45:39,713 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 876 transitions. Word has length 52 [2023-02-15 22:45:39,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:39,714 INFO L495 AbstractCegarLoop]: Abstraction has 631 states and 876 transitions. [2023-02-15 22:45:39,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 13 states have internal predecessors, (55), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 22:45:39,714 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 876 transitions. [2023-02-15 22:45:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 22:45:39,715 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:39,715 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:39,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:39,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-15 22:45:39,920 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:39,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:39,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1045708328, now seen corresponding path program 1 times [2023-02-15 22:45:39,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:39,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681641222] [2023-02-15 22:45:39,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:39,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:39,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:39,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:39,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:40,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 22:45:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:40,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-15 22:45:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:45:40,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:40,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681641222] [2023-02-15 22:45:40,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681641222] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:40,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:40,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:45:40,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696140028] [2023-02-15 22:45:40,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:40,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:45:40,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:40,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:45:40,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:45:40,027 INFO L87 Difference]: Start difference. First operand 631 states and 876 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:40,112 INFO L93 Difference]: Finished difference Result 818 states and 1122 transitions. [2023-02-15 22:45:40,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:45:40,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2023-02-15 22:45:40,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:40,114 INFO L225 Difference]: With dead ends: 818 [2023-02-15 22:45:40,114 INFO L226 Difference]: Without dead ends: 714 [2023-02-15 22:45:40,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:45:40,115 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 113 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:40,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1037 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:40,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2023-02-15 22:45:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 652. [2023-02-15 22:45:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 589 states have (on average 1.3904923599320882) internal successors, (819), 598 states have internal predecessors, (819), 38 states have call successors, (38), 16 states have call predecessors, (38), 17 states have return successors, (42), 37 states have call predecessors, (42), 34 states have call successors, (42) [2023-02-15 22:45:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 899 transitions. [2023-02-15 22:45:40,185 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 899 transitions. Word has length 52 [2023-02-15 22:45:40,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:40,186 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 899 transitions. [2023-02-15 22:45:40,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 899 transitions. [2023-02-15 22:45:40,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 22:45:40,187 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:40,187 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:40,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-15 22:45:40,188 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:40,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:40,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1823069785, now seen corresponding path program 1 times [2023-02-15 22:45:40,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:40,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475719091] [2023-02-15 22:45:40,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:40,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:40,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:45:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:40,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-15 22:45:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:40,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-02-15 22:45:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:40,382 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:45:40,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:45:40,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475719091] [2023-02-15 22:45:40,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475719091] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:40,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924651547] [2023-02-15 22:45:40,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:40,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:45:40,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:40,395 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:45:40,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 22:45:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:40,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 22:45:40,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:45:40,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 22:45:41,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924651547] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:41,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:41,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 27 [2023-02-15 22:45:41,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174932832] [2023-02-15 22:45:41,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:41,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 22:45:41,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:45:41,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 22:45:41,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2023-02-15 22:45:41,229 INFO L87 Difference]: Start difference. First operand 652 states and 899 transitions. Second operand has 28 states, 27 states have (on average 3.259259259259259) internal successors, (88), 22 states have internal predecessors, (88), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 22:45:43,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:43,196 INFO L93 Difference]: Finished difference Result 1667 states and 2296 transitions. [2023-02-15 22:45:43,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-15 22:45:43,197 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.259259259259259) internal successors, (88), 22 states have internal predecessors, (88), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) Word has length 51 [2023-02-15 22:45:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:43,200 INFO L225 Difference]: With dead ends: 1667 [2023-02-15 22:45:43,200 INFO L226 Difference]: Without dead ends: 1484 [2023-02-15 22:45:43,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=351, Invalid=2729, Unknown=0, NotChecked=0, Total=3080 [2023-02-15 22:45:43,202 INFO L413 NwaCegarLoop]: 426 mSDtfsCounter, 756 mSDsluCounter, 7291 mSDsCounter, 0 mSdLazyCounter, 1719 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 7717 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:43,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 7717 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1719 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 22:45:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2023-02-15 22:45:43,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 646. [2023-02-15 22:45:43,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 583 states have (on average 1.3842195540308748) internal successors, (807), 592 states have internal predecessors, (807), 38 states have call successors, (38), 16 states have call predecessors, (38), 17 states have return successors, (42), 37 states have call predecessors, (42), 34 states have call successors, (42) [2023-02-15 22:45:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 887 transitions. [2023-02-15 22:45:43,236 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 887 transitions. Word has length 51 [2023-02-15 22:45:43,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:43,236 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 887 transitions. [2023-02-15 22:45:43,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.259259259259259) internal successors, (88), 22 states have internal predecessors, (88), 5 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 22:45:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 887 transitions. [2023-02-15 22:45:43,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 22:45:43,237 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:43,238 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:43,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-15 22:45:43,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-15 22:45:43,442 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:43,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:43,442 INFO L85 PathProgramCache]: Analyzing trace with hash 68846426, now seen corresponding path program 1 times [2023-02-15 22:45:43,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:45:43,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069740104] [2023-02-15 22:45:43,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:43,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:45:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:45:43,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 22:45:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:45:43,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 22:45:43,470 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 22:45:43,470 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-15 22:45:43,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-15 22:45:43,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-15 22:45:43,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-15 22:45:43,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-15 22:45:43,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-15 22:45:43,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-15 22:45:43,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-15 22:45:43,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-15 22:45:43,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-15 22:45:43,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-15 22:45:43,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-15 22:45:43,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-15 22:45:43,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-15 22:45:43,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-15 22:45:43,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-15 22:45:43,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-15 22:45:43,476 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:43,477 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 22:45:43,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:45:43 BoogieIcfgContainer [2023-02-15 22:45:43,503 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 22:45:43,503 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 22:45:43,503 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 22:45:43,503 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 22:45:43,504 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:29" (3/4) ... [2023-02-15 22:45:43,506 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 22:45:43,506 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 22:45:43,506 INFO L158 Benchmark]: Toolchain (without parser) took 15201.74ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 108.6MB in the beginning and 177.1MB in the end (delta: -68.5MB). Peak memory consumption was 105.4MB. Max. memory is 16.1GB. [2023-02-15 22:45:43,506 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 96.5MB. Free memory was 63.0MB in the beginning and 63.0MB in the end (delta: 24.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:45:43,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.44ms. Allocated memory is still 153.1MB. Free memory was 108.6MB in the beginning and 95.2MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 22:45:43,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.13ms. Allocated memory is still 153.1MB. Free memory was 95.2MB in the beginning and 93.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:45:43,507 INFO L158 Benchmark]: Boogie Preprocessor took 23.37ms. Allocated memory is still 153.1MB. Free memory was 93.6MB in the beginning and 91.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:45:43,507 INFO L158 Benchmark]: RCFGBuilder took 486.94ms. Allocated memory is still 153.1MB. Free memory was 91.9MB in the beginning and 122.0MB in the end (delta: -30.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2023-02-15 22:45:43,509 INFO L158 Benchmark]: TraceAbstraction took 14426.89ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 121.2MB in the beginning and 178.2MB in the end (delta: -56.9MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. [2023-02-15 22:45:43,509 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 323.0MB. Free memory was 178.2MB in the beginning and 177.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:45:43,517 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.13ms. Allocated memory is still 96.5MB. Free memory was 63.0MB in the beginning and 63.0MB in the end (delta: 24.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.44ms. Allocated memory is still 153.1MB. Free memory was 108.6MB in the beginning and 95.2MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.13ms. Allocated memory is still 153.1MB. Free memory was 95.2MB in the beginning and 93.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.37ms. Allocated memory is still 153.1MB. Free memory was 93.6MB in the beginning and 91.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 486.94ms. Allocated memory is still 153.1MB. Free memory was 91.9MB in the beginning and 122.0MB in the end (delta: -30.1MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14426.89ms. Allocated memory was 153.1MB in the beginning and 323.0MB in the end (delta: 169.9MB). Free memory was 121.2MB in the beginning and 178.2MB in the end (delta: -56.9MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 323.0MB. Free memory was 178.2MB in the beginning and 177.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 110]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 77, overapproximation of bitwiseAnd at line 109. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add1 ; [L234] unsigned int r_add2 ; [L235] unsigned int zero ; [L236] int tmp ; [L237] int tmp___0 ; [L238] int __retres14 ; VAL [ea=-127, eb=-128] [L242] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L81] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L242] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-127, eb=-128] [L242] zero = base2flt(0, 0) [L243] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=16777216] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L30] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L58] COND TRUE 1 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L60] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L77] m = m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L78] EXPR e + 128 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L78] res = m | ((unsigned int )(e + 128) << 24U) [L79] __retres4 = res VAL [\old(e)=-127, \old(m)=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L81] return (__retres4); VAL [\old(e)=-127, \old(m)=16777216, \result=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L243] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=16777216, ea=-127, eb=-128, ma=16777216, zero=0] [L243] a = base2flt(ma, ea) [L244] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-128, \old(m)=16777217] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L30] COND FALSE !(! m) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L36] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L58] COND TRUE 1 VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L60] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L77] m = m & ~ (1U << 24U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L78] EXPR e + 128 VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L78] res = m | ((unsigned int )(e + 128) << 24U) [L79] __retres4 = res VAL [\old(e)=-128, \old(m)=16777217, __retres4=16777217, e=-128, m=16777217, res=16777217] [L81] return (__retres4); VAL [\old(e)=-128, \old(m)=16777217, \result=-36028797002186751, __retres4=16777217, e=-128, m=16777217, res=16777217] [L244] RET, EXPR base2flt(mb, eb) VAL [a=16777216, base2flt(mb, eb)=-36028797002186751, ea=-127, eb=-128, ma=16777216, mb=16777217, zero=0] [L244] b = base2flt(mb, eb) [L245] CALL addflt(a, b) VAL [\old(a)=16777216, \old(b)=16777217] [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [\old(a)=16777216, \old(b)=16777217, a=16777216, b=16777217] [L95] COND TRUE a < b [L96] tmp = a [L97] a = b [L98] b = tmp VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, tmp=16777216] [L102] COND FALSE !(! b) VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, tmp=16777216] [L109] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, ma=0, tmp=16777216] [L110] (int )(a >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, ma=0, tmp=16777216] - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 71]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 78]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 110]: 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: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 134]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 142]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 142]: 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, 106 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5707 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5622 mSDsluCounter, 36291 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32081 mSDsCounter, 525 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6605 IncrementalHoareTripleChecker+Invalid, 7130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 525 mSolverCounterUnsat, 4210 mSDtfsCounter, 6605 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1147 GetRequests, 802 SyntacticMatches, 8 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=25, InterpolantAutomatonStates: 282, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 4083 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1307 NumberOfCodeBlocks, 1307 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1571 ConstructedInterpolants, 0 QuantifiedInterpolants, 6156 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1186 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 43 InterpolantComputations, 19 PerfectInterpolantSequences, 520/644 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 [2023-02-15 22:45:43,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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-2a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.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 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:45:45,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:45:45,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:45:45,532 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:45:45,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:45:45,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:45:45,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:45:45,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:45:45,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:45:45,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:45:45,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:45:45,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:45:45,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:45:45,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:45:45,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:45:45,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:45:45,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:45:45,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:45:45,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:45:45,558 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:45:45,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:45:45,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:45:45,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:45:45,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:45:45,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:45:45,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:45:45,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:45:45,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:45:45,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:45:45,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:45:45,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:45:45,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:45:45,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:45:45,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:45:45,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:45:45,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:45:45,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:45:45,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:45:45,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:45:45,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:45:45,572 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:45:45,575 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2023-02-15 22:45:45,599 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:45:45,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:45:45,601 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:45:45,601 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:45:45,601 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:45:45,601 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:45:45,602 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:45:45,602 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:45:45,602 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:45:45,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:45:45,603 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:45:45,603 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:45:45,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:45:45,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:45:45,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-15 22:45:45,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:45:45,604 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-15 22:45:45,604 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:45:45,604 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 22:45:45,604 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-15 22:45:45,604 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 22:45:45,604 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:45:45,605 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 22:45:45,605 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:45:45,605 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-15 22:45:45,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:45:45,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:45:45,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:45:45,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:45:45,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:45:45,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:45:45,606 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-15 22:45:45,606 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 22:45:45,606 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 22:45:45,606 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:45:45,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-15 22:45:45,607 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:45:45,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:45:45,607 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 22:45:45,607 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:45:45,607 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 2abfa4882ab8ec6bd7a33a5fbeaa8a88ba40a897019218fc162e52833c89454b [2023-02-15 22:45:45,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:45:45,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:45:45,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:45:45,897 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:45:45,899 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:45:45,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2023-02-15 22:45:47,027 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:45:47,219 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:45:47,219 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-2a.c.cil.c [2023-02-15 22:45:47,224 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baecaff02/b347ae4707934f3aa50464a0f13d0439/FLAG632d98682 [2023-02-15 22:45:47,235 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baecaff02/b347ae4707934f3aa50464a0f13d0439 [2023-02-15 22:45:47,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:45:47,237 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:45:47,239 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:45:47,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:45:47,249 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:45:47,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:45:47" (1/1) ... [2023-02-15 22:45:47,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@515d4128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:47, skipping insertion in model container [2023-02-15 22:45:47,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:45:47" (1/1) ... [2023-02-15 22:45:47,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:45:47,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:45:47,392 WARN L237 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-2a.c.cil.c[755,768] [2023-02-15 22:45:47,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:45:47,452 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:45:47,459 WARN L237 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-2a.c.cil.c[755,768] [2023-02-15 22:45:47,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:45:47,510 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:45:47,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:47 WrapperNode [2023-02-15 22:45:47,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:45:47,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:45:47,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:45:47,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:45:47,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:47" (1/1) ... [2023-02-15 22:45:47,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:47" (1/1) ... [2023-02-15 22:45:47,551 INFO L138 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2023-02-15 22:45:47,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:45:47,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:45:47,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:45:47,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:45:47,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:47" (1/1) ... [2023-02-15 22:45:47,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:47" (1/1) ... [2023-02-15 22:45:47,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:47" (1/1) ... [2023-02-15 22:45:47,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:47" (1/1) ... [2023-02-15 22:45:47,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:47" (1/1) ... [2023-02-15 22:45:47,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:47" (1/1) ... [2023-02-15 22:45:47,590 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:47" (1/1) ... [2023-02-15 22:45:47,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:47" (1/1) ... [2023-02-15 22:45:47,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:45:47,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:45:47,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:45:47,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:45:47,597 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:47" (1/1) ... [2023-02-15 22:45:47,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:45:47,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:45:47,620 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) [2023-02-15 22:45:47,639 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 [2023-02-15 22:45:47,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:45:47,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 22:45:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-15 22:45:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-15 22:45:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:45:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:45:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2023-02-15 22:45:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2023-02-15 22:45:47,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-15 22:45:47,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-15 22:45:47,727 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:45:47,728 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:45:47,931 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:45:47,935 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:45:47,935 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 22:45:47,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:47 BoogieIcfgContainer [2023-02-15 22:45:47,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:45:47,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:45:47,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:45:47,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:45:47,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:45:47" (1/3) ... [2023-02-15 22:45:47,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1c437c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:45:47, skipping insertion in model container [2023-02-15 22:45:47,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:45:47" (2/3) ... [2023-02-15 22:45:47,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e1c437c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:45:47, skipping insertion in model container [2023-02-15 22:45:47,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:47" (3/3) ... [2023-02-15 22:45:47,941 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-2a.c.cil.c [2023-02-15 22:45:47,951 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:45:47,952 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-15 22:45:47,989 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:45:47,993 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2fd02fb1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:45:47,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-15 22:45:47,999 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 56 states have (on average 1.625) internal successors, (91), 72 states have internal predecessors, (91), 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) [2023-02-15 22:45:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 22:45:48,003 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:48,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:48,004 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:48,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:48,008 INFO L85 PathProgramCache]: Analyzing trace with hash 915940719, now seen corresponding path program 1 times [2023-02-15 22:45:48,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:48,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235502039] [2023-02-15 22:45:48,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:48,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:48,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:48,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:48,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 22:45:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:48,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 22:45:48,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:48,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:48,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:48,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:48,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235502039] [2023-02-15 22:45:48,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235502039] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:48,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:48,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-15 22:45:48,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381648570] [2023-02-15 22:45:48,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:48,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 22:45:48,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:48,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 22:45:48,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:45:48,149 INFO L87 Difference]: Start difference. First operand has 84 states, 56 states have (on average 1.625) internal successors, (91), 72 states have internal predecessors, (91), 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, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:48,170 INFO L93 Difference]: Finished difference Result 156 states and 218 transitions. [2023-02-15 22:45:48,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 22:45:48,172 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 22:45:48,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:48,176 INFO L225 Difference]: With dead ends: 156 [2023-02-15 22:45:48,177 INFO L226 Difference]: Without dead ends: 65 [2023-02-15 22:45:48,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:45:48,182 INFO L413 NwaCegarLoop]: 92 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, 92 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 [2023-02-15 22:45:48,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:48,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-15 22:45:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-02-15 22:45:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.375) internal successors, (66), 55 states have internal predecessors, (66), 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) [2023-02-15 22:45:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2023-02-15 22:45:48,207 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 9 [2023-02-15 22:45:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:48,208 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2023-02-15 22:45:48,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2023-02-15 22:45:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 22:45:48,209 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:48,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:48,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 22:45:48,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:48,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:48,418 INFO L85 PathProgramCache]: Analyzing trace with hash 914999453, now seen corresponding path program 1 times [2023-02-15 22:45:48,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:48,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2006939084] [2023-02-15 22:45:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:48,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:48,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:48,420 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:48,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 22:45:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:48,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:45:48,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:48,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:48,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:48,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2006939084] [2023-02-15 22:45:48,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2006939084] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:48,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:48,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:45:48,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796579285] [2023-02-15 22:45:48,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:48,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:48,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:48,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:48,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:45:48,513 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:48,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:48,570 INFO L93 Difference]: Finished difference Result 135 states and 164 transitions. [2023-02-15 22:45:48,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:45:48,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 22:45:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:48,573 INFO L225 Difference]: With dead ends: 135 [2023-02-15 22:45:48,574 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 22:45:48,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:48,576 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 9 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:48,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 215 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:48,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 22:45:48,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2023-02-15 22:45:48,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 59 states have internal predecessors, (70), 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) [2023-02-15 22:45:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2023-02-15 22:45:48,591 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 9 [2023-02-15 22:45:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:48,593 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2023-02-15 22:45:48,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:45:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2023-02-15 22:45:48,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:45:48,594 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:48,594 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:48,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:48,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:48,802 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:48,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:48,802 INFO L85 PathProgramCache]: Analyzing trace with hash -459560941, now seen corresponding path program 1 times [2023-02-15 22:45:48,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:48,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638187378] [2023-02-15 22:45:48,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:48,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:48,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:48,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:48,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 22:45:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:48,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 22:45:48,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:45:48,887 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:48,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:48,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638187378] [2023-02-15 22:45:48,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638187378] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:48,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:48,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:45:48,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507164401] [2023-02-15 22:45:48,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:48,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:45:48,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:48,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:45:48,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:45:48,889 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:45:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:48,910 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2023-02-15 22:45:48,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:45:48,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-15 22:45:48,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:48,911 INFO L225 Difference]: With dead ends: 73 [2023-02-15 22:45:48,911 INFO L226 Difference]: Without dead ends: 72 [2023-02-15 22:45:48,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:45:48,912 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:48,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 147 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:48,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-02-15 22:45:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2023-02-15 22:45:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 58 states have internal predecessors, (69), 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) [2023-02-15 22:45:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2023-02-15 22:45:48,924 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 16 [2023-02-15 22:45:48,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:48,924 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2023-02-15 22:45:48,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:45:48,924 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2023-02-15 22:45:48,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 22:45:48,925 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:48,925 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:48,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-02-15 22:45:49,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:49,129 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:49,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1631017083, now seen corresponding path program 1 times [2023-02-15 22:45:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:49,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202199650] [2023-02-15 22:45:49,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:49,135 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:49,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:49,137 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:49,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 22:45:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:49,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 22:45:49,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:45:49,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:49,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:49,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202199650] [2023-02-15 22:45:49,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202199650] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:49,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:49,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:45:49,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330330259] [2023-02-15 22:45:49,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:49,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:45:49,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:49,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:45:49,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:45:49,240 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:45:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:49,265 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2023-02-15 22:45:49,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:45:49,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-15 22:45:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:49,266 INFO L225 Difference]: With dead ends: 72 [2023-02-15 22:45:49,268 INFO L226 Difference]: Without dead ends: 71 [2023-02-15 22:45:49,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:45:49,269 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:49,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 146 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-02-15 22:45:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2023-02-15 22:45:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 57 states have internal predecessors, (68), 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) [2023-02-15 22:45:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 81 transitions. [2023-02-15 22:45:49,276 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 81 transitions. Word has length 18 [2023-02-15 22:45:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:49,277 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 81 transitions. [2023-02-15 22:45:49,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:45:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 81 transitions. [2023-02-15 22:45:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 22:45:49,277 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:49,277 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:49,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-02-15 22:45:49,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:49,484 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:49,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:49,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1631084609, now seen corresponding path program 1 times [2023-02-15 22:45:49,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:49,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759282430] [2023-02-15 22:45:49,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:49,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:49,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:49,488 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:49,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 22:45:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:49,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:45:49,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:49,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:49,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:49,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759282430] [2023-02-15 22:45:49,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759282430] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:49,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:49,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:45:49,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338056999] [2023-02-15 22:45:49,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:49,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:49,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:49,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:49,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:45:49,559 INFO L87 Difference]: Start difference. First operand 68 states and 81 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:45:49,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:49,654 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2023-02-15 22:45:49,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:45:49,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-15 22:45:49,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:49,658 INFO L225 Difference]: With dead ends: 84 [2023-02-15 22:45:49,658 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 22:45:49,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:45:49,659 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 55 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:49,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 167 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:49,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 22:45:49,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 73. [2023-02-15 22:45:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 62 states have internal predecessors, (74), 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) [2023-02-15 22:45:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 87 transitions. [2023-02-15 22:45:49,665 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 87 transitions. Word has length 18 [2023-02-15 22:45:49,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:49,666 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 87 transitions. [2023-02-15 22:45:49,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:45:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 87 transitions. [2023-02-15 22:45:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 22:45:49,666 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:49,666 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:49,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-02-15 22:45:49,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:49,867 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:49,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:49,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1776660725, now seen corresponding path program 1 times [2023-02-15 22:45:49,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:49,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177987015] [2023-02-15 22:45:49,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:49,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:49,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:49,872 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:49,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 22:45:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:49,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:45:49,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:50,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:45:50,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:50,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:50,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177987015] [2023-02-15 22:45:50,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177987015] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:50,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:50,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:45:50,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492883363] [2023-02-15 22:45:50,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:50,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:45:50,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:50,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:45:50,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:45:50,566 INFO L87 Difference]: Start difference. First operand 73 states and 87 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-02-15 22:45:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:52,731 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2023-02-15 22:45:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:45:52,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 21 [2023-02-15 22:45:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:52,733 INFO L225 Difference]: With dead ends: 89 [2023-02-15 22:45:52,733 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 22:45:52,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:45:52,733 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 52 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:52,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 299 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-15 22:45:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 22:45:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2023-02-15 22:45:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 56 states have internal predecessors, (67), 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) [2023-02-15 22:45:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2023-02-15 22:45:52,740 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 21 [2023-02-15 22:45:52,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:52,740 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2023-02-15 22:45:52,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-02-15 22:45:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2023-02-15 22:45:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:45:52,748 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:52,748 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:52,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:52,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:52,955 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:52,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:52,955 INFO L85 PathProgramCache]: Analyzing trace with hash -595033411, now seen corresponding path program 1 times [2023-02-15 22:45:52,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:52,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939018434] [2023-02-15 22:45:52,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:52,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:52,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:52,957 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:52,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 22:45:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:52,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:45:52,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:53,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:53,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:53,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:53,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939018434] [2023-02-15 22:45:53,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939018434] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:53,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:53,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:45:53,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692336949] [2023-02-15 22:45:53,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:53,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:45:53,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:53,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:45:53,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:45:53,033 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:53,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:53,093 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2023-02-15 22:45:53,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:45:53,093 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2023-02-15 22:45:53,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:53,094 INFO L225 Difference]: With dead ends: 117 [2023-02-15 22:45:53,094 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 22:45:53,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:45:53,095 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 14 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:53,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 472 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 22:45:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2023-02-15 22:45:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.25) internal successors, (75), 65 states have internal predecessors, (75), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-15 22:45:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2023-02-15 22:45:53,103 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 37 [2023-02-15 22:45:53,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:53,103 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2023-02-15 22:45:53,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:53,104 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2023-02-15 22:45:53,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:45:53,104 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:53,104 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:53,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:53,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:53,311 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:53,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:53,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1830771986, now seen corresponding path program 1 times [2023-02-15 22:45:53,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:53,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270072065] [2023-02-15 22:45:53,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:53,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:53,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:53,313 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:53,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 22:45:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:53,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:45:53,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:53,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:53,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:53,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270072065] [2023-02-15 22:45:53,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270072065] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:53,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:45:53,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-02-15 22:45:53,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135037316] [2023-02-15 22:45:53,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:53,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:45:53,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:53,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:45:53,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:45:53,435 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:45:53,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:53,527 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2023-02-15 22:45:53,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:45:53,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2023-02-15 22:45:53,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:53,528 INFO L225 Difference]: With dead ends: 139 [2023-02-15 22:45:53,529 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 22:45:53,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:45:53,530 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 18 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:53,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 595 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 22:45:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2023-02-15 22:45:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 72 states have internal predecessors, (83), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 22:45:53,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2023-02-15 22:45:53,538 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 41 [2023-02-15 22:45:53,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:53,538 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2023-02-15 22:45:53,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:45:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2023-02-15 22:45:53,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 22:45:53,539 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:53,539 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:53,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:53,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:53,746 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:53,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:53,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1559170192, now seen corresponding path program 1 times [2023-02-15 22:45:53,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:53,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187990336] [2023-02-15 22:45:53,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:53,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:53,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:53,749 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:53,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 22:45:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:53,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:45:53,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:53,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:53,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:53,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187990336] [2023-02-15 22:45:53,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187990336] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:53,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:45:53,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-15 22:45:53,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701762465] [2023-02-15 22:45:53,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:53,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:45:53,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:53,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:45:53,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:45:53,885 INFO L87 Difference]: Start difference. First operand 88 states and 105 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 22:45:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:53,944 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2023-02-15 22:45:53,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:45:53,944 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2023-02-15 22:45:53,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:53,945 INFO L225 Difference]: With dead ends: 131 [2023-02-15 22:45:53,945 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 22:45:53,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:45:53,946 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 10 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:53,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 530 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:45:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 22:45:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2023-02-15 22:45:53,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.25) internal successors, (75), 65 states have internal predecessors, (75), 8 states have call successors, (8), 5 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:45:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2023-02-15 22:45:53,957 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 45 [2023-02-15 22:45:53,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:53,957 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2023-02-15 22:45:53,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 22:45:53,957 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2023-02-15 22:45:53,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 22:45:53,958 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:53,958 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:53,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:54,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:54,165 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:54,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1965949981, now seen corresponding path program 2 times [2023-02-15 22:45:54,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:54,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201179406] [2023-02-15 22:45:54,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:45:54,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:54,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:54,168 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:54,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 22:45:54,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-15 22:45:54,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:45:54,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:45:54,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 22:45:54,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:54,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:54,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201179406] [2023-02-15 22:45:54,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201179406] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:54,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:54,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 22:45:54,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333494483] [2023-02-15 22:45:54,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:54,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:45:54,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:54,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:45:54,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:45:54,289 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 10 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:54,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:54,495 INFO L93 Difference]: Finished difference Result 169 states and 206 transitions. [2023-02-15 22:45:54,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 22:45:54,495 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2023-02-15 22:45:54,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:54,496 INFO L225 Difference]: With dead ends: 169 [2023-02-15 22:45:54,501 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 22:45:54,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:45:54,502 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 110 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:54,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 795 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 22:45:54,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 106. [2023-02-15 22:45:54,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 89 states have internal predecessors, (103), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2023-02-15 22:45:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2023-02-15 22:45:54,510 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 45 [2023-02-15 22:45:54,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:54,510 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2023-02-15 22:45:54,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:54,510 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2023-02-15 22:45:54,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:45:54,511 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:54,511 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:54,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-02-15 22:45:54,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:54,717 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:54,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:54,718 INFO L85 PathProgramCache]: Analyzing trace with hash 814907427, now seen corresponding path program 1 times [2023-02-15 22:45:54,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:54,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302134222] [2023-02-15 22:45:54,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:54,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:54,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:54,720 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:54,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 22:45:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:54,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:45:54,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 22:45:54,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:54,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:54,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302134222] [2023-02-15 22:45:54,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302134222] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:54,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:54,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:45:54,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291957303] [2023-02-15 22:45:54,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:54,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:45:54,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:54,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:45:54,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:45:54,837 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand has 10 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:45:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:54,995 INFO L93 Difference]: Finished difference Result 222 states and 271 transitions. [2023-02-15 22:45:54,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:45:54,995 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2023-02-15 22:45:54,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:54,998 INFO L225 Difference]: With dead ends: 222 [2023-02-15 22:45:54,998 INFO L226 Difference]: Without dead ends: 165 [2023-02-15 22:45:54,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:45:54,999 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 60 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:55,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 870 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-15 22:45:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 155. [2023-02-15 22:45:55,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 124 states have (on average 1.217741935483871) internal successors, (151), 129 states have internal predecessors, (151), 18 states have call successors, (18), 8 states have call predecessors, (18), 9 states have return successors, (21), 17 states have call predecessors, (21), 16 states have call successors, (21) [2023-02-15 22:45:55,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 190 transitions. [2023-02-15 22:45:55,018 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 190 transitions. Word has length 46 [2023-02-15 22:45:55,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:55,018 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 190 transitions. [2023-02-15 22:45:55,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:45:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 190 transitions. [2023-02-15 22:45:55,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:45:55,019 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:55,019 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:55,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:55,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:55,226 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:55,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:55,226 INFO L85 PathProgramCache]: Analyzing trace with hash 228101413, now seen corresponding path program 1 times [2023-02-15 22:45:55,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:55,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748563517] [2023-02-15 22:45:55,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:55,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:55,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:55,228 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:55,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 22:45:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:55,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:45:55,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 22:45:55,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:55,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:55,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748563517] [2023-02-15 22:45:55,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748563517] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:55,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:55,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 22:45:55,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335974722] [2023-02-15 22:45:55,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:55,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:45:55,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:55,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:45:55,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:45:55,362 INFO L87 Difference]: Start difference. First operand 155 states and 190 transitions. Second operand has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:45:55,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:55,496 INFO L93 Difference]: Finished difference Result 173 states and 206 transitions. [2023-02-15 22:45:55,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:45:55,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2023-02-15 22:45:55,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:55,497 INFO L225 Difference]: With dead ends: 173 [2023-02-15 22:45:55,497 INFO L226 Difference]: Without dead ends: 114 [2023-02-15 22:45:55,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:45:55,498 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 71 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:55,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 742 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:55,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-15 22:45:55,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2023-02-15 22:45:55,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 84 states have (on average 1.2380952380952381) internal successors, (104), 90 states have internal predecessors, (104), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2023-02-15 22:45:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2023-02-15 22:45:55,504 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 46 [2023-02-15 22:45:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:55,504 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2023-02-15 22:45:55,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:45:55,505 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2023-02-15 22:45:55,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 22:45:55,505 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:55,505 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:55,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:55,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:55,714 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:55,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:55,715 INFO L85 PathProgramCache]: Analyzing trace with hash -740435001, now seen corresponding path program 1 times [2023-02-15 22:45:55,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:55,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131856338] [2023-02-15 22:45:55,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:55,715 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:55,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:55,716 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:55,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 22:45:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:55,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 22:45:55,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:45:55,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:45:55,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:55,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131856338] [2023-02-15 22:45:55,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131856338] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:55,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:45:55,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-02-15 22:45:55,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498052469] [2023-02-15 22:45:55,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:55,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:45:55,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:55,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:45:55,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:45:55,919 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:56,003 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2023-02-15 22:45:56,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:45:56,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2023-02-15 22:45:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:56,005 INFO L225 Difference]: With dead ends: 114 [2023-02-15 22:45:56,005 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 22:45:56,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:45:56,005 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 19 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:56,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 175 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:56,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 22:45:56,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2023-02-15 22:45:56,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 89 states have internal predecessors, (103), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2023-02-15 22:45:56,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 130 transitions. [2023-02-15 22:45:56,012 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 130 transitions. Word has length 47 [2023-02-15 22:45:56,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:56,012 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 130 transitions. [2023-02-15 22:45:56,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-15 22:45:56,012 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 130 transitions. [2023-02-15 22:45:56,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-15 22:45:56,014 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:56,014 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:56,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:56,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:56,214 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:56,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:56,215 INFO L85 PathProgramCache]: Analyzing trace with hash 455638881, now seen corresponding path program 1 times [2023-02-15 22:45:56,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:56,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112047451] [2023-02-15 22:45:56,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:56,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:56,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:56,217 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:56,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 22:45:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:56,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:45:56,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:56,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:45:56,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:56,311 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:56,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112047451] [2023-02-15 22:45:56,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112047451] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:56,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:56,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 22:45:56,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110864146] [2023-02-15 22:45:56,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:56,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:45:56,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:56,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:45:56,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:45:56,313 INFO L87 Difference]: Start difference. First operand 107 states and 130 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:45:56,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:56,414 INFO L93 Difference]: Finished difference Result 153 states and 180 transitions. [2023-02-15 22:45:56,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:45:56,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2023-02-15 22:45:56,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:56,416 INFO L225 Difference]: With dead ends: 153 [2023-02-15 22:45:56,416 INFO L226 Difference]: Without dead ends: 102 [2023-02-15 22:45:56,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:45:56,417 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 14 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:56,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 568 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:56,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-15 22:45:56,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2023-02-15 22:45:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 80 states have internal predecessors, (93), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-02-15 22:45:56,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2023-02-15 22:45:56,422 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 50 [2023-02-15 22:45:56,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:56,423 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2023-02-15 22:45:56,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 7 states have internal predecessors, (35), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:45:56,423 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2023-02-15 22:45:56,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 22:45:56,423 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:56,423 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:56,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:56,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:56,630 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:56,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:56,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1478648391, now seen corresponding path program 1 times [2023-02-15 22:45:56,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:56,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212919287] [2023-02-15 22:45:56,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:56,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:56,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:56,633 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:56,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-15 22:45:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:56,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 22:45:56,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:45:56,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:45:56,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:56,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212919287] [2023-02-15 22:45:56,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212919287] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:56,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:45:56,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2023-02-15 22:45:56,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580140319] [2023-02-15 22:45:56,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:56,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:56,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:56,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:56,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:45:56,814 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:56,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:56,890 INFO L93 Difference]: Finished difference Result 110 states and 131 transitions. [2023-02-15 22:45:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:45:56,891 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2023-02-15 22:45:56,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:56,892 INFO L225 Difference]: With dead ends: 110 [2023-02-15 22:45:56,892 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 22:45:56,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:45:56,892 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 38 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:56,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 168 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:56,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 22:45:56,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2023-02-15 22:45:56,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 79 states have internal predecessors, (91), 11 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-02-15 22:45:56,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 114 transitions. [2023-02-15 22:45:56,898 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 114 transitions. Word has length 48 [2023-02-15 22:45:56,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:56,898 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 114 transitions. [2023-02-15 22:45:56,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2023-02-15 22:45:56,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 22:45:56,899 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:56,899 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:56,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:57,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:57,106 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:57,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:57,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1628912936, now seen corresponding path program 1 times [2023-02-15 22:45:57,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:57,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282243827] [2023-02-15 22:45:57,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:57,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:57,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:57,121 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:57,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 22:45:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:57,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:45:57,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:57,302 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:45:57,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:57,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:57,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282243827] [2023-02-15 22:45:57,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282243827] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:45:57,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1461130777] [2023-02-15 22:45:57,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:57,400 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:45:57,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:45:57,413 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:45:57,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-02-15 22:45:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:57,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:45:57,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:45:57,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:45:57,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1461130777] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:57,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:45:57,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 12 [2023-02-15 22:45:57,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799541080] [2023-02-15 22:45:57,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:57,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:45:57,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:57,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:45:57,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:45:57,576 INFO L87 Difference]: Start difference. First operand 95 states and 114 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:45:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:57,797 INFO L93 Difference]: Finished difference Result 169 states and 204 transitions. [2023-02-15 22:45:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:45:57,797 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2023-02-15 22:45:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:57,798 INFO L225 Difference]: With dead ends: 169 [2023-02-15 22:45:57,798 INFO L226 Difference]: Without dead ends: 137 [2023-02-15 22:45:57,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 158 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:45:57,799 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:57,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 936 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:45:57,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-15 22:45:57,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2023-02-15 22:45:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.198019801980198) internal successors, (121), 104 states have internal predecessors, (121), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2023-02-15 22:45:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 152 transitions. [2023-02-15 22:45:57,812 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 152 transitions. Word has length 55 [2023-02-15 22:45:57,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:57,812 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 152 transitions. [2023-02-15 22:45:57,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:45:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 152 transitions. [2023-02-15 22:45:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 22:45:57,813 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:57,813 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:57,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-02-15 22:45:58,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:58,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:45:58,221 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:58,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:58,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1769714002, now seen corresponding path program 1 times [2023-02-15 22:45:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:58,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106887705] [2023-02-15 22:45:58,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:58,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:58,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:58,224 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:58,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-15 22:45:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:58,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 22:45:58,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 22:45:58,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:58,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:58,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106887705] [2023-02-15 22:45:58,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106887705] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:58,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:58,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:45:58,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262048430] [2023-02-15 22:45:58,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:58,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:45:58,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:58,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:45:58,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:45:58,314 INFO L87 Difference]: Start difference. First operand 125 states and 152 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:58,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:58,546 INFO L93 Difference]: Finished difference Result 139 states and 167 transitions. [2023-02-15 22:45:58,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:45:58,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2023-02-15 22:45:58,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:58,548 INFO L225 Difference]: With dead ends: 139 [2023-02-15 22:45:58,548 INFO L226 Difference]: Without dead ends: 137 [2023-02-15 22:45:58,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:45:58,548 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 8 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:58,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 120 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:45:58,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-02-15 22:45:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2023-02-15 22:45:58,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.1826923076923077) internal successors, (123), 106 states have internal predecessors, (123), 16 states have call successors, (16), 6 states have call predecessors, (16), 7 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2023-02-15 22:45:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions. [2023-02-15 22:45:58,556 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 57 [2023-02-15 22:45:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:58,556 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 156 transitions. [2023-02-15 22:45:58,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:45:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions. [2023-02-15 22:45:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 22:45:58,558 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:58,558 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:58,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-02-15 22:45:58,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:58,765 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:58,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:58,766 INFO L85 PathProgramCache]: Analyzing trace with hash -657383583, now seen corresponding path program 1 times [2023-02-15 22:45:58,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:58,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1397206104] [2023-02-15 22:45:58,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:58,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:58,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:58,768 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:58,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-15 22:45:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:58,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 22:45:58,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:58,864 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:45:58,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-15 22:45:58,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:58,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1397206104] [2023-02-15 22:45:58,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1397206104] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:58,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:45:58,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2023-02-15 22:45:58,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772362074] [2023-02-15 22:45:58,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:58,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 22:45:58,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:58,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 22:45:58,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:45:58,965 INFO L87 Difference]: Start difference. First operand 128 states and 156 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 22:45:59,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:59,102 INFO L93 Difference]: Finished difference Result 177 states and 211 transitions. [2023-02-15 22:45:59,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:45:59,104 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) Word has length 63 [2023-02-15 22:45:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:59,104 INFO L225 Difference]: With dead ends: 177 [2023-02-15 22:45:59,105 INFO L226 Difference]: Without dead ends: 133 [2023-02-15 22:45:59,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:45:59,105 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 53 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:59,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 812 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:59,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-15 22:45:59,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 122. [2023-02-15 22:45:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 99 states have (on average 1.1717171717171717) internal successors, (116), 101 states have internal predecessors, (116), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2023-02-15 22:45:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2023-02-15 22:45:59,120 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 63 [2023-02-15 22:45:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:59,120 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2023-02-15 22:45:59,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 11 states have internal predecessors, (55), 5 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-15 22:45:59,121 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2023-02-15 22:45:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 22:45:59,121 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:59,121 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:59,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:59,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:59,330 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:59,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:59,331 INFO L85 PathProgramCache]: Analyzing trace with hash 7672150, now seen corresponding path program 1 times [2023-02-15 22:45:59,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:59,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525385139] [2023-02-15 22:45:59,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:59,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:59,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:59,337 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:59,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-15 22:45:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:59,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 22:45:59,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:45:59,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:45:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-15 22:45:59,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:59,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525385139] [2023-02-15 22:45:59,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525385139] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:45:59,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:45:59,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2023-02-15 22:45:59,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523573639] [2023-02-15 22:45:59,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:45:59,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:45:59,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:59,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:45:59,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:45:59,485 INFO L87 Difference]: Start difference. First operand 122 states and 147 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 22:45:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:45:59,599 INFO L93 Difference]: Finished difference Result 222 states and 263 transitions. [2023-02-15 22:45:59,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:45:59,601 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2023-02-15 22:45:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:45:59,602 INFO L225 Difference]: With dead ends: 222 [2023-02-15 22:45:59,602 INFO L226 Difference]: Without dead ends: 174 [2023-02-15 22:45:59,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:45:59,603 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 60 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:45:59,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 576 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:45:59,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-02-15 22:45:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 123. [2023-02-15 22:45:59,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 100 states have (on average 1.16) internal successors, (116), 102 states have internal predecessors, (116), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2023-02-15 22:45:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2023-02-15 22:45:59,611 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 71 [2023-02-15 22:45:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:45:59,611 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2023-02-15 22:45:59,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-15 22:45:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2023-02-15 22:45:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 22:45:59,612 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:45:59,612 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:45:59,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-15 22:45:59,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:59,819 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-15 22:45:59,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:45:59,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1027892857, now seen corresponding path program 1 times [2023-02-15 22:45:59,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:45:59,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653417696] [2023-02-15 22:45:59,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:45:59,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:45:59,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:45:59,821 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:45:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:45:59,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-15 22:45:59,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:45:59,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:45:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-15 22:45:59,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:45:59,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:45:59,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653417696] [2023-02-15 22:45:59,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653417696] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:45:59,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:45:59,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:45:59,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916099932] [2023-02-15 22:45:59,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:45:59,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:45:59,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:45:59,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:45:59,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:45:59,947 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:46:00,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:46:00,355 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2023-02-15 22:46:00,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:46:00,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 65 [2023-02-15 22:46:00,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:46:00,356 INFO L225 Difference]: With dead ends: 141 [2023-02-15 22:46:00,356 INFO L226 Difference]: Without dead ends: 0 [2023-02-15 22:46:00,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:46:00,357 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 13 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:46:00,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 190 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:46:00,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-15 22:46:00,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-15 22:46:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:46:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-15 22:46:00,357 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2023-02-15 22:46:00,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:46:00,358 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-15 22:46:00,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:46:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-15 22:46:00,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-15 22:46:00,359 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-15 22:46:00,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-15 22:46:00,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-15 22:46:00,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-15 22:46:00,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-15 22:46:00,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-15 22:46:00,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-15 22:46:00,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-15 22:46:00,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-15 22:46:00,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-15 22:46:00,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-15 22:46:00,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-15 22:46:00,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-15 22:46:00,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-15 22:46:00,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-15 22:46:00,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-15 22:46:00,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-02-15 22:46:00,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:46:00,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-15 22:46:05,756 INFO L899 garLoopResultBuilder]: For program point L60(lines 58 73) no Hoare annotation was computed. [2023-02-15 22:46:05,756 INFO L899 garLoopResultBuilder]: For program point base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 46) no Hoare annotation was computed. [2023-02-15 22:46:05,756 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2023-02-15 22:46:05,756 INFO L895 garLoopResultBuilder]: At program point L48-1(lines 38 53) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))))) (and (or .cse0 (not (= |base2flt_#in~m| (_ bv0 32)))) (or .cse0 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) [2023-02-15 22:46:05,756 INFO L899 garLoopResultBuilder]: For program point base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2023-02-15 22:46:05,756 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 76) no Hoare annotation was computed. [2023-02-15 22:46:05,756 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-02-15 22:46:05,756 INFO L899 garLoopResultBuilder]: For program point base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2023-02-15 22:46:05,757 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2023-02-15 22:46:05,757 INFO L895 garLoopResultBuilder]: At program point L74(lines 36 76) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))))) (and (or .cse0 (not (= |base2flt_#in~m| (_ bv0 32)))) (or .cse0 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) [2023-02-15 22:46:05,757 INFO L895 garLoopResultBuilder]: At program point L58-2(lines 58 73) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))))) (and (or .cse0 (not (= |base2flt_#in~m| (_ bv0 32)))) (or .cse0 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) [2023-02-15 22:46:05,757 INFO L899 garLoopResultBuilder]: For program point base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 71) no Hoare annotation was computed. [2023-02-15 22:46:05,757 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-02-15 22:46:05,757 INFO L899 garLoopResultBuilder]: For program point base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 78) no Hoare annotation was computed. [2023-02-15 22:46:05,757 INFO L899 garLoopResultBuilder]: For program point L46-1(line 46) no Hoare annotation was computed. [2023-02-15 22:46:05,757 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 25 83) the Hoare annotation is: true [2023-02-15 22:46:05,757 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-02-15 22:46:05,757 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-02-15 22:46:05,757 INFO L899 garLoopResultBuilder]: For program point base2fltFINAL(lines 25 83) no Hoare annotation was computed. [2023-02-15 22:46:05,757 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 35) no Hoare annotation was computed. [2023-02-15 22:46:05,757 INFO L899 garLoopResultBuilder]: For program point L59(lines 58 73) no Hoare annotation was computed. [2023-02-15 22:46:05,757 INFO L899 garLoopResultBuilder]: For program point base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 46) no Hoare annotation was computed. [2023-02-15 22:46:05,757 INFO L899 garLoopResultBuilder]: For program point base2fltEXIT(lines 25 83) no Hoare annotation was computed. [2023-02-15 22:46:05,757 INFO L895 garLoopResultBuilder]: At program point L80(lines 29 82) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))))) (and (or .cse0 (not (= |base2flt_#in~m| (_ bv0 32))) (and (= base2flt_~m (_ bv0 32)) (= base2flt_~__retres4~0 (_ bv0 32)))) (or .cse0 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) [2023-02-15 22:46:05,758 INFO L899 garLoopResultBuilder]: For program point L39(lines 38 53) no Hoare annotation was computed. [2023-02-15 22:46:05,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-15 22:46:05,758 INFO L899 garLoopResultBuilder]: For program point L248(lines 248 257) no Hoare annotation was computed. [2023-02-15 22:46:05,758 INFO L902 garLoopResultBuilder]: At program point L246(line 246) the Hoare annotation is: true [2023-02-15 22:46:05,758 INFO L902 garLoopResultBuilder]: At program point L248-2(lines 248 257) the Hoare annotation is: true [2023-02-15 22:46:05,758 INFO L899 garLoopResultBuilder]: For program point L246-1(line 246) no Hoare annotation was computed. [2023-02-15 22:46:05,758 INFO L902 garLoopResultBuilder]: At program point L244(line 244) the Hoare annotation is: true [2023-02-15 22:46:05,758 INFO L899 garLoopResultBuilder]: For program point L244-1(line 244) no Hoare annotation was computed. [2023-02-15 22:46:05,758 INFO L902 garLoopResultBuilder]: At program point L242(line 242) the Hoare annotation is: true [2023-02-15 22:46:05,758 INFO L899 garLoopResultBuilder]: For program point L242-1(line 242) no Hoare annotation was computed. [2023-02-15 22:46:05,758 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-15 22:46:05,758 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 226 264) the Hoare annotation is: true [2023-02-15 22:46:05,758 INFO L899 garLoopResultBuilder]: For program point L259(line 259) no Hoare annotation was computed. [2023-02-15 22:46:05,758 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-15 22:46:05,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-15 22:46:05,758 INFO L899 garLoopResultBuilder]: For program point L251(lines 251 255) no Hoare annotation was computed. [2023-02-15 22:46:05,758 INFO L899 garLoopResultBuilder]: For program point L251-2(lines 251 255) no Hoare annotation was computed. [2023-02-15 22:46:05,758 INFO L902 garLoopResultBuilder]: At program point L245(line 245) the Hoare annotation is: true [2023-02-15 22:46:05,758 INFO L899 garLoopResultBuilder]: For program point L245-1(line 245) no Hoare annotation was computed. [2023-02-15 22:46:05,758 INFO L902 garLoopResultBuilder]: At program point L243(line 243) the Hoare annotation is: true [2023-02-15 22:46:05,758 INFO L899 garLoopResultBuilder]: For program point L243-1(line 243) no Hoare annotation was computed. [2023-02-15 22:46:05,759 INFO L899 garLoopResultBuilder]: For program point addfltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 113) no Hoare annotation was computed. [2023-02-15 22:46:05,759 INFO L899 garLoopResultBuilder]: For program point addfltFINAL(lines 84 148) no Hoare annotation was computed. [2023-02-15 22:46:05,759 INFO L899 garLoopResultBuilder]: For program point addfltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 134) no Hoare annotation was computed. [2023-02-15 22:46:05,759 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2023-02-15 22:46:05,759 INFO L899 garLoopResultBuilder]: For program point L110-1(line 110) no Hoare annotation was computed. [2023-02-15 22:46:05,759 INFO L899 garLoopResultBuilder]: For program point L127(lines 127 138) no Hoare annotation was computed. [2023-02-15 22:46:05,759 INFO L899 garLoopResultBuilder]: For program point addfltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 113) no Hoare annotation was computed. [2023-02-15 22:46:05,759 INFO L895 garLoopResultBuilder]: At program point L127-2(lines 127 138) the Hoare annotation is: (let ((.cse1 (not (= (bvadd |addflt_#in~b| (_ bv1 32)) (_ bv0 32)))) (.cse0 (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32)))) (.cse2 (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32))) (.cse4 (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv128 32)) (bvlshr addflt_~a (_ bv24 32))))) (.cse3 (bvadd ((_ sign_extend 1) addflt_~ea~0) (bvneg ((_ sign_extend 1) addflt_~eb~0))))) (and (or .cse0 .cse1 (= addflt_~eb~0 (_ bv127 32))) (or (and .cse2 (= addflt_~ea~0 (_ bv127 32)) (bvsle .cse3 (_ bv2147483647 33))) .cse1) (or .cse0 (and .cse2 (bvult (bvadd addflt_~ea~0 (_ bv4294967169 32)) (_ bv32 32)) .cse4 (= addflt_~b |addflt_#in~b|))) (let ((.cse5 (bvsle (_ bv6442450944 33) .cse3)) (.cse6 (or (= (_ bv0 32) |addflt_#in~b|) (not (= (_ bv0 32) addflt_~b))))) (or (and .cse5 .cse6 (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv127 32)) (bvlshr addflt_~a (_ bv24 32))))) (and .cse5 .cse4 .cse6))) (not (= |addflt_#in~b| (_ bv0 32))) (not (= |addflt_#in~a| (_ bv0 32))))) [2023-02-15 22:46:05,759 INFO L899 garLoopResultBuilder]: For program point addfltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 134) no Hoare annotation was computed. [2023-02-15 22:46:05,759 INFO L895 garLoopResultBuilder]: At program point L115(line 115) the Hoare annotation is: (let ((.cse0 (not (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32)))) (.cse1 (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32))) (.cse2 (not (= (bvadd |addflt_#in~b| (_ bv1 32)) (_ bv0 32))))) (and (or .cse0 (and .cse1 (bvult (bvadd addflt_~ea~0 (_ bv4294967169 32)) (_ bv32 32)) (= addflt_~b |addflt_#in~b|))) (or .cse0 .cse2 (= addflt_~eb~0 (_ bv127 32))) (not (= |addflt_#in~b| (_ bv0 32))) (not (= |addflt_#in~a| (_ bv0 32))) (bvsle (bvadd ((_ sign_extend 1) addflt_~ea~0) (bvneg ((_ sign_extend 1) addflt_~eb~0))) (_ bv2147483647 33)) (or (and .cse1 (= addflt_~ea~0 (_ bv127 32))) .cse2) (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv128 32)) (bvlshr addflt_~a (_ bv24 32)))) (not (= (_ bv0 32) addflt_~b)))) [2023-02-15 22:46:05,759 INFO L899 garLoopResultBuilder]: For program point L115-1(line 115) no Hoare annotation was computed. [2023-02-15 22:46:05,759 INFO L899 garLoopResultBuilder]: For program point L140(line 140) no Hoare annotation was computed. [2023-02-15 22:46:05,759 INFO L899 garLoopResultBuilder]: For program point addfltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 110) no Hoare annotation was computed. [2023-02-15 22:46:05,759 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 133) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point L95(lines 95 101) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point L95-2(lines 94 147) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point addfltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 116) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point L120(lines 120 125) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L895 garLoopResultBuilder]: At program point L145(lines 94 147) the Hoare annotation is: (let ((.cse3 (= (bvadd |addflt_#in~a| (_ bv1 32)) (_ bv0 32)))) (let ((.cse2 (= (bvadd addflt_~a (_ bv1 32)) (_ bv0 32))) (.cse1 (not .cse3)) (.cse5 (not (= (bvadd |addflt_#in~b| (_ bv1 32)) (_ bv0 32)))) (.cse0 (= addflt_~b (_ bv0 32)))) (and (or .cse0 (not (= |addflt_#in~a| (_ bv0 32)))) (let ((.cse4 (= addflt_~b |addflt_#in~b|))) (or .cse1 (and .cse2 .cse3 .cse0 .cse4) (and .cse2 .cse3 (exists ((addflt_~a (_ BitVec 32))) (= (bvadd addflt_~ea~0 (_ bv128 32)) (bvlshr addflt_~a (_ bv24 32)))) .cse4))) (or .cse2 .cse5) (or (and (= addflt_~ea~0 (_ bv127 32)) (= addflt_~eb~0 (_ bv127 32))) .cse1 .cse5) (or .cse0 (not (= |addflt_#in~b| (_ bv0 32))))))) [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point addfltErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 142) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 84 148) the Hoare annotation is: true [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point addfltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 110) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point addfltEXIT(lines 84 148) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point addfltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 116) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point L117-2(line 117) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point L113-1(line 113) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point addfltErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 142) no Hoare annotation was computed. [2023-02-15 22:46:05,760 INFO L899 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2023-02-15 22:46:05,761 INFO L899 garLoopResultBuilder]: For program point L134-1(line 134) no Hoare annotation was computed. [2023-02-15 22:46:05,761 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 19) no Hoare annotation was computed. [2023-02-15 22:46:05,761 INFO L899 garLoopResultBuilder]: For program point L17-2(lines 16 21) no Hoare annotation was computed. [2023-02-15 22:46:05,761 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 16 21) no Hoare annotation was computed. [2023-02-15 22:46:05,761 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 16 21) the Hoare annotation is: true [2023-02-15 22:46:05,761 INFO L899 garLoopResultBuilder]: For program point L18(line 18) no Hoare annotation was computed. [2023-02-15 22:46:05,763 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:46:05,764 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 22:46:05,768 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,768 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,769 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 22:46:05,774 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,774 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,774 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 22:46:05,775 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,775 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,775 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 22:46:05,775 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,775 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,775 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 22:46:05,776 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,776 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,776 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 22:46:05,776 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,776 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,777 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 22:46:05,777 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 22:46:05,778 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 22:46:05,778 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,778 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,778 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 22:46:05,779 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,779 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,779 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 22:46:05,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:46:05 BoogieIcfgContainer [2023-02-15 22:46:05,780 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 22:46:05,780 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 22:46:05,780 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 22:46:05,780 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 22:46:05,781 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:47" (3/4) ... [2023-02-15 22:46:05,782 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-02-15 22:46:05,786 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure base2flt [2023-02-15 22:46:05,786 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure addflt [2023-02-15 22:46:05,786 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-02-15 22:46:05,790 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-02-15 22:46:05,790 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-02-15 22:46:05,790 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2023-02-15 22:46:05,791 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-02-15 22:46:05,805 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) || (m == 0bv32 && __retres4 == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) [2023-02-15 22:46:05,805 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) [2023-02-15 22:46:05,805 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) [2023-02-15 22:46:05,805 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) [2023-02-15 22:46:05,806 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((b == 0bv32 || !(\old(a) == 0bv32)) && ((!(~bvadd128(\old(a), 1bv32) == 0bv32) || (((~bvadd128(a, 1bv32) == 0bv32 && ~bvadd128(\old(a), 1bv32) == 0bv32) && b == 0bv32) && b == \old(b))) || (((~bvadd128(a, 1bv32) == 0bv32 && ~bvadd128(\old(a), 1bv32) == 0bv32) && (\exists addflt_~a : bv32 :: ~bvadd128(ea, 128bv32) == ~bvlshr64(addflt_~a, 24bv32))) && b == \old(b)))) && (~bvadd128(a, 1bv32) == 0bv32 || !(~bvadd128(\old(b), 1bv32) == 0bv32))) && (((ea == 127bv32 && eb == 127bv32) || !(~bvadd128(\old(a), 1bv32) == 0bv32)) || !(~bvadd128(\old(b), 1bv32) == 0bv32))) && (b == 0bv32 || !(\old(b) == 0bv32)) [2023-02-15 22:46:05,815 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 22:46:05,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 22:46:05,815 INFO L158 Benchmark]: Toolchain (without parser) took 18577.94ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 45.9MB in the beginning and 30.1MB in the end (delta: 15.8MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2023-02-15 22:46:05,816 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 49.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:46:05,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.14ms. Allocated memory is still 69.2MB. Free memory was 45.7MB in the beginning and 32.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 22:46:05,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.27ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 32.1MB in the beginning and 62.9MB in the end (delta: -30.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2023-02-15 22:46:05,816 INFO L158 Benchmark]: Boogie Preprocessor took 43.22ms. Allocated memory is still 83.9MB. Free memory was 62.9MB in the beginning and 61.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:46:05,816 INFO L158 Benchmark]: RCFGBuilder took 340.30ms. Allocated memory is still 83.9MB. Free memory was 61.2MB in the beginning and 44.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-02-15 22:46:05,817 INFO L158 Benchmark]: TraceAbstraction took 17841.90ms. Allocated memory is still 83.9MB. Free memory was 44.4MB in the beginning and 34.3MB in the end (delta: 10.1MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2023-02-15 22:46:05,817 INFO L158 Benchmark]: Witness Printer took 35.04ms. Allocated memory is still 83.9MB. Free memory was 34.3MB in the beginning and 30.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 22:46:05,818 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.16ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 49.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.14ms. Allocated memory is still 69.2MB. Free memory was 45.7MB in the beginning and 32.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.27ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 32.1MB in the beginning and 62.9MB in the end (delta: -30.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.22ms. Allocated memory is still 83.9MB. Free memory was 62.9MB in the beginning and 61.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 340.30ms. Allocated memory is still 83.9MB. Free memory was 61.2MB in the beginning and 44.7MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17841.90ms. Allocated memory is still 83.9MB. Free memory was 44.4MB in the beginning and 34.3MB in the end (delta: 10.1MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Witness Printer took 35.04ms. Allocated memory is still 83.9MB. Free memory was 34.3MB in the beginning and 30.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] * 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 - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 71]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 78]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 113]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 113]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 116]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 116]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 134]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 142]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 17.8s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 700 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 681 mSDsluCounter, 8615 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6978 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1740 IncrementalHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 1637 mSDtfsCounter, 1740 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1261 GetRequests, 1098 SyntacticMatches, 6 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=11, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 219 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 181 PreInvPairs, 307 NumberOfFragments, 419 HoareAnnotationTreeSize, 181 FomulaSimplifications, 533 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 17 FomulaSimplificationsInter, 33251 FormulaSimplificationTreeSizeReductionInter, 4.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 862 NumberOfCodeBlocks, 844 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1204 ConstructedInterpolants, 47 QuantifiedInterpolants, 2392 SizeOfPredicates, 50 NumberOfNonLiveVariables, 1646 ConjunctsInSsa, 158 ConjunctsInUnsatCore, 28 InterpolantComputations, 15 PerfectInterpolantSequences, 393/430 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 - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant [2023-02-15 22:46:05,826 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,826 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,826 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 22:46:05,826 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,827 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,827 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: (((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) || (m == 0bv32 && __retres4 == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant [2023-02-15 22:46:05,827 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,827 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,827 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 22:46:05,828 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,828 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,828 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) - InvariantResult [Line: 58]: Loop Invariant [2023-02-15 22:46:05,828 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,829 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,829 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 22:46:05,829 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,829 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,829 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) - InvariantResult [Line: 94]: Loop Invariant [2023-02-15 22:46:05,829 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] [2023-02-15 22:46:05,830 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[addflt_~a,QUANTIFIED] Derived loop invariant: ((((b == 0bv32 || !(\old(a) == 0bv32)) && ((!(~bvadd128(\old(a), 1bv32) == 0bv32) || (((~bvadd128(a, 1bv32) == 0bv32 && ~bvadd128(\old(a), 1bv32) == 0bv32) && b == 0bv32) && b == \old(b))) || (((~bvadd128(a, 1bv32) == 0bv32 && ~bvadd128(\old(a), 1bv32) == 0bv32) && (\exists addflt_~a : bv32 :: ~bvadd128(ea, 128bv32) == ~bvlshr64(addflt_~a, 24bv32))) && b == \old(b)))) && (~bvadd128(a, 1bv32) == 0bv32 || !(~bvadd128(\old(b), 1bv32) == 0bv32))) && (((ea == 127bv32 && eb == 127bv32) || !(~bvadd128(\old(a), 1bv32) == 0bv32)) || !(~bvadd128(\old(b), 1bv32) == 0bv32))) && (b == 0bv32 || !(\old(b) == 0bv32)) - InvariantResult [Line: 36]: Loop Invariant [2023-02-15 22:46:05,830 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,830 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,831 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-15 22:46:05,831 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,831 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-15 22:46:05,831 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] Derived loop invariant: ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || !(\old(m) == 0bv32)) && ((forall v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1 : bv8 :: !(\old(e) == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1))) || (\exists v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2 : bv8 :: e == ~sign_extendFrom8To32(v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2))) RESULT: Ultimate proved your program to be correct! [2023-02-15 22:46:05,855 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 Writing output log to file Ultimate.log Result: TRUE